< Back to Article

Estimating information in time-varying signals

Fig 7

Comparison of decoding-based and knn information estimators.

Information estimates for decoding-based (color bars) and knn (gray bar) algorithms (here we set k = 1, for further details on knn estimation, including varying k, see S5 Fig). Note that knn is not a decoding estimator and thus could exceed (shown as a horizontal black line for each of the three example cases) to approach the exact I_exact(X; U). Here we use trajectories discretized over d = 100 time bins, and N = 10⁴ trajectory samples per input. The performance of knn can be substantially improved by adding a small amount of gaussian noise to the trajectory samples; its resulting performance as a function of N and d is shown in S5 Fig. Red star denotes the failure of knn on Example 3 where substantially negative information values are returned (exact value not plotted).

doi: https://doi.org/10.1371/journal.pcbi.1007290.g007