SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Optimal Strategies and Minimax Lower Bounds for Online Convex Games
4 references·7 citing·24 second hop
Optimal Strategies and Minimax Lower Bounds for Online Convex Games (2008)Optimal Strategies and Minimax Lower Boun…Adaptive Online Gradient Descent (2007)Adaptive Online Gradient Desc…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Logarithmic Regret Algorithms for Online Convex Optimization (2006)Logarithmic Regret Algorithms…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Scale-free online learning (2017)Scale-free online learningUnconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations (2014)Unconstrained Online Linear L…Online Linear Optimization via Smoothing (2014)Online Linear Optimization vi…Relax and Randomize : From Value to Algorithms (2012)Relax and Randomize : From Va…Online Learning: Beyond Regret (2010)Online Learning: Beyond RegretA Stochastic View of Optimal Regret through Minimax Duality (2009)A Stochastic View of Optimal …Mind the Duality Gap: Logarithmic regret algorithms for online optimization (2008)Mind the Duality Gap: Logarit…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Online ARIMA Algorithms for Time Series Prediction (2016)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Theory of games and economic behavior (2019)An analog of the minimax theorem for vector payoffs (1956)Approachability, regret and calibration: Implications and equivalences (2014)Efficient algorithms for online decision problems (2004)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Online Learning: Theory, Algorithms, and Applications (2007)Implicit Online Learning (2010)A generalized online mirror descent with applications to classification and regression (2014)The Theory of Learning in Games (1998)Ad click prediction (2013)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Online Learning Algorithms (2020)Blackwell Approachability and No-Regret Learning are Equivalent (2011)Optimal learning with Bernstein online aggregation (2016)An Information-Theoretic Approach to Minimax Regret in Partial Monitoring (2019)Efficient Optimal Learning for Contextual Bandits (2011)Online Learning with Predictable Sequences (2012)
this work references cited by second hop

References

  • 2006Prediction, Learning, and Games3,176 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2006Logarithmic Regret Algorithms for Online Convex Optimization203 cited
  • 2007Adaptive Online Gradient Descent180 cited

Cited by

  • 2008Mind the Duality Gap: Logarithmic regret algorithms for online optimization84 cited
  • 2009A Stochastic View of Optimal Regret through Minimax Duality79 cited
  • 2010Online Learning: Beyond Regret50 cited
  • 2017Scale-free online learning48 cited
  • 2012Relax and Randomize : From Value to Algorithms40 cited
  • 2014Online Linear Optimization via Smoothing34 cited
  • 2014Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations33 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work