Statistical estimation with bounded memory
type: Item
instance of: scholarly article
title: Statistical estimation with bounded memory
zbMATH Open document ID: 1252.62037
published in: Statistics and Computing
publication date: 2012-12-07T00:00:00Z
Mathematics Subject Classification ID: 62G05
Mathematics Subject Classification ID: 62P99
zbMATH DE Number: 6114134
zbMATH Keywords: automaton
zbMATH Keywords: DFA
zbMATH Keywords: regular approximation
author: Aryeh Kontorovich
MaRDI profile type: Publication
full work available at URL: s11222-011-9293-5
OpenAlex ID: W1990456402
cites work: The space complexity of approximating the frequency moments
cites work: Learning regular sets from queries and counterexamples
cites work: 10.1162/153244303765208377
cites work: Markov Chains
cites work: Q5302089
cites work: On the existence of regular approximations
cites work: Hypothesis Testing with Finite Statistics
cites work: Elements of Information Theory
cites work: Optimal finite memory learning algorithms for the finite sample problem
cites work: An Approximate L1 -Difference Algorithm for Massive Data Streams
cites work: Probabilistic counting algorithms for data base applications
cites work: Stream Order and Order Statistics: Quantile Estimation in Random-Order Streams
cites work: Learning with Finite Memory
cites work: On Memory Saved by Randomization
cites work: On the Effect of a Search Upon the Probability Distribution of a Target Whose Motion is a Diffusion Process
cites work: Q4945538
cites work: A finite memory test of the irrationality of the parameter of a coin
cites work: Finite memory algorithms for testing bernoulli random variables
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Optimal approximations of the frequency moments of data streams
cites work: Q2774021
cites work: Q4094202
cites work: Concentration inequalities for dependent random variables via the martingale method
cites work: Compound hypothesis testing with finite memory
cites work: Estimating a probability using finite memory
cites work: Q3915990
cites work: Counting large numbers of events in small registers
cites work: Data Streams: Algorithms and Applications
cites work: Estimating a binomial parameter with finite memory
cites work: Q3392273
cites work: Q3214824
DOI: 10.1007/S11222-011-9293-5
description: scientific article; zbMATH DE number 6114134