Approximating entropy from sublinear samples
From MaRDI portal
Recommendations
- The Complexity of Approximating the Entropy
- Estimating the unseen, an \(n/\log(n)\)-sample estimator for entropy and support size, shown optimal via new CLTs
- The complexity of estimating Rényi entropy
- Estimating the unseen, improved estimators for entropy and other properties
- A near-optimal algorithm for estimating the entropy of a stream
Cited in
(12)- Sublinear algorithms for approximating string compressibility
- Guessing probability distributions from small samples
- Sublinear estimation of entropy and information distances
- Optimal bounds for estimating entropy with PMF queries
- Estimating Entropy on<tex>$m$</tex>Bins Given Fewer Than<tex>$m$</tex>Samples
- Strong lower bounds for approximating distribution support size and the distinct elements problem
- Estimating the unseen, improved estimators for entropy and other properties
- Renyi entropy estimation revisited
- Efficient profile maximum likelihood for universal symmetric property estimation
- Sampling, Metric Entropy, and Dimensionality Reduction
- The complexity of estimating Rényi entropy
- Estimating the unseen, an \(n/\log(n)\)-sample estimator for entropy and support size, shown optimal via new CLTs
This page was built for publication: Approximating entropy from sublinear samples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934616)
