Statistical estimation with bounded memory

DOI10.1007/S11222-011-9293-5MaRDI QIDQ693352zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

DFAautomatonregular approximation

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 5595151 (Why is no real title available?)
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1424324 (Why is no real title available?)
• scientific article; zbMATH DE number 5485578 (Why is no real title available?)
• 10.1162/153244303765208377
• A finite memory test of the irrationality of the parameter of a coin
• An Approximate L¹ -Difference Algorithm for Massive Data Streams
• Compound hypothesis testing with finite memory
• Concentration inequalities for dependent random variables via the martingale method
• Counting large numbers of events in small registers
• Data Streams: Algorithms and Applications
• Elements of Information Theory
• Estimating a binomial parameter with finite memory
• Estimating a probability using finite memory
• Finite memory algorithms for testing bernoulli random variables
• Hypothesis Testing with Finite Statistics
• Learning regular sets from queries and counterexamples
• Learning with Finite Memory
• Markov Chains
• On Memory Saved by Randomization
• On the Effect of a Search Upon the Probability Distribution of a Target Whose Motion is a Diffusion Process
• On the existence of regular approximations
• Optimal approximations of the frequency moments of data streams
• Optimal finite memory learning algorithms for the finite sample problem
• Probabilistic counting algorithms for data base applications
• Probability Inequalities for Sums of Bounded Random Variables
• Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
• The space complexity of approximating the frequency moments

Cited in

(6)

• Narrow big data in a stream: computational limitations and regression
• scientific article; zbMATH DE number 3571306 (Why is no real title available?)
• Empirical risk minimization and complexity of dynamical models
• Learning with bounded memory in stochastic models
• scientific article; zbMATH DE number 3854183 (Why is no real title available?)
• 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)