Online learning via sequential complexities
From MaRDI portal
Publication:5502109
zbMATH Open1337.68232MaRDI QIDQ5502109FDOQ5502109
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Inference from stochastic processes and prediction (62M20) Rationality and learning in game theory (91A26)
Cited In (19)
- Universal regression with adversarial responses
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online learning of quantum states
- Tractability of batch to sequential conversion
- Title not available (Why is that?)
- Exponential weight approachability, applications to calibration and regret minimization
- Title not available (Why is that?)
- Structural online learning
- 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
- Portfolio selection in non-stationary markets
- Asymptotic sequential Rademacher complexity of a finite function class
- Opportunistic approachability and generalized no-regret problems
- On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning
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)
