Fetching the paper…
Reading the bibliography…
We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game.
Asymptotically subminimax solutions of compound statistical decision problems
H. Robbins · 1950
Earlier work this paper cites.
Controlled random walks
D. Blackwell · 1954
Earlier work this paper cites.
Approximation to Bayes risk in repeated play
J. Hannan · 1957
Earlier work this paper cites.
ε \varepsilon -entropy and ε \varepsilon -capacity of sets in function spaces
A.N. Kolmogorov and V.M. Tikhomirov · 1959
Earlier work this paper cites.
Behavior of sequential predictors of binary sequences
T. Cover · 1967
Earlier work this paper cites.
Universal noiseless coding
L. Davisson · 1973
Earlier work this paper cites.
Compound Bayes predictors for sequences with apparent Markov structure
T. M. Cover and A. Shenhar · 1977
Earlier work this paper cites.
A universal algorithm for sequential data compression
J. Ziv and A. Lempel · 1977
Earlier work this paper cites.
Universal coding, information, prediction, and estimation
J. Rissanen · 1984
Earlier work this paper cites.
On Fan’s minimax theorem
J.M. Borwein and D Zhuang · 1986
Earlier work this paper cites.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
N. Littlestone · 1988
Earlier work this paper cites.
Probability in Banach Spaces
M. Ledoux and M. Talagrand · 1991
Earlier work this paper cites.
Universal prediction of individual sequences
M. Feder, N. Merhav, and M. Gutman · 1992
Earlier work this paper cites.
The weighted majority algorithm
N. Littlestone and M. K. Warmuth · 1994
Earlier work this paper cites.
Weak Convergence and Empirical Processes with Applications to Statistics
A. W. van der Vaart and J. A. Wellner · 1996
Cited alongside, same era.
How to use expert advice
N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth · 1997
Cited alongside, same era.
Calibrated learning and correlated equilibrium
D. P. Foster and R. V. Vohra · 1997
Cited alongside, same era.
Boosting the margin: A new explanation for the effectiveness of voting methods
R. E. Schapire, Y. Freund, P. Bartlett, and W.S. Lee · 1997
Cited alongside, same era.
A game of prediction with expert advice
V. Vovk · 1998
Cited alongside, same era.
On prediction of individual sequences
N. Cesa-Bianchi and G. Lugosi · 1999
Cited alongside, same era.
Measure Theory , volume 2
V.I. Bogachev · 2007
Later among the works it cites.
Optimal strategies and minimax lower bounds for online convex games
J. Abernethy, P. L. Bartlett, A. Rakhlin, and A. Tewari · 2008
Later among the works it cites.
A stochastic view of optimal regret through minimax duality
J. Abernethy, A. Agarwal, P. L. Bartlett, and A. Rakhlin · 2009
Later among the works it cites.
Agnostic online learning
S. Ben-David, D. Pal, and S. Shalev-Shwartz · 2009
Later among the works it cites.
The isotron algorithm: High-dimensional isotonic regression
A. T. Kalai and R. Sastry · 2009
Later among the works it cites.
Stochastic convex optimization
S. Shalev-Shwartz, O. Shamir, N. Srebro, and K. Sridharan · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A simple adaptive procedure leading to correlated equilibrium
S. Hart and A. Mas-Colell · 2000
Cited alongside, same era.
Empirical margin distributions and bounding the generalization error of combined classifiers
V. Koltchinskii and D. Panchenko · 2002
Cited alongside, same era.
Rademacher and Gaussian complexities: risk bounds and structural results
P. L. Bartlett and S. Mendelson · 2003
Cited alongside, same era.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Cited alongside, same era.
Efficient algorithms for online decision problems
A. Kalai and S. Vempala · 2005
Cited alongside, same era.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Online learning: Random averages, combinatorial parameters, and learnability
A. Rakhlin, K. Sridharan, and A. Tewari · 2010
Closest in time.
Online learning: Beyond regret
A. Rakhlin, K. Sridharan, and A. Tewari · 2011
Closest in time.
Online learning and online convex optimization
S. Shalev-Shwartz · 2011
Closest in time.
Relax and randomize: From value to algorithms
A. Rakhlin, O. Shamir, and K. Sridharan · 2012
Closest in time.
A very complicated proof of the minimax theorem
J.M. Borwein · 2014
Closest in time.
Statistical learning and sequential prediction, 2014
A. Rakhlin and K. Sridharan · 2014
Closest in time.
Sequential complexities and uniform laws of large numbers
A. Rakhlin, K. Sridharan, and A. Tewari · 2014
Closest in time.