Estimating the entropy of binary time series: Methodology, some theory and a simulation study
Y. Gao, I. Kontoyiannis, E. Bienenstock

TL;DR
This paper compares popular entropy estimation methods for binary time series, introduces new estimators, proves their consistency, and evaluates their performance through extensive simulations, highlighting the strengths and weaknesses of each approach.
Contribution
It introduces two new Lempel-Ziv-based entropy estimators with proven consistency and provides a comprehensive comparison of multiple methods including theoretical analysis and simulation results.
Findings
CTW method yields the most accurate estimates
LZ-based estimators perform comparably to plug-in methods
Bias is the main source of error across estimators
Abstract
Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and extensive comparison between some of the most popular and effective entropy estimation methods used in practice: The plug-in method, four different estimators based on the Lempel-Ziv (LZ) family of data compression algorithms, an estimator based on the Context-Tree Weighting (CTW) method, and the renewal entropy estimator. **Methodology. Three new entropy estimators are introduced. For two of the four LZ-based estimators, a bootstrap procedure is described for evaluating their standard error, and a practical rule of thumb is heuristically derived for selecting the values of their parameters. ** Theory. We prove that, unlike their earlier versions, the two new LZ-based estimators are consistent for every finite-valued, stationary and ergodic process. An effective method is derived for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
