Fetching the paper…
Reading the bibliography…
We study the generalization performance of online learning algorithms trained on samples coming from a dependent source of data.
Weighted sums of certain dependent random variables
K. Azuma · 1967
Earlier work this paper cites.
On tail probabilities for martingales
D. A. Freedman · 1975
Earlier work this paper cites.
Probability and Measure
P. Billingsley · 1986
Earlier work this paper cites.
A Monte Carlo implementation of the EM algorithm and the poor man’s data augmentation algorithms
G. Wei and M. A. Tanner · 1990
Earlier work this paper cites.
Rates of convergence for empirical processes of stationary mixing sequences
B. Yu · 1994
Earlier work this paper cites.
Convex Analysis and Minimization Algorithms I & II
J. Hiriart-Urruty and C. Lemaréchal · 1996
Earlier work this paper cites.
Minimum complexity regression estimation with weakly dependent observations
D. Modha and E. Masry · 1996
Earlier work this paper cites.
Tracking the best expert
M. Herbster and M. Warmuth · 1998
Earlier work this paper cites.
Nonparametric time series prediction through adaptive model selection
R. Meir · 2000
Earlier work this paper cites.
Tracking the best linear predictor
M. Herbster and M. Warmuth · 2001
Earlier work this paper cites.
Stability and generalization
O. Bousquet and A. Elisseeff · 2002
Cited alongside, same era.
Polynomial convergence rates of markov chains
S. F. Jarner and G. O. Roberts · 2002
Cited alongside, same era.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Cited alongside, same era.
Stochastic Approximation and Recursive Algorithms and Applications
H. J. Kushner and G. Yin · 2003
Cited alongside, same era.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2004
Cited alongside, same era.
Local rademacher complexities
P. Bartlett, O. Bousquet, and S. Mendelson · 2005
Cited alongside, same era.
On the generalization ability of online strongly convex programming algorithms
S. M. Kakade and A. Tewari · 2009
Later among the works it cites.
Markov Chains and Stochastic Stability
S. Meyn and R. L. Tweedie · 2009
Later among the works it cites.
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Later among the works it cites.
Fast learning from non-i.i.d. observations
I. Steinwart and A. Christmann · 2009
Later among the works it cites.
The generalization performance of ERM algorithm with strongly mixing observations
B. Zou, L. Li, and Z. Xu · 2009
Later among the works it cites.
Composite objective mirror descent
J. Duchi, S. Shalev-Shwartz, Y. Singer, and A. Tewari · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Basic properties of strong mixing conditions. a survey and some open questions
R. C. Bradley · 2005
Cited alongside, same era.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Cited alongside, same era.
Logarithmic regret algorithms for online convex optimization
E. Hazan, A. Agarwal, and S. Kale · 2007
Cited alongside, same era.
Logarithmic regret algorithms for strongly convex repeated games
S. Shalev-Shwartz and Y. Singer · 2007
Cited alongside, same era.
Stability bounds for stationary ϕ \phi -mixing and β \beta -mixing processes
M. Mohri and A. Rostamizadeh · 2010
Later among the works it cites.
Dual averaging methods for regularized stochastic learning and online optimization
L. Xiao · 2010
Later among the works it cites.
J. C. Duchi, A. Agarwal, M. Johansson, and M. I. Jordan · 2011
Closest in time.
Pegasos: primal estimated sub-gradient solver for SVM
S. Shalev-Shwartz, Y. Singer, N. Srebro, and A. Cotter · 2011
Closest in time.