SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
5 references·16 citing·38 second hop
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary (2004)Online Geometric Optimization in the Band…Efficient algorithms for online decision problems (2004)Efficient algorithms for onli…Adaptive routing with end-to-end feedback (2004)Adaptive routing with end-to-…Online convex programming and generalized infinitesimal gradient ascent (2003)Online convex programming and…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Gambling in a rigged casino: …Towards minimax policies for online linear optimization with bandit feedback (2012)Towards minimax policies for …Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret (2012)Online Bandit Learning agains…Interior-Point Methods for Full-Information and Bandit Online Learning (2012)Interior-Point Methods for Fu…Introduction to Online Optimization (2011)Introduction to Online Optimi…Beating the adaptive bandit with high probability (2009)Beating the adaptive bandit w…A Structured Multiarmed Bandit Problem and the Greedy Policy (2009)A Structured Multiarmed Bandi…Regret minimization and the price of total anarchy (2008)Regret minimization and the p…High-probability regret bounds for bandit online linear optimization (2008)High-probability regret bound…Adapting to a Changing Environment: the Brownian Restless Bandits. (2008)Adapting to a Changing Enviro…The Price of Bandit Information for Online Optimization (2007)The Price of Bandit Informati…The on-line shortest path problem under partial monitoring (2007)The on-line shortest path pro…Routing without regret (2006)Routing without regretRobbing the bandit: less regret in online geometric optimization against an adaptive adversary (2006)Robbing the bandit: less regr…Approximation algorithms and online mechanisms for item pricing (2006)Approximation algorithms and …On Following the Perturbed Leader in the Bandit Setting (2005)On Following the Perturbed Le…Adaptive Online Prediction by Following the Perturbed Leader (2005)Adaptive Online Prediction by…Some aspects of the sequential design of experiments (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Mortal Multi-Armed Bandits (2008)Explore/Exploit Schemes for Web Content Optimization (2009)Approximation algorithms for restless bandit problems (2010)Studies in the Economics of Transportation. (1956)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Fast convergence to Wardrop equilibria by adaptive sampling methods (2006)Inapproximability of pure nash equilibria (2008)Convergence to approximate Nash equilibria in congestion games (2009)Stability in Competition (1929)Stability in Competition (1990)Worst-Case Equilibria (1999)The price of anarchy in games of incomplete information (2012)Fast Convergence of Regularized Learning in Games (2015)An analog of the minimax theorem for vector payoffs (1956)Prediction, Learning, and Games (2006)Combinatorial Bandits Revisited (2015)Minimal Exploration in Structured Stochastic Bandits (2017)The Theory of Learning in Games (1998)Ad click prediction (2013)Contributions to the theory of games. (1960)How to use expert advice (1997)Algorithms for portfolio management based on the Newton method (2006)Combinatorial bandits (2012)From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning (2014)Multi-Armed Bandit Allocation Indices. (1990)Adaptive Game Playing Using Multiplicative Weights (1999)Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Learning, Regret Minimization, and Equilibria (2007)Online linear optimization and adaptive routing (2007)Competing in the dark: An efficient algorithm for bandit linear optimization (2008)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)Learning to Optimize via Information-Directed Sampling (2017)Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints (2020)
this work references cited by second hop

References

  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2003Online convex programming and generalized infinitesimal gradient ascent1,733 cited
  • 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem741 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 2004Adaptive routing with end-to-end feedback190 cited

Cited by

  • 2007The Price of Bandit Information for Online Optimization161 cited
  • 2007The on-line shortest path problem under partial monitoring151 cited
  • 2008Adapting to a Changing Environment: the Brownian Restless Bandits.141 cited
  • 2008Regret minimization and the price of total anarchy133 cited
  • 2006Routing without regret124 cited
  • 2012Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret121 cited
  • 2011Introduction to Online Optimization108 cited
  • 2005Adaptive Online Prediction by Following the Perturbed Leader107 cited
  • 2009A Structured Multiarmed Bandit Problem and the Greedy Policy93 cited
  • 2006Approximation algorithms and online mechanisms for item pricing93 cited

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

2012
Towards minimax policies for online linear optimization with bandit feedback
86 cited
  • 2012Interior-Point Methods for Full-Information and Bandit Online Learning85 cited
  • 2009Beating the adaptive bandit with high probability72 cited
  • 2006Robbing the bandit: less regret in online geometric optimization against an adaptive adversary71 cited
  • 2008High-probability regret bounds for bandit online linear optimization66 cited
  • 2005On Following the Perturbed Leader in the Bandit Setting57 cited