SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online convex optimization and no-regret learning: Algorithms, guarantees and applications
15 references·1 citing·31 second hop
Online convex optimization and no-regret learning: Algorithms, guarantees and applications (2018)Online convex optimization and no-regret …A continuous-time approach to online optimization (2017)A continuous-time approach to…Learning in Games via Reinforcement and Regularization (2016)Learning in Games via Reinfor…Non-Stationary Stochastic Optimization (2015)Non-Stationary Stochastic Opt…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…Regret Bounds and Minimax Policies under Partial Monitoring (2010)Regret Bounds and Minimax Pol…Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback. (2010)Optimal Algorithms for Online…Online Learning: Theory, Algorithms, and Applications (2007)Online Learning: Theory, Algo…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …How to use expert advice (1997)How to use expert adviceA one-measurement form of simultaneous perturbation stochastic approximation (1997)A one-measurement form of sim…Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)Sample mean based index polic…Multi-Armed Bandit Allocation Indices. (1990)Multi-Armed Bandit Allocation…Contributions to the theory of games. (1960)Contributions to the theory o…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints (2019)Cautious Regret Minimization:…The Asymptotic Theory of Extreme Order Statistics (1990)Tracking the Best Expert (1998)Adaptive Game Playing Using Multiplicative Weights (1999)Efficient algorithms for online decision problems (2004)A Stochastic Approximation Method (1951)Bandit Processes and Dynamic Allocation Indices (1979)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Introduction to Multi-Armed Bandits (2019)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Online Learning and Online Convex Optimization (2012)Online convex programming and generalized infinitesimal gradient ascent (2003)On the Universality of Online Mirror Descent (2011)Regret in Online Combinatorial Optimization (2013)Learning in games with continuous action sets and unknown payoff functions (2018)Robust Convex Optimization (1998)Online Optimization : Competing with Dynamic Comparators (2015)Online optimization in dynamic environments: Improved regret rates for strongly convex problems (2016)An Online Convex Optimization Approach to Proactive Network Resource Allocation (2017)Linearly Parameterized Bandits (2010)On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)Games of perfect information, predatory pricing and the chain-store paradox (1981)The application of fuzzy integrals in multicriteria decision making (1996)Decomposition procedures for distributional analysis: a unified framework based on the Shapley value (2012)A general approach for predicting the behavior of the Supreme Court of the United States (2017)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)
this work references cited by second hop

References

  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1960Contributions to the theory of games.1,824 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 2011Online Learning and Online Convex Optimization1,095 cited
  • 1990Multi-Armed Bandit Allocation Indices.997 cited
  • 1997How to use expert advice631 cited
  • 1995Sample mean based index policies byO(logn) regret for the multi-armed bandit problem539 cited
  • 2015Non-Stationary Stochastic Optimization336 cited
  • 2007Online Learning: Theory, Algorithms, and Applications297 cited
  • 2010Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.255 cited
  • 1997A one-measurement form of simultaneous perturbation stochastic approximation254 cited
  • 2010Regret Bounds and Minimax Policies under Partial Monitoring213 cited
  • 2016Learning in Games via Reinforcement and Regularization132 cited
  • 2017A continuous-time approach to online optimization43 cited

Cited by

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

2019
Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints
32 cited