May 12, 2015

Rapid Approximation of Maximum Logfreedom

Home / Previous Lesson / Next Lesson

Related Dyspoissometer functions: dyspoissometer_logfreedom_max_get(), dyspoissometer_mask_list_pseudoramdom_get(), dyspoissometer_poisson_term_get().

We want to identify the maximum logfreedom, Lmax, attainable given a population list restricted to Q masks and Z mask indexes. This is value is required in order to compute the information sparsity, S, and the dyspoissonism floor, D0.

Unfortunately, my analysis thus far indicates that this task is intractably hard even for practical sizes of Q and Z because it involves a combinatorial optimization problem at its core. But fortunately, approximating Lmax to several digits appears to be readily doable on a cheap computer -- even for Q and Z on the order of (2 ^ 64). The Dyspoissometer demo includes a call to dyspoissometer_logfreedom_max_get() for sake of illustration.

The process is rather complicated and nothing remotely like evaluating a simple power series, so unless you prefer to understand it directly from the C code, I suggest watching the following video. Unfortunately, it was recorded when I still referred to the mask count, Q, as the "block count"; and the mask span, Z, as the "mask count". Hopefully the graphics will make the process sufficiently clear in spite of this.




No comments:

Post a Comment