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. 1711.03539
  4. Cited By
A Change-Detection based Framework for Piecewise-stationary Multi-Armed
  Bandit Problem

A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problem

8 November 2017
Fang Liu
Joohyung Lee
Ness B. Shroff
ArXivPDFHTML

Papers citing "A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problem"

8 / 8 papers shown
Title
Exploiting Adjacent Similarity in Multi-Armed Bandit Tasks via Transfer of Reward Samples
Exploiting Adjacent Similarity in Multi-Armed Bandit Tasks via Transfer of Reward Samples
NR Rahul
Vaibhav Katewa
49
0
0
30 Sep 2024
Tracking the Best Expert in Non-stationary Stochastic Environments
Tracking the Best Expert in Non-stationary Stochastic Environments
Chen-Yu Wei
Yi-Te Hong
Chi-Jen Lu
33
59
0
02 Dec 2017
Reward Maximization Under Uncertainty: Leveraging Side-Observations on
  Networks
Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks
Swapna Buccapatnam
Fang Liu
A. Eryilmaz
Ness B. Shroff
45
28
0
26 Apr 2017
Collaborative Filtering Bandits
Collaborative Filtering Bandits
Shuai Li
Alexandros Karatzoglou
Claudio Gentile
66
315
0
11 Feb 2015
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
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis
Thompson Sampling: An Asymptotically Optimal Finite Time Analysis
E. Kaufmann
N. Korda
Rémi Munos
119
585
0
18 May 2012
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
170
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
72
294
0
22 May 2008
1