SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive Online Gradient Descent
3 references·13 citing·30 second hop
Adaptive Online Gradient Descent (2007)Adaptive Online Gradient DescentPrediction, 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…Online Learning: A Modern Introduction Using Convex Optimization (2019)Online Learning: A Modern Int…(Bandit) Convex Optimization with Biased Noisy Gradient Oracles (2016)(Bandit) Convex Optimization …Exploiting easy data in online optimization (2014)Exploiting easy data in onlin…Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm (2014)Adaptivity and Optimism: An I…A generalized online mirror descent with applications to classification and regression (2014)A generalized online mirror d…Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand (2013)Online Sequential Optimizatio…Online Learning with Predictable Sequences (2012)Online Learning with Predicta…Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Trading Regret for Efficiency…Efficient Optimal Learning for Contextual Bandits (2011)Efficient Optimal Learning fo…On the convergence of regret minimization dynamics in concave games (2009)On the convergence of regret …A Stochastic View of Optimal Regret through Minimax Duality (2009)A Stochastic View of Optimal …Optimal Strategies and Minimax Lower Bounds for Online Convex Games (2008)Optimal Strategies and Minima…Mind the Duality Gap: Logarithmic regret algorithms for online optimization (2008)Mind the Duality Gap: Logarit…Logarithmic regret algorithms for online convex optimization (2007)Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Online Convex Optimization With Time-Varying Constraints and Bandit Feedback (2018)Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online ARIMA Algorithms for Time Series Prediction (2016)Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)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)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Theory of games and economic behavior (2019)The Nonstochastic Multiarmed Bandit Problem (2002)Efficient algorithms for online decision problems (2004)Fast Convergence of Regularized Learning in Games (2015)Adaptive Online Learning in Dynamic Environments (2018)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Online Learning: Theory, Algorithms, and Applications (2007)Implicit Online Learning (2010)The Theory of Learning in Games (1998)Ad click prediction (2013)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)Finite-Time Analysis of Kernelised Contextual Bandits (2013)From Ads to Interventions: Contextual Bandits in Mobile Health (2017)Adaptive Treatment Assignment in Experiments for Policy Choice (2021)Answering the Queen: Machine Learning and Financial Crises (2020)Online Learning: Beyond Regret (2010)
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

Cited by

  • 2011Efficient Optimal Learning for Contextual Bandits174 cited
  • 2011Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints168 cited
  • 2012Online Learning with Predictable Sequences159 cited
  • 2019Online Learning: A Modern Introduction Using Convex Optimization111 cited
  • 2008Optimal Strategies and Minimax Lower Bounds for Online Convex Games105 cited
  • 2008Mind the Duality Gap: Logarithmic regret algorithms for online optimization84 cited
  • 2009A Stochastic View of Optimal Regret through Minimax Duality79 cited
  • 2009On the convergence of regret minimization dynamics in concave games78 cited
  • 2014A generalized online mirror descent with applications to classification and regression54 cited
  • 2014Adaptivity and Optimism: An Improved Exponentiated Gradient Algorithm46 cited
  • 2016(Bandit) Convex Optimization with Biased Noisy Gradient Oracles38 cited
  • 2014Exploiting easy data in online optimization

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

37 cited
  • 2013Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand23 cited