Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
Abstract
Type
Department
Description
Provenance
Citation
Permalink
Publication Info
Jin, Tianyuan, Hao-Lun Hsu, William Chang and Pan Xu (2023). Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs. Preprint version: http://arxiv.org/abs/2312.15549v1 Retrieved from https://hdl.handle.net/10161/30487.
This is constructed from limited available data and may be imprecise. To cite this article, please review & use the citation provided by the preprint service.
Collections
Scholars@Duke
Hao-Lun Hsu
Hao-Lun (Howard) Hsu is a Computer Science Ph.D. student at Duke University advised by Professor Miroslav Pajic. His research concerns provably and practical decision-making (e.g., Reinforcement Learning, Multi-armed Bandits), including robustness and safety with applications of robotics and neuromodulation.
Unless otherwise indicated, scholarly articles published by Duke faculty members are made available here with a CC-BY-NC (Creative Commons Attribution Non-Commercial) license, as enabled by the Duke Open Access Policy. If you wish to use the materials in ways not already permitted under CC-BY-NC, please consult the copyright owner. Other materials are made available here through the author’s grant of a non-exclusive license to make their work openly accessible.