SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Adaptive Regret of Convex and Smooth Functions
16 references·0 citing·30 second hopsampled
Adaptive Regret of Convex and Smooth Functions (2019)Adaptive Regret of Convex and Smooth Func…Adaptive Online Learning in Dynamic Environments (2018)Adaptive Online Learning in D…Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient (2016)Tracking Slowly Moving Clairv…Online optimization in dynamic environments: Improved regret rates for strongly convex problems (2016)Online optimization in dynami…Introduction to Online Convex Optimization (2016)Introduction to Online Convex…Improved Dynamic Regret for Non-degenerate Functions (2016)Improved Dynamic Regret for N…Strongly Adaptive Online Learning (2015)Strongly Adaptive Online Lear…Online Optimization : Competing with Dynamic Comparators (2015)Online Optimization : Competi…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…Efficient learning algorithms for changing environments (2009)Efficient learning algorithms…Optimal Strategies and Minimax Lower Bounds for Online Convex Games (2008)Optimal Strategies and Minima…Online Learning: Theory, Algorithms, and Applications (2007)Online Learning: Theory, Algo…Logarithmic regret algorithms for online convex optimization (2007)Logarithmic regret algorithms…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…Adaptive and self-confident on-line learning algorithms (2002)Adaptive and self-confident o…Tracking the Best Expert (1998)Tracking the Best ExpertA 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 (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Theory of games and economic behavior (2019)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)How to use expert advice (1997)Using confidence bounds for exploitation-exploration trade-offs (2003)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Big Data Deep Learning: Challenges and Perspectives (2014)A survey of machine learning for big data processing (2016)A survey on deep learning for big data (2017)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Non-Stationary Stochastic Optimization (2013)Introduction to Online Convex Optimization (2016)The Theory of Learning in Games (1998)A Simple Adaptive Procedure Leading to Correlated Equilibrium (2000)The Pricing of Options and Corporate Liabilities (1973)An Online Convex Optimization Approach to Proactive Network Resource Allocation (2017)A Marketplace for Data (2019)Introduction to Multi-Armed Bandits (2019)Improved second-order bounds for prediction with expert advice (2006)Regret Minimization Under Partial Monitoring (2006)Online Markov Decision Processes (2009)Bandit Algorithms (2020)Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (2019)Online Convex Optimization With Time-Varying Constraints and Bandit Feedback (2018)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2006Prediction, Learning, and Games3,223 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,789 cited
  • 2011Online Learning and Online Convex Optimization1,170 cited
  • 2016Introduction to Online Convex Optimization893 cited
  • 2007Logarithmic regret algorithms for online convex optimization844 cited
  • 1998Tracking the Best Expert559 cited
  • 2007Online Learning: Theory, Algorithms, and Applications316 cited
  • 2016Online optimization in dynamic environments: Improved regret rates for strongly convex problems190 cited
  • 2002Adaptive and self-confident on-line learning algorithms181 cited
  • 2015Online Optimization : Competing with Dynamic Comparators175 cited
  • 2009Efficient learning algorithms for changing environments109 cited
  • 2008Optimal Strategies and Minimax Lower Bounds for Online Convex Games105 cited
  • 2018Adaptive Online Learning in Dynamic Environments89 cited
  • 2016Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient84 cited
  • 2016Improved Dynamic Regret for Non-degenerate Functions80 cited

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

2015
Strongly Adaptive Online Learning
77 cited

Cited by

No citing works inside the corpus for this window.