Laplacian-regularized graph bandits: Algorithms and theoretical analysis

v1v2v3 (latest)

Laplacian-regularized graph bandits: Algorithms and theoretical analysis

12 July 2019

ArXiv (abs)PDF HTML

Papers citing "Laplacian-regularized graph bandits: Algorithms and theoretical analysis"

7 / 7 papers shown

Title
Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts Zhuohua Li Maoli Liu Xiangxiang Dai John C. S. Lui 70 2 0 03 Jan 2025
Online Network Source Optimization with Graph-Kernel MAB Laura Toni P. Frossard 97 1 0 07 Jul 2023
Semi-Parametric Contextual Bandits with Graph-Laplacian Regularization Y. Choi Gi-Soo Kim Seung-Jin Paik M. Paik 62 6 0 17 May 2022
Recommending with Recommendations Naveen Durvasula Franklyn Wang S. Kominers 23 0 0 02 Dec 2021
Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits Chuanhao Li Hongning Wang FedML 113 40 0 04 Oct 2021
When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution Chuanhao Li Qingyun Wu Hongning Wang 78 5 0 14 Apr 2021
Unifying Clustered and Non-stationary Bandits Chuanhao Li Qingyun Wu Hongning Wang 93 12 0 05 Sep 2020