paper-with-me

홈 › Papers

Heterogeneous Multi-Agent Bandits with Parsimonious Hints

2025-02-22 · Amirmahdi Mirfakhar, Xuchuang Wang, Jinhang Zuo, Yair Zick, Mohammad Hajiesmaili

We study a hinted heterogeneous multi-agent multi-armed bandits problem (HMA2B), where agents can query low-cost observations (hints) in addition to pulling arms. In this framework, each of the $M$ agents has a unique reward distribution over $K$ arms, and in $T$ rounds, they can observe the reward of the arm they pull only if no other agent pulls that arm. The goal is to maximize the total utility by querying the minimal necessary hints without pulling arms, achieving time-independent regret. We study HMA2B in both centralized and decentralized setups. Our main centralized algorithm, GP-HCLA, which is an extension of HCLA, uses a central decision-maker for arm-pulling and hint queries, achieving $O(M^4K)$ regret with $O(MK\log T)$ adaptive hints. In decentralized setups, we propose two algorithms, HD-ETC and EBHD-ETC, that allow agents to choose actions independently through collision-based communication and query hints uniformly until stopping, yielding $O(M^3K^2)$ regret with $O(M^3K\log T)$ hints, where the former requires knowledge of the minimum gap and the latter does not. Finally, we establish lower bounds to prove the optimality of our results and verify them through numerical simulations.

📄 PDF Abstract BibTeX arXiv:2502.16128

Code (0)

등록된 구현이 없습니다.

Tasks

4kMulti-Armed Bandits

Methods 이 논문이 사용한 방법론

HINT An unsupervised approach for identifying Hierarchical Information Threads by analysing the network of related articles in a collection. In particular, HINT leverages article…

Similar Papers 제목 키워드 기반

Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits

2023-05-30 · Ronshee Chawla, Daniel Vial, Sanjay Shakkottai, R. Srikant

The study of collaborative multi-agent bandits has attracted significant attention recently. In light of this, we initiate the study of a new collaborative setting, consisting of $N$ agents such that each agent is learni…

Multi-Armed Bandits

Adversarial Attacks on Cooperative Multi-agent Bandits

2023-11-03 · Jinhang Zuo, Zhiyao Zhang, Xuchuang Wang, Cheng Chen 외

Cooperative multi-agent multi-armed bandits (CMA2B) consider the collaborative efforts of multiple agents in a shared multi-armed bandit game. We study latent vulnerabilities exposed by this collaboration and consider ad…

Multi-Armed Bandits

Learning interactions to boost human creativity with bandits and GPT-4

2023-11-16 · Ara Vartanian, Xiaoxi Sun, Yun-Shiuan Chuang, Siddharth Suresh 외

This paper considers how interactions with AI algorithms can boost human creative thought. We employ a psychological task that demonstrates limits on human creativity, namely semantic feature generation: given a concept …

Multi-Agent Learning with Heterogeneous Linear Contextual Bandits

2023-09-21 · NeurIPS 2023 11

As trained intelligent systems become increasingly pervasive, multiagent learning has emerged as a popular framework for studying complex interactions between autonomous agents. Yet, a formal understanding of how and whe…

Twin Agent: Context Residual Compression for Privilege Separated Agents

2026-07-21 · Zhanhao Hu, Dennis Jacob, Xiao Huang, Zhaorun Chen 외 arxiv

Large language model (LLM) agents are vulnerable to security risks, such as prompt injection attacks from untrusted context that manipulate downstream reasoning and tool use. Existing secure-by-design approaches mitigate…