Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits

Xuchuang Wang, L. Yang, Y. Chen, Xutong Liu, Mohammad H. Hajiesmaili +2 more
2/12/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Enhancing Storage and Computational Efficiency in Federated Multimodal Learning for Large-Scale Models

89% match2026

Bridging Data Gaps in Diffusion Models with Adversarial Noise-Based Transfer Learning

88% match1 repo22026

Enhancing Motion Deblurring in High-Speed Scenes with Spike Streams

88% match1 repo52026

Understanding Train-Validation Split in Meta-Learning with Neural Networks

87% match2026

AllSim: Simulating and Benchmarking Resource Allocation Policies in Multi-User Systems

87% match2026

Meta-VBO: Utilizing Prior Tasks in Optimizing Risk Measures with Gaussian Processes

87% match2026

Cite this paper

@article{wang2026achieving,
  title  = {Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits},
  author = {Xuchuang Wang and L. Yang and Y. Chen and Xutong Liu and Mohammad H. Hajiesmaili and D. Towsley and John C.S. Lui},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:261bd37a168e69b14c6bc957d3561e5a90f4270b},
  journal = {ICLR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/261bd37a168e69b14c6bc957d3561e5a90f4270b.svg)](https://codeofpaper.com/paper/261bd37a168e69b14c6bc957d3561e5a90f4270b)

Discussion