SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online linear optimization and adaptive routing
10 references·16 citing·35 second hop
Online linear optimization and adaptive routing (2007)Online linear optimization and adaptive r…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Nearly Tight Bounds for the Continuum-Armed Bandit Problem (2004)Nearly Tight Bounds for the C…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: …A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)A Decision-Theoretic Generali…The Continuum-Armed Bandit Problem (1995)The Continuum-Armed Bandit Pr…Bandit Problems, Sequential Allocation of Experiments. (1987)Bandit Problems, Sequential A…Bandits and Experts in Metric Spaces (2019)Bandits and Experts in Metric…Minimal Exploration in Structured Stochastic Bandits (2017)Minimal Exploration in Struct…Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit (2016)Online Context-Aware Recommen…Multi-armed bandits with application to 5G small cells (2016)Multi-armed bandits with appl…Adaptive algorithms for online convex optimization with long-term constraints (2016)Adaptive algorithms for onlin…Personalized Recommendation via Parameter-Free Contextual Bandits (2015)Personalized Recommendation v…Commitment Without Regrets (2015)Commitment Without RegretsCharacterizing Truthful Multi-armed Bandit Mechanisms (2014)Characterizing Truthful Multi…Ranked bandits in metric spaces: learning diverse rankings over large document collections (2013)Ranked bandits in metric spac…Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems (2013)Deterministic Sequencing of E…Projection-free Online Learning (2012)Projection-free Online Learni…Interior-Point Methods for Full-Information and Bandit Online Learning (2012)Interior-Point Methods for Fu…Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States (2012)Adaptive Shortest-Path Routin…A Value Model for Evaluating Homeland Security Decisions (2011)A Value Model for Evaluating …Non-Stochastic Bandit Slate Problems (2010)Non-Stochastic Bandit Slate P…A Structured Multiarmed Bandit Problem and the Greedy Policy (2009)A Structured Multiarmed Bandi…Exponentiated Gradient versus Gradient Descent for Linear Predictors (1997)Multi-armed bandits in metric spaces (2008)Linearly Parameterized Bandits (2010)Introduction to Stochastic Programming (2011)Some aspects of the sequential design of experiments (1952)Stochastic Approximation Methods for Constrained and Unconstrained Systems (1978)Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Improved Rates for the Stochastic Continuum-Armed Bandit Problem (2007)Contextual Multi-Armed Bandits (2010)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Stochastic Estimation of the Maximum of a Regression Function (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Contextual Bandits with Similarity Information (2009)Interactively optimizing information retrieval systems as a dueling bandits problem (2009)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)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)Multi-armed Bandit Algorithms and Empirical Evaluation (2005)Prediction, Learning, and Games (2006)Survey on speech emotion recognition: Features, classification schemes, and databases (2010)Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary (2004)Learning, Regret Minimization, and Equilibria (2007)Competing in the dark: An efficient algorithm for bandit linear optimization (2008)Learning by Doing and the Choice of Technology (1996)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)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)
this work references cited by second hop

References

  • 1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting20,469 cited
  • 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
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient599 cited
  • 2004Efficient algorithms for online decision problems595 cited
  • 1987Bandit Problems, Sequential Allocation of Experiments.566 cited
  • 2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem285 cited
  • 1995The Continuum-Armed Bandit Problem201 cited
  • 2004Adaptive routing with end-to-end feedback190 cited

Cited by

  • 2012Projection-free Online Learning140 cited
  • 2016Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit135 cited
  • 2016Multi-armed bandits with application to 5G small cells129 cited
  • 2017Minimal Exploration in Structured Stochastic Bandits113 cited
  • 2011A Value Model for Evaluating Homeland Security Decisions106 cited

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

  • 2009A Structured Multiarmed Bandit Problem and the Greedy Policy93 cited
  • 2013Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems90 cited
  • 2016Adaptive algorithms for online convex optimization with long-term constraints89 cited
  • 2012Interior-Point Methods for Full-Information and Bandit Online Learning85 cited
  • 2015Personalized Recommendation via Parameter-Free Contextual Bandits80 cited
  • 2019Bandits and Experts in Metric Spaces75 cited
  • 2015Commitment Without Regrets71 cited
  • 2013Ranked bandits in metric spaces: learning diverse rankings over large document collections63 cited
  • 2010Non-Stochastic Bandit Slate Problems61 cited
  • 2014Characterizing Truthful Multi-armed Bandit Mechanisms45 cited
  • 2012Adaptive Shortest-Path Routing under Unknown and Stochastically Varying Link States43 cited