Online learning via sequential complexities

MaRDI QIDQ5502109zbMATH OpenFDO

Authors Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari

Publication date 17 August 2015

Full work available at URL http://jmlr.csail.mit.edu/papers/v16/rakhlin15a.html

zbMATH Keywords

online learningregret minimizationsequential complexities

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Inference from stochastic processes and prediction (62M20) Rationality and learning in game theory (91A26)

Recommendations

• On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning
• Structural online learning
• scientific article; zbMATH DE number 1569102
• Online learning and game theory. A quick overview with recent results and applications
• scientific article; zbMATH DE number 7564348

Cited in

(19)

• On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning
• Universal regression with adversarial responses
• scientific article; zbMATH DE number 7415073 (Why is no real title available?)
• scientific article; zbMATH DE number 7014216 (Why is no real title available?)
• Tractability of batch to sequential conversion
• Online learning of quantum states
• scientific article; zbMATH DE number 1569102 (Why is no real title available?)
• Exponential weight approachability, applications to calibration and regret minimization
• Structural online learning
• scientific article; zbMATH DE number 7306919 (Why is no real title available?)
• Discrepancy-based theory and algorithms for forecasting non-stationary time series
• Model theory and agnostic online learning via excellent sets
• The complexity of learning SUBSEQ(A)
• On-line learning and the metrical task system problem
• On-line learning in parity machines
• Dimension independent excess risk by stochastic gradient descent
• Asymptotic sequential Rademacher complexity of a finite function class
• Opportunistic approachability and generalized no-regret problems
• Portfolio selection in non-stationary markets

This page was built for publication: Online learning via sequential complexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502109)