SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Volumetric Spanners: an Efficient Exploration Basis for Learning
5 references·1 citing·25 second hopsampled
Volumetric Spanners: an Efficient Exploration Basis for Learning (2013)Volumetric Spanners: an Efficient Explora…Towards minimax policies for online linear optimization with bandit feedback (2012)Towards minimax policies for …Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Interior-Point Methods for Full-Information and Bandit Online Learning (2012)Interior-Point Methods for Fu…Stochastic Linear Optimization Under Bandit Feedback (2008)Stochastic Linear Optimizatio…The Price of Bandit Information for Online Optimization (2007)The Price of Bandit Informati…Bandit Algorithms (2020)Bandit AlgorithmsA Stochastic Approximation Method (1951)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Some aspects of the sequential design of experiments (1952)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)Online Learning and Online Convex Optimization (2011)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)The Nonstochastic Multiarmed Bandit Problem (2002)Online convex programming and generalized infinitesimal gradient ascent (2003)Minimax policies for adversarial and stochastic bandits (2004)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)An Information-Theoretic Approach to Minimax Regret in Partial Monitoring (2019)PORTFOLIO SELECTION* (1952)Prospect Theory: An Analysis of Decision under Risk (1979)Optimization of conditional value-at-risk (2000)Hedging the Drift: Learning to Optimize Under Non-Stationarity (2018)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Multi-Armed Bandits With Correlated Arms (2021)Using confidence bounds for exploitation-exploration trade-offs (2003)A generalized online mirror descent with applications to classification and regression (2014)The Many Faces of Exponential Weights in Online Learning (2018)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
  • 2008Stochastic Linear Optimization Under Bandit Feedback610 cited
  • 2007The Price of Bandit Information for Online Optimization161 cited
  • 2012Towards minimax policies for online linear optimization with bandit feedback86 cited
  • 2012Interior-Point Methods for Full-Information and Bandit Online Learning85 cited

Cited by

  • 2020Bandit Algorithms994 cited

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