Interior-Point Methods for Full-Information and Bandit Online Learning
From MaRDI portal
Publication:5271795
DOI10.1109/TIT.2012.2192096zbMath1365.90269OpenAlexW2122299160MaRDI QIDQ5271795
Jacob Abernethy, Elad Hazan, Alexander Rakhlin
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2012.2192096
Convex programming (90C25) Interior-point methods (90C51) Convex functions and convex programs in convex geometry (52A41)
Related Items (5)
No Regret Learning in Oligopolies: Cournot vs. Bertrand ⋮ Generalized mirror descents in congestion games ⋮ A generalized online mirror descent with applications to classification and regression ⋮ Unnamed Item ⋮ On two continuum armed bandit problems in high dimensions
This page was built for publication: Interior-Point Methods for Full-Information and Bandit Online Learning
