Sublinear estimation of entropy and information distances

DOI10.1145/1597036.1597038MaRDI QIDQ2930260zbMATH OpenOpenAlexFDO

Authors Sudipto Guha, Andrew McGregor, Suresh Venkatasubramanian

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1597036.1597038

zbMATH Keywords

data streamsentropyinformation divergencesproperty testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Learning and adaptive systems in artificial intelligence (68T05) Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Estimating Entropy and Entropy Norm on Data Streams
• Estimating Entropy and Entropy Norm on Data Streams
• The Complexity of Approximating the Entropy
• Approximating entropy from sublinear samples
• Sketching information divergences

Cited in

(9)

• Sketching information divergences
• Learning the truth vector in high dimensions
• Estimating Entropy and Entropy Norm on Data Streams
• A chasm between identity and equivalence testing with conditional queries
• Estimating the unseen, improved estimators for entropy and other properties
• Sketching Information Divergences
• Estimating Entropy and Entropy Norm on Data Streams
• A scalable entropy estimator
• From -entropy to KL-entropy: analysis of minimum information complexity density estima\-tion

This page was built for publication: Sublinear estimation of entropy and information distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930260)