scientific article; zbMATH DE number 6472983

zbMath1337.68232MaRDI QIDQ5502109

Ambuj Tewari, Karthik Sridharan, Alexander Rakhlin

Publication date: 17 August 2015

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

online learningregret minimizationsequential complexities

Mathematics Subject Classification ID

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

Related Items

Discrepancy-based theory and algorithms for forecasting non-stationary time series ⋮ Universal regression with adversarial responses ⋮ Asymptotic sequential Rademacher complexity of a finite function class ⋮ Unnamed Item ⋮ Dimension independent excess risk by stochastic gradient descent ⋮ Opportunistic Approachability and Generalized No-Regret Problems ⋮ Online learning of quantum states ⋮ Unnamed Item ⋮ Exponential weight approachability, applications to calibration and regret minimization ⋮ Portfolio selection in non-stationary markets