Statistical estimation with bounded memory
From MaRDI portal
Publication:693352
DOI10.1007/s11222-011-9293-5zbMath1252.62037OpenAlexW1990456402MaRDI QIDQ693352
Publication date: 7 December 2012
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-011-9293-5
Related Items
Narrow big data in a stream: computational limitations and regression ⋮ Empirical risk minimization and complexity of dynamical models
Cites Work
- Probabilistic counting algorithms for data base applications
- Learning regular sets from queries and counterexamples
- A finite memory test of the irrationality of the parameter of a coin
- The space complexity of approximating the frequency moments
- On the existence of regular approximations
- Concentration inequalities for dependent random variables via the martingale method
- 10.1162/153244303765208377
- Data Streams: Algorithms and Applications
- Optimal approximations of the frequency moments of data streams
- Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
- Compound hypothesis testing with finite memory
- Estimating a binomial parameter with finite memory
- Finite memory algorithms for testing bernoulli random variables
- Optimal finite memory learning algorithms for the finite sample problem
- Counting large numbers of events in small registers
- Markov Chains
- Estimating a probability using finite memory
- An Approximate L1 -Difference Algorithm for Massive Data Streams
- Probability Inequalities for Sums of Bounded Random Variables
- Elements of Information Theory
- Hypothesis Testing with Finite Statistics
- Learning with Finite Memory
- On Memory Saved by Randomization
- On the Effect of a Search Upon the Probability Distribution of a Target Whose Motion is a Diffusion Process
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
