SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm
13 references·1 citing·31 second hop
Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm (2014)Adaptivity and Optimism: An Improved Expo…A generalized online mirror descent with applications to classification and regression (2014)A generalized online mirror d…Online Optimization with Gradual Variations (2012)Online Optimization with Grad…Online Learning with Predictable Sequences (2012)Online Learning with Predicta…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…On the Universality of Online Mirror Descent (2011)On the Universality of Online…Blackwell Approachability and No-Regret Learning are Equivalent (2011)Blackwell Approachability and…Extracting certainty from uncertainty: regret bounded by variation in costs (2010)Extracting certainty from unc…Adaptive Bound Optimization for Online Convex Optimization (2010)Adaptive Bound Optimization f…Adaptive Online Gradient Descent (2007)Adaptive Online Gradient Desc…Improved second-order bounds for prediction with expert advice (2006)Improved second-order bounds …Tracking the Best Expert (1998)Tracking the Best ExpertExponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Exponentiated Gradient versus…An analog of the minimax theorem for vector payoffs (1956)An analog of the minimax theo…Second-order Quantile Methods for Experts and Combinatorial Games (2015)Second-order Quantile Methods…Online convex programming and generalized infinitesimal gradient ascent (2003)Efficient algorithms for online decision problems (2004)Prediction, Learning, and Games (2006)Adaptive algorithms for online convex optimization with long-term constraints (2016)Online Learning: A Modern Introduction Using Convex Optimization (2019)The Nonstochastic Multiarmed Bandit Problem (2002)Fast Convergence of Regularized Learning in Games (2015)Adaptive Online Learning in Dynamic Environments (2018)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)How to use expert advice (1997)A Game of Prediction with Expert Advice (1998)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Online portfolio selection (2014)Theory of Games and Economic Behavior (1945)Universal Portfolios (1991)Game theory, on-line prediction and boosting (1996)Adaptive Game Playing Using Multiplicative Weights (1999)Theory of games and economic behavior (2019)Some aspects of the sequential design of experiments (1952)A general approach for predicting the behavior of the Supreme Court of the United States (2017)Logarithmic Regret Algorithms for Online Convex Optimization (2006)Efficient Optimal Learning for Contextual Bandits (2011)Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Online Learning: Theory, Algorithms, and Applications (2007)Towards minimax policies for online linear optimization with bandit feedback (2012)Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles (2020)The best of both worlds: stochastic and adversarial bandits (2012)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Hedging the Drift: Learning to Optimize Under Non-Stationarity (2018)
this work references cited by second hop

References

  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 1997Exponentiated Gradient versus Gradient Descent for Linear Predictors856 cited
  • 1956An analog of the minimax theorem for vector payoffs740 cited
  • 1998Tracking the Best Expert557 cited
  • 2010Adaptive Bound Optimization for Online Convex Optimization228 cited
  • 2007Adaptive Online Gradient Descent180 cited
  • 2012Online Learning with Predictable Sequences159 cited
  • 2006Improved second-order bounds for prediction with expert advice154 cited
  • 2011On the Universality of Online Mirror Descent139 cited
  • 2012Online Optimization with Gradual Variations133 cited
  • 2010Extracting certainty from uncertainty: regret bounded by variation in costs113 cited
  • 2011Blackwell Approachability and No-Regret Learning are Equivalent66 cited
  • 2014A generalized online mirror descent with applications to classification and regression54 cited

Cited by

  • 2015Second-order Quantile Methods for Experts and Combinatorial Games42 cited

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