Multi-armed linear bandits with latent biases
In a linear stochastic bandit model, each arm corresponds to a vector in Euclidean space, and the expected return observed at each time step is determined by an unknown linear function of the selected arm. This paper addresses the challenge of identifying the optimal arm in a linear stochastic bandi...
Saved in:
Main Authors: | Kang, Qiyu, Tay, Wee Peng, She, Rui, Wang, Sijie, Liu, Xiaoqian, Yang, Yuan-Rui |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/175416 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Multi-arm bandit-led clustering in federated learning
by: Zhao, Joe Chen Xuan
Published: (2024) -
PERFORMANCE GUARANTEES FOR ONLINE LEARNING: CASCADING BANDITS AND ADVERSARIAL CORRUPTIONS
by: ZHONG ZIXIN
Published: (2021) -
THE CONFIDENCE BOUND METHOD FOR THE MULTI-ARMED BANDIT PROBLEM WITH LARGE ARM SIZE
by: HU SHOURI
Published: (2020) -
Dynamic Clustering of Contextual Multi-Armed Bandits
by: NGUYEN, Trong T., et al.
Published: (2014) -
Efficient resource allocation with fairness constraints in restless multi-armed bandits
by: LI, Dexun, et al.
Published: (2022)