SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Strongly Adaptive Online Learning
8 references·4 citing·36 second hop
Strongly Adaptive Online Learning (2015)Strongly Adaptive Online LearningFrom External to Internal Regret (2018)From External to Internal Reg…Online Optimization : Competing with Dynamic Comparators (2015)Online Optimization : Competi…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Tracking a Small Set of Experts by Mixing Past Posteriors (2001)Tracking a Small Set of Exper…Tracking the Best Expert (1998)Tracking the Best ExpertUsing and combining predictors that specialize (1997)Using and combining predictor…How to use expert advice (1997)How to use expert adviceLearning and Information in Stochastic Networks and Queues (2021)Learning and Information in S…Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles (2020)Beyond UCB: Optimal and Effic…Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics (2017)Random Feature-based Online M…Learning and Efficiency in Games with Dynamic Population (2015)Learning and Efficiency in Ga…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Online portfolio selection (2014)Contributions to the theory of games. (1960)The Asymptotic Theory of Extreme Order Statistics (1990)Adaptive Game Playing Using Multiplicative Weights (1999)Efficient algorithms for online decision problems (2004)A Game of Prediction with Expert Advice (1998)Averaging Expert Predictions (1999)Mortal Multi-Armed Bandits (2008)Regret bounds for sleeping experts and bandits (2010)Some aspects of the sequential design of experiments (1952)Prediction, Learning, and Games (2006)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)A general approach for predicting the behavior of the Supreme Court of the United States (2017)Online convex programming and generalized infinitesimal gradient ascent (2003)Logarithmic regret algorithms for online convex optimization (2007)Adaptive Online Learning in Dynamic Environments (2018)Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (2019)The Theory of Learning in Games (1998)Learning to Bid Without Knowing your Value (2018)Routing Games in the Wild: Efficiency, Equilibration, Regret, and a Price of Anarchy Bound via Long Division (2022)Improved Algorithms for Linear Stochastic Bandits (2011)Neural Thompson Sampling (2020)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Online Learning and Online Convex Optimization (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Efficient learning algorithms for changing environments (2009)Learning Permutations with Exponential Weights (2009)Hedging structured concepts (2010)Regret Minimization Under Partial Monitoring (2006)Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret (2012)Moving average reversion strategy for on-line portfolio selection (2015)
this work references cited by second hop

References

  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 1997How to use expert advice631 cited
  • 1998Tracking the Best Expert557 cited
  • 1997Using and combining predictors that specialize237 cited
  • 2015Online Optimization : Competing with Dynamic Comparators175 cited
  • 2018From External to Internal Regret163 cited
  • 2001Tracking a Small Set of Experts by Mixing Past Posteriors124 cited

Cited by

  • 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles75 cited
  • 2015Learning and Efficiency in Games with Dynamic Population56 cited
  • 2017Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics50 cited
  • 2021Learning and Information in Stochastic Networks and Queues23 cited

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