SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An Efficient Bandit Algorithm for Realtime Multivariate Optimization
11 references·4 citing·28 second hop
An Efficient Bandit Algorithm for Realtime Multivariate Optimization (2017)An Efficient Bandit Algorithm for Realtim…Automatic ad format selection via contextual bandits (2013)Automatic ad format selection…Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Thompson Sampling for Context…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…Combinatorial bandits (2012)Combinatorial banditsAnalysis of Thompson Sampling for the multi-armed bandit problem (2011)Analysis of Thompson Sampling…An Empirical Evaluation of Thompson Sampling (2011)An Empirical Evaluation of Th…Stochastic Linear Optimization Under Bandit Feedback (2008)Stochastic Linear Optimizatio…Statistics for Experimenters: Design, Innovation, and Discovery (2006)Statistics for Experimenters:…Statistics for experimenters: design, innovation, and discovery (2006)Statistics for experimenters:…Experiments - Planning, Analysis and Parameter Design Optimization (2001)Experiments - Planning, Analy…Beyond Preferences in AI Alignment (2024)Beyond Preferences in AI Alig…What is the Value of Experimentation and Measurement? (2020)What is the Value of Experime…An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits (2020)An Empirical Process Approach…A Tutorial on Thompson Sampling (2017)A Tutorial on Thompson Sampli…Multi-Armed Bandit Allocation Indices. (1990)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Introduction to Multi-Armed Bandits (2019)Bandit Algorithms (2020)A Stochastic Approximation Method (1951)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)Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms (2011)The Nonstochastic Multiarmed Bandit Problem (2002)Using confidence bounds for exploitation-exploration trade-offs (2003)Learning to Optimize via Posterior Sampling (2014)A Tutorial on Thompson Sampling (2018)Efficient algorithms for online decision problems (2004)Associative Reinforcement Learning using Linear Probabilistic Concepts (1999)Beating the adaptive bandit with high probability (2009)Improved Algorithms for Linear Stochastic Bandits (2011)Some aspects of the sequential design of experiments (1952)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Neural-Network-Based Models for Short-Term Traffic Flow Forecasting Using a Hybrid Exponential Smoothing and Levenberg–Marquardt Algorithm (2011)Experimental design in chromatography: A tutorial review (2012)Why so many published sensitivity analyses are false: A systematic review of sensitivity analysis practices (2019)Bioprocess optimization using design‐of‐experiments methodology (2008)Phoenics: A Bayesian Optimizer for Chemistry (2018)Response Surface Methodology (2002)Response-Surface Methods in R , Using rsm (2009)Response surface methodology (2010)
this work references cited by second hop

References

  • 2006Statistics for experimenters: design, innovation, and discovery1,657 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
  • 2001Experiments - Planning, Analysis and Parameter Design Optimization1,140 cited
  • 2011An Empirical Evaluation of Thompson Sampling1,030 cited
  • 2011Analysis of Thompson Sampling for the multi-armed bandit problem922 cited
  • 2006Statistics for Experimenters: Design, Innovation, and Discovery801 cited
  • 2012Thompson Sampling for Contextual Bandits with Linear Payoffs644 cited
  • 2008Stochastic Linear Optimization Under Bandit Feedback610 cited
  • 2012Combinatorial bandits354 cited
  • 2013Automatic ad format selection via contextual bandits111 cited

Cited by

  • 2024Beyond Preferences in AI Alignment35 cited
  • 2017A Tutorial on Thompson Sampling35 cited
  • 2020An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits26 cited
  • 2020What is the Value of Experimentation and Measurement?10 cited

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