Sketching information divergences
From MaRDI portal
Publication:1009269
DOI10.1007/s10994-008-5054-xzbMath1472.68141OpenAlexW2114203129MaRDI QIDQ1009269
Andrew McGregor, Sudipto Guha, Piotr Indyk
Publication date: 31 March 2009
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-008-5054-x
Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25) Statistical aspects of information-theoretic topics (62B10) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An information statistics approach to data stream and communication complexity
- On surrogate loss functions and \(f\)-divergences
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
- On the distributional complexity of disjointness
- The space complexity of approximating the frequency moments
- Min-wise independent permutations
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Differential-geometrical methods in statistics
- Extensions of Lipschitz mappings into a Hilbert space
- On the impossibility of dimension reduction in l 1
- Space lower bounds for distance approximation in the data stream model
- Optimal approximations of the frequency moments of data streams
- Streaming and sublinear approximation of entropy and information distances
- Simpler algorithm for estimating frequency moments of data streams
- On Estimating Frequency Moments of Data Streams
- An improved data stream summary: the count-min sketch and its applications
- An Approximate L1 -Difference Algorithm for Massive Data Streams
- Logistic regression, AdaBoost and Bregman distances
This page was built for publication: Sketching information divergences
