Statistical estimation with bounded memory

DOI10.1007/S11222-011-9293-5zbMATH Open1252.62037OpenAlexW1990456402MaRDI QIDQ693352FDOQ693352

Authors: Aryeh Kontorovich 

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

Recommendations

• scientific article; zbMATH DE number 3854183
• scientific article; zbMATH DE number 3571306
• Estimation with finite memory
• Estimating a probability using finite memory
• Memory-universal prediction of stationary random processes

zbMATH Keywords

DFAautomatonregular approximation

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Applications of statistics (62P99)

Cites Work

• 10.1162/153244303765208377
• Elements of Information Theory
• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• The space complexity of approximating the frequency moments
• Data Streams: Algorithms and Applications
• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• Optimal approximations of the frequency moments of data streams
• Markov Chains
• Title not available (Why is that?)
• On the Effect of a Search Upon the Probability Distribution of a Target Whose Motion is a Diffusion Process
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning with Finite Memory
• Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
• Title not available (Why is that?)
• Concentration inequalities for dependent random variables via the martingale method
• Probabilistic counting algorithms for data base applications
• Title not available (Why is that?)
• An Approximate L¹ -Difference Algorithm for Massive Data Streams
• A finite memory test of the irrationality of the parameter of a coin
• On the existence of regular approximations
• 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
• Estimating a probability using finite memory
• Hypothesis Testing with Finite Statistics
• On Memory Saved by Randomization

Cited In (6)

• Narrow big data in a stream: computational limitations and regression
• Title not available (Why is that?)
• Empirical risk minimization and complexity of dynamical models
• Learning with bounded memory in stochastic models
• Title not available (Why is that?)
• Estimating a probability using finite memory

This page was built for publication: Statistical estimation with bounded memory

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