SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Efficient Contextual Bandits in Non-stationary Worlds
0 references·8 citing·23 second hop
Efficient Contextual Bandits in Non-stationary Worlds (2017)Efficient Contextual Bandits in Non-stati…Nonstationary Reinforcement Learning: The Blessing of (More) Optimism (2023)Nonstationary Reinforcement L…Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits (2023)Nearly Minimax-Optimal Regret…Sliding-Window Thompson Sampling for Non-Stationary Settings (2020)Sliding-Window Thompson Sampl…Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism (2020)Reinforcement Learning for No…Model selection for contextual bandits (2019)Model selection for contextua…A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free (2019)A New Algorithm for Non-stati…Learning Contextual Bandits in a Non-stationary Environment (2018)Learning Contextual Bandits i…Hedging the Drift: Learning to Optimize Under Non-Stationarity (2018)Hedging the Drift: Learning t…Bandit Processes and Dynamic Allocation Indices (1979)Social influence: Social norms, conformity and compliance. (1998)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Weighted Linear Bandits for Non-Stationary Environments (2019)The Nonstochastic Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Multi-Armed Bandits with Fairness Constraints for Distributing Resources to Human Teammates (2020)Recent Advances in Reinforcement Learning in Finance (2021)The impact of renewable energy transition, green growth, green trade and green innovation on environmental quality: Evidence from top 10 green future countries (2023)Tracking the Best Expert (1998)Online convex programming and generalized infinitesimal gradient ascent (2003)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Improved Algorithms for Linear Stochastic Bandits (2011)Some aspects of the sequential design of experiments (1952)Using confidence bounds for exploitation-exploration trade-offs (2003)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles (2020)A Simple Approach for Non-stationary Linear Bandits (2021)Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability (2021)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Non Stationary Multi-Armed Bandit: Empirical Evaluation of a New Concept Drift-Aware Algorithm (2021)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2018Hedging the Drift: Learning to Optimize Under Non-Stationarity83 cited
  • 2023Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits76 cited
  • 2018Learning Contextual Bandits in a Non-stationary Environment68 cited
  • 2019A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free62 cited
  • 2020Sliding-Window Thompson Sampling for Non-Stationary Settings61 cited
  • 2019Model selection for contextual bandits42 cited
  • 2020Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism40 cited
  • 2023Nonstationary Reinforcement Learning: The Blessing of (More) Optimism34 cited

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