ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.03692
  4. Cited By
Nearly Optimal Adaptive Procedure with Change Detection for
  Piecewise-Stationary Bandit

Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit

11 February 2018
Yang Cao
Zheng Wen
Branislav Kveton
Yao Xie
ArXivPDFHTML

Papers citing "Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit"

5 / 5 papers shown
Title
A Change-Detection based Framework for Piecewise-stationary Multi-Armed
  Bandit Problem
A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problem
Fang Liu
Joohyung Lee
Ness B. Shroff
43
115
0
08 Nov 2017
Matroid Bandits: Fast Combinatorial Optimization with Learning
Matroid Bandits: Fast Combinatorial Optimization with Learning
Branislav Kveton
Zheng Wen
Azin Ashkan
Hoda Eydgahi
Brian Eriksson
62
119
0
20 Mar 2014
Thompson Sampling in Switching Environments with Bayesian Online Change
  Point Detection
Thompson Sampling in Switching Environments with Bayesian Online Change Point Detection
J. Mellor
J. Shapiro
79
40
0
15 Feb 2013
Unbiased Offline Evaluation of Contextual-bandit-based News Article
  Recommendation Algorithms
Unbiased Offline Evaluation of Contextual-bandit-based News Article Recommendation Algorithms
Lihong Li
Wei Chu
John Langford
Xuanhui Wang
OffRL
152
574
0
31 Mar 2010
On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems
On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems
Aurélien Garivier
Eric Moulines
69
294
0
22 May 2008
1