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. 1908.10402
  4. Cited By
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary
  Combinatorial Semi-Bandits

A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits

27 August 2019
Huozhi Zhou
Lingda Wang
L. Varshney
Ee-Peng Lim
ArXivPDFHTML

Papers citing "A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits"

3 / 3 papers shown
Title
MAB-Based Channel Scheduling for Asynchronous Federated Learning in Non-Stationary Environments
MAB-Based Channel Scheduling for Asynchronous Federated Learning in Non-Stationary Environments
Zehan Li
Yubo Yang
Tao Yang
X. Wu
Ziyu Guo
Bo Hu
64
0
0
03 Mar 2025
Matroid Semi-Bandits in Sublinear Time
Matroid Semi-Bandits in Sublinear Time
Ruo-Chun Tzeng
Naoto Ohsaka
Kaito Ariu
16
0
0
28 May 2024
Nearly Optimal Algorithms for Piecewise-Stationary Cascading Bandits
Nearly Optimal Algorithms for Piecewise-Stationary Cascading Bandits
Lingda Wang
Huozhi Zhou
Bingcong Li
L. Varshney
Zhizhen Zhao
14
6
0
12 Sep 2019
1