SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
9 references·0 citing·26 second hopsampled
Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (2017)Stochastic online optimization. Single-po…Introduction to Online Convex Optimization (2016)Introduction to Online Convex…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Online Learning and Online Convex Optimization (2012)Online Learning and Online Co…Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…Introduction to Online Optimization (2011)Introduction to Online Optimi…Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback. (2010)Optimal Algorithms for Online…Prediction, Learning, and Games (2006)Prediction, Learning, and Gam…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…The Nonstochastic Multiarmed Bandit Problem (2002)Online convex programming and generalized infinitesimal gradient ascent (2003)Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints (2011)Non-Stationary Stochastic Optimization (2013)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Theory of games and economic behavior (2019)Introduction to Stochastic Programming (2011)INTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL (2012)A Stochastic Approximation Method (1951)Introduction to Online Convex Optimization (2016)Some aspects of the sequential design of experiments (1952)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)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)Associative Reinforcement Learning using Linear Probabilistic Concepts (1999)Beating the adaptive bandit with high probability (2009)Improved Algorithms for Linear Stochastic Bandits (2011)Bandit Algorithms (2020)Towards minimax policies for online linear optimization with bandit feedback (2012)A continuous-time approach to online optimization (2017)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2006Prediction, Learning, and Games3,223 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,302 cited
  • 2012Online Learning and Online Convex Optimization1,265 cited
  • 2011Online Learning and Online Convex Optimization1,170 cited
  • 2016Introduction to Online Convex Optimization893 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient642 cited
  • 2010Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.255 cited
  • 2011Introduction to Online Optimization108 cited

Cited by

No citing works inside the corpus for this window.

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