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. 1704.07943
  4. Cited By
Reward Maximization Under Uncertainty: Leveraging Side-Observations on
  Networks

Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks

26 April 2017
Swapna Buccapatnam
Fang Liu
A. Eryilmaz
Ness B. Shroff
ArXivPDFHTML

Papers citing "Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks"

9 / 9 papers shown
Title
Graph Feedback Bandits on Similar Arms: With and Without Graph Structures
Graph Feedback Bandits on Similar Arms: With and Without Graph Structures
Han Qi
Fei-Yu Guo
Li Zhu
Qiaosheng Zhang
Xiaochen Li
43
0
0
24 Jan 2025
Graph Feedback Bandits with Similar Arms
Graph Feedback Bandits with Similar Arms
Han Qi
Guo Fei
Li Zhu
27
0
0
18 May 2024
Improved High-Probability Regret for Adversarial Bandits with
  Time-Varying Feedback Graphs
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
Haipeng Luo
Hanghang Tong
Mengxiao Zhang
Yuheng Zhang
21
5
0
04 Oct 2022
Stochastic Online Learning with Feedback Graphs: Finite-Time and
  Asymptotic Optimality
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality
T. V. Marinov
M. Mohri
Julian Zimmert
24
6
0
20 Jun 2022
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with
  Feedback Graphs
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
Chloé Rouyer
Dirk van der Hoeven
Nicolò Cesa-Bianchi
Yevgeny Seldin
28
15
0
01 Jun 2022
A Change-Detection Based Thompson Sampling Framework for Non-Stationary
  Bandits
A Change-Detection Based Thompson Sampling Framework for Non-Stationary Bandits
Gourab Ghatak
25
17
0
06 Sep 2020
Waiting but not Aging: Optimizing Information Freshness Under the Pull
  Model
Waiting but not Aging: Optimizing Information Freshness Under the Pull Model
Fengjiao Li
Yu Sang
Zhongdong Liu
Bin Li
Huasen Wu
Bo Ji
14
32
0
17 Dec 2019
Feedback graph regret bounds for Thompson Sampling and UCB
Feedback graph regret bounds for Thompson Sampling and UCB
Thodoris Lykouris
Éva Tardos
Drishti Wali
13
29
0
23 May 2019
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
15
113
0
08 Nov 2017
1