Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1502.07617
Cited By
Online Learning with Feedback Graphs: Beyond Bandits
26 February 2015
N. Alon
Nicolò Cesa-Bianchi
O. Dekel
Tomer Koren
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Online Learning with Feedback Graphs: Beyond Bandits"
41 / 41 papers shown
Title
Asymptotically-Optimal Gaussian Bandits with Side Observations
Alexia Atsidakou
Orestis Papadigenopoulos
Constantine Caramanis
Sujay Sanghavi
Sanjay Shakkottai
25
4
0
15 May 2025
Adversarial Combinatorial Semi-bandits with Graph Feedback
Yuxiao Wen
80
0
0
26 Feb 2025
Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
Gianmarco Genalti
Marco Mussi
Nicola Gatti
Marcello Restelli
Matteo Castiglioni
Alberto Maria Metelli
40
0
0
09 Sep 2024
Reinforcement Learning with Intrinsically Motivated Feedback Graph for Lost-sales Inventory Control
Zifan Liu
Xinran Li
Shibo Chen
Gen Li
Jiashuo Jiang
Jun Zhang
48
0
0
26 Jun 2024
Improved Regret Bounds for Bandits with Expert Advice
Nicolò Cesa-Bianchi
Khaled Eldowa
Emmanuel Esposito
Julia Olkhovskaya
40
0
0
24 Jun 2024
Improved Algorithms for Contextual Dynamic Pricing
Matilde Tullii
Solenne Gaucher
Nadav Merlis
Vianney Perchet
63
1
0
17 Jun 2024
A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of
Θ
(
T
2
/
3
)
Θ(T^{2/3})
Θ
(
T
2/3
)
and its Application to Best-of-Both-Worlds
Taira Tsuchiya
Shinji Ito
28
0
0
30 May 2024
Stochastic contextual bandits with graph feedback: from independence number to MAS number
Yuxiao Wen
Yanjun Han
Zhengyuan Zhou
47
1
0
12 Feb 2024
Budgeted Online Model Selection and Fine-Tuning via Federated Learning
P. M. Ghari
Yanning Shen
FedML
61
1
0
19 Jan 2024
Stochastic Graph Bandit Learning with Side-Observations
Xueping Gong
Jiheng Zhang
34
1
0
29 Aug 2023
On the Minimax Regret for Online Learning with Feedback Graphs
Khaled Eldowa
Emmanuel Esposito
Tommaso Cesari
Nicolò Cesa-Bianchi
33
9
0
24 May 2023
Repeated Bilateral Trade Against a Smoothed Adversary
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Federico Fusco
S. Leonardi
41
16
0
21 Feb 2023
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond
Christoph Dann
Chen-Yu Wei
Julian Zimmert
31
22
0
20 Feb 2023
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
Emmanuel Esposito
Federico Fusco
Dirk van der Hoeven
Nicolò Cesa-Bianchi
24
14
0
09 Oct 2022
Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs
Haipeng Luo
Yangqiu Song
Mengxiao Zhang
Yuheng Zhang
24
5
0
04 Oct 2022
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality
T. V. Marinov
M. Mohri
Julian Zimmert
24
6
0
20 Jun 2022
Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback
Fang-yuan Kong
Yichi Zhou
Shuai Li
22
8
0
16 Jun 2022
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs
Shinji Ito
Taira Tsuchiya
Junya Honda
35
24
0
02 Jun 2022
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
An Analysis of Ensemble Sampling
Chao Qin
Zheng Wen
Xiuyuan Lu
Benjamin Van Roy
37
21
0
02 Mar 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits
Suprovat Ghoshal
Aadirupa Saha
25
11
0
23 Feb 2022
Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences
Aadirupa Saha
Pierre Gaillard
41
8
0
14 Feb 2022
Online Learning with Uncertain Feedback Graphs
P. M. Ghari
Yanning Shen
27
3
0
15 Jun 2021
Experts with Lower-Bounded Loss Feedback: A Unifying Framework
Eyal Gofer
Guy Gilboa
OffRL
16
0
0
17 Dec 2020
Policy Optimization as Online Learning with Mediator Feedback
Alberto Maria Metelli
Matteo Papini
P. DÓro
Marcello Restelli
OffRL
27
10
0
15 Dec 2020
Budgeted and Non-budgeted Causal Bandits
V. Nair
Vishakha Patil
Gaurav Sinha
26
41
0
13 Dec 2020
Thompson Sampling for Unsupervised Sequential Selection
Arun Verma
M. Hanawal
N. Hemachandra
19
5
0
16 Sep 2020
Bayesian optimization for modular black-box systems with switching costs
Chi-Heng Lin
Joseph D. Miano
Eva L. Dyer
8
5
0
04 Jun 2020
A Closer Look at Small-loss Bounds for Bandits with Graph Feedback
Chung-Wei Lee
Haipeng Luo
Mengxiao Zhang
17
23
0
02 Feb 2020
Learning Strategy-Aware Linear Classifiers
Yiling Chen
Yang Liu
Chara Podimata
19
9
0
10 Nov 2019
Exploration by Optimisation in Partial Monitoring
Tor Lattimore
Csaba Szepesvári
33
38
0
12 Jul 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio
Julian Zimmert
Tor Lattimore
30
34
0
28 May 2019
Feedback graph regret bounds for Thompson Sampling and UCB
Thodoris Lykouris
Éva Tardos
Drishti Wali
19
29
0
23 May 2019
Unifying the stochastic and the adversarial Bandits with Knapsack
A. Rangi
M. Franceschetti
Long Tran-Thanh
18
26
0
23 Oct 2018
Contextual Bandits with Cross-learning
S. Balseiro
Negin Golrezaei
Mohammad Mahdian
Vahab Mirrokni
Jon Schneider
21
50
0
25 Sep 2018
Online Learning with Randomized Feedback Graphs for Optimal PUE Attacks in Cognitive Radio Networks
Monireh Dabaghchian
Amir Alipour-Fanid
K. Zeng
Qingsi Wang
P. Auer
AAML
15
1
0
28 Sep 2017
Online Learning with Abstention
Corinna Cortes
Giulia DeSalvo
Claudio Gentile
M. Mohri
Scott Yang
17
47
0
09 Mar 2017
Bandits with Movement Costs and Adaptive Pricing
Tomer Koren
Roi Livni
Yishay Mansour
27
20
0
24 Feb 2017
Thompson Sampling For Stochastic Bandits with Graph Feedback
Aristide C. Y. Tossou
Christos Dimitrakakis
Devdatt Dubhashi
19
28
0
16 Jan 2017
Online Learning with Gaussian Payoffs and Side Observations
Yifan Wu
András Gyorgy
Csaba Szepesvári
18
44
0
27 Oct 2015
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
N. Alon
Nicolò Cesa-Bianchi
Claudio Gentile
Shie Mannor
Yishay Mansour
Ohad Shamir
OffRL
44
130
0
30 Sep 2014
1