Fetching the paper…
Reading the bibliography…
This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations.
Theory of probability
Sergei Bernstein · 1927
Earlier work this paper cites.
Étude Critique de la Notion de Collectif
Jean Ville · 1939
Earlier work this paper cites.
Sequential Tests of Statistical Hypotheses
Abraham Wald · 1945
Earlier work this paper cites.
Sequential Analysis
Abraham Wald · 1947
Earlier work this paper cites.
A mathematical theory of communication
Claude Elwood Shannon · 1948
Earlier work this paper cites.
Stochastic Processes , volume 10
Joseph Leo Doob · 1953
Earlier work this paper cites.
A new interpretation of information rate
John L Kelly Jr · 1956
Earlier work this paper cites.
Optimal gambling systems for favorable games
Leo Breiman · 1961
Earlier work this paper cites.
Probability Inequalities for the Sum of Independent Random Variables
George Bennett · 1962
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1963
Earlier work this paper cites.
The definition of random sequences
Per Martin-Löf · 1966
Earlier work this paper cites.
Iterated logarithm inequalities and related statistical procedures
Herbert Robbins and David Siegmund · 1968
Earlier work this paper cites.
Confidence limits for the expected value of an arbitrary bounded random variable with a continuous distribution function
Theodore Anderson · 1969
Earlier work this paper cites.
Probability distributions related to the law of the iterated logarithm
Herbert Robbins and David Siegmund · 1969
Earlier work this paper cites.
Statistical methods related to the law of the iterated logarithm
Herbert Robbins · 1970
Earlier work this paper cites.
Boundary crossing probabilities for the Wiener process and sample sums
Herbert Robbins and David Siegmund · 1970
Earlier work this paper cites.
A class of stopping rules for testing parametric hypotheses
Herbert Robbins and David Siegmund · 1972
Earlier work this paper cites.
Universal gambling schemes and the complexity measures of Kolmogorov and Chaitin
Thomas M Cover · 1974
Earlier work this paper cites.
The expected sample size of some tests of power one
Herbert Robbins and David Siegmund · 1974
Earlier work this paper cites.
Probability inequalities for the sum in sampling without replacement
Robert J Serfling · 1974
Earlier work this paper cites.
On Confidence Sequences
Tze Leung Lai · 1976
Earlier work this paper cites.
Competitive optimality of logarithmic investment
Robert M Bell and Thomas M Cover · 1980
Earlier work this paper cites.
The performance of universal encoding
Raphail Krichevsky and Victor Trofimov · 1981
Earlier work this paper cites.
An algorithm for maximizing expected log investment return
Thomas M Cover · 1984
Earlier work this paper cites.
Present position and potential developments: Some personal views statistical theory the prequential approach
A Philip Dawid · 1984
Earlier work this paper cites.
Universal coding, information, prediction, and estimation
Jorma Rissanen · 1984
Earlier work this paper cites.
Log optimal portfolios
Thomas M Cover · 1987
Earlier work this paper cites.
Game-theoretic optimal portfolios
Robert Bell and Thomas M Cover · 1988
Earlier work this paper cites.
Methodology and algorithms of empirical likelihood
Peter Hall and Barbara La Scala · 1990
Earlier work this paper cites.
Universal portfolios
Thomas M Cover · 1991
Cited alongside, same era.
A logic of probability, with application to the foundations of statistics
Vladimir G Vovk · 1993
Cited alongside, same era.
Dual likelihood
Per Aslak Mykland · 1995
Cited alongside, same era.
Prequential analysis
A Philip Dawid · 1997
Cited alongside, same era.
Large deviation methods for approximate probabilistic inference
Michael Kearns and Lawrence Saul · 1998
Cited alongside, same era.
Stochastic Complexity in Statistical Inquiry , volume 15
Jorma Rissanen · 1998
Cited alongside, same era.
Estimation of mixture models
Qiang Jonathan Li · 1999
Sharp finite-time iterated-logarithm martingale concentration
Akshay Balsubramani · 2014
Later among the works it cites.
Concentration inequalities for sampling without replacement
Rémi Bardenet and Odalric-Ambrym Maillard · 2015
Later among the works it cites.
Exponential inequalities for martingales with applications
Xiequan Fan, Ion Grama, and Quansheng Liu · 2015
Later among the works it cites.
Bridges: A uniquely flexible hpc resource for new communities and data analytics
Nicholas A. Nystrom, Michael J. Levine, Ralph Z. Roskies, and J. Ray Scott · 2015
Later among the works it cites.
Coin betting and parameter-free online learning
Francesco Orabona and David Pal · 2016
Later among the works it cites.
Adaptive concentration inequalities for sequential decision problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Empirical likelihood
Art B Owen · 2001
Cited alongside, same era.
Probability and Finance: It’s Only a Game!
Glenn Shafer and Vladimir Vovk · 2001
Cited alongside, same era.
On Hoeffding’s inequalities
Vidmantas Bentkus · 2004
Cited alongside, same era.
Self-normalized processes: exponential inequalities, moment bounds and iterated logarithm laws
Victor H. de la Peña, Michael J. Klass, and Tze Leung Lai · 2004
Cited alongside, same era.
Nonanticipating estimation applied to sequential analysis and changepoint detection
Gary Lorden and Moshe Pollak · 2005
Cited alongside, same era.
Shengjia Zhao, Enze Zhou, Ashish Sabharwal, and Stefano Ermon · 2016
Later among the works it cites.
Improved strongly adaptive online learning using coin betting
Kwang-Sung Jun, Francesco Orabona, Stephen Wright, and Rebecca Willett · 2017
Later among the works it cites.
Training deep networks without learning rates through coin betting
Francesco Orabona and Tatiana Tommasi · 2017
Later among the works it cites.
On equivalence of martingale tail bounds and deterministic regret inequalities
Alexander Rakhlin and Karthik Sridharan · 2017
Later among the works it cites.
Black-box reductions for parameter-free online learning in Banach spaces
Ashok Cutkosky and Francesco Orabona · 2018
Later among the works it cites.
Test martingales for bounded random variables
Harrie Hendriks · 2018
Later among the works it cites.
Peter Grünwald, Rianne de Heide, and Wouter Koolen · 2019
Later among the works it cites.
Parameter-free online convex optimization with sub-exponential noise
Kwang-Sung Jun and Francesco Orabona · 2019
Later among the works it cites.
A new confidence interval for the mean of a bounded random variable
Erik Learned-Miller and Philip S Thomas · 2019
Later among the works it cites.
Game-Theoretic Foundations for Probability and Finance
Glenn Shafer and Vladimir Vovk · 2019
Later among the works it cites.
Time-uniform Chernoff bounds via nonnegative supermartingales
Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon · 2020
Closest in time.
Admissible anytime-valid sequential inference must rely on nonnegative martingales
Aaditya Ramdas, Johannes Ruf, Martin Larsson, and Wouter Koolen · 2020
Closest in time.
Sets of half-average nulls generate risk-limiting audits: SHANGRLA
Philip B Stark · 2020
Closest in time.
Universal inference
Larry Wasserman, Aaditya Ramdas, and Sivaraman Balakrishnan · 2020
Closest in time.
Confidence sequences for sampling without replacement
Ian Waudby-Smith and Aaditya Ramdas · 2020
Closest in time.
Time-uniform, nonparametric, nonasymptotic confidence sequences
Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon · 2021
Closest in time.
Mixture martingales revisited with applications to sequential tests and confidence intervals
Emilie Kaufmann and Wouter M. Koolen · 2021
Closest in time.
Near-optimal confidence sequences for bounded random variables
Arun K Kuchibhotla and Qinqing Zheng · 2021
Closest in time.
Towards practical mean bounds for small samples
My Phan, Philip S Thomas, and Erik Learned-Miller · 2021
Closest in time.
Testing exchangeability: Fork-convexity, supermartingales and e-processes
Aaditya Ramdas, Johannes Ruf, Martin Larsson, and Wouter M Koolen · 2021
Closest in time.
The language of betting as a strategy for statistical and scientific communication
Glenn Shafer · 2021
Closest in time.
Testing randomness online
Vladimir Vovk · 2021
Closest in time.
Sequential estimation of quantiles with applications to A/B testing and best-arm identification
Steven R. Howard and Aaditya Ramdas · 2022
Closest in time.