activity
20222026
most citedOn-Demand Communication for Asynchronous Multi-Agent Bandits

1 citations · 3 across the 26 of their papers we have counts for

collaborators

27 papers

cs.IT2026

Quantum-Classical Coexistence Network Tomography

Xuchuang Wang, Joseph C. Chapman, Aneesh Ramaswamy +5

Quantum-classical coexistence networks (QCNs) share optical fiber between quantum and classical signals via wavelength-division multiplexing, offering a practical path to quantum c…

cs.AI2026

Best Arm Identification in Generalized Linear Bandits via Hybrid Feedback

Qirun Zeng, Xuchuang Wang, Jiayi Shen +3

We study fixed-confidence best arm identification in generalized linear bandits under a hybrid feedback model: at each round, the learner may query either (i) absolute reward feedb…

cs.LG2026

Unlearning Offline Stochastic Multi-Armed Bandits

Zichun Ye, Runqi Wang, Xuchuang Wang +3

Machine unlearning aims to unlearn data points from a learned model, offering a principled way to process data-deletion requests and mitigate privacy risks without full retraining.…

cs.GT2026

Two-Sided Time-Independent Regret for Matching Markets with Limited Interviews

Amirmahdi Mirfakhar, Xuchuang Wang, Mengfan Xu +2

Two-sided matching platforms rely on preferences from both sides, yet participants can evaluate only a small fraction of potential partners. In practice, they use low-cost pre-matc…

cs.LG2025

Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach

Fatemeh Ghaffari, Siddarth Sitaraman, Xutong Liu +2

Online learning to rank (OLTR) studies how to recommend a short ranked list of items from a large pool and improves future rankings based on user clicks. This setting is commonly m…

cs.NI2025

Quantum Network Tomography for General Topology with SPAM Errors

Xuchuang Wang, Matheus Guedes De Andrade, Guus Avis +3

The goal of quantum network tomography (QNT) is the characterization of internal quantum channels in a quantum network from external peripheral operations. Prior research has prima…

cs.LG2025

Offline Clustering of Preference Learning with Active-data Augmentation

Jingyuan Liu, Fatemeh Ghaffari, Xuchuang Wang +3

Preference learning from pairwise feedback is a widely adopted framework in applications such as reinforcement learning with human feedback and recommendations. In many practical s…

cs.LG2025

Distributed Algorithms for Multi-Agent Multi-Armed Bandits with Collision

Daoyuan Zhou, Xuchuang Wang, Lin Yang +1

We study the stochastic Multiplayer Multi-Armed Bandit (MMAB) problem, where multiple players select arms to maximize their cumulative rewards. Collisions occur when two or more pl…

cs.LG2025

Competitive Algorithms for Multi-Agent Ski-Rental Problems

Xuchuang Wang, Bo Sun, Hedyeh Beyhaghi +3

This paper introduces a novel multi-agent ski-rental problem that generalizes the classical ski-rental dilemma to a group setting where agents incur individual and shared costs. In…

cs.NI2025

Learning Best Paths in Quantum Networks

Xuchuang Wang, Maoli Liu, Xutong Liu +4

Quantum networks (QNs) transmit delicate quantum information across noisy quantum channels. Crucial applications, like quantum key distribution (QKD) and distributed quantum comput…

cs.LG2025

Practical Adversarial Attacks on Stochastic Bandits via Fake Data Injection

Qirun Zeng, Eric He, Richard Hoffmann +2

Adversarial attacks on stochastic bandits have traditionally relied on some unrealistic assumptions, such as per-round reward manipulation and unbounded perturbations, limiting the…

cs.LG2025

Offline Clustering of Linear Bandits: The Power of Clusters under Limited Data

Jingyuan Liu, Zeyu Zhang, Xuchuang Wang +4

Contextual multi-armed bandit is a fundamental learning framework for making a sequence of decisions, e.g., advertising recommendations for a sequence of arriving users. Recent wor…

cs.LG2025

Fusing Reward and Dueling Feedback in Stochastic Bandits

Xuchuang Wang, Qirun Zeng, Jinhang Zuo +4

This paper investigates the fusion of absolute (reward) and relative (dueling) feedback in stochastic bandits, where both feedback types are gathered in each decision round. We der…

cs.NI2025

Optimal Online Probe Allocation for Classical and Quantum Network Tomography

Xuchuang Wang, Yu-Zhen Janice Chen, Matheus Guedes de Andrade +4

How to efficiently perform network tomography is a fundamental problem in network management and monitoring. A network tomography task usually consists of applying multiple probing…

cs.LG2025

Heterogeneous Multi-Agent Bandits with Parsimonious Hints

Amirmahdi Mirfakhar, Xuchuang Wang, Jinhang Zuo +2

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…

cs.LG2025

Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models

Mengfan Xu, Liren Shan, Fatemeh Ghaffari +3

We study a novel heterogeneous multi-agent multi-armed bandit problem with a cluster structure induced by stochastic block models, influencing not only graph topology, but also rew…

cs.HC2025

A Multi-Agent Conversational Bandit Approach to Online Evaluation and Selection of User-Aligned LLM Responses

Xiangxiang Dai, Yuejin Xie, Maoli Liu +4

Prompt-based offline methods are commonly used to optimize large language model (LLM) responses, but evaluating these responses is computationally intensive and often fails to acco…

cs.LG2024

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions

Fatemeh Ghaffari, Xuchuang Wang, Jinhang Zuo +1

We study the problem of multi-agent multi-armed bandits with adversarial corruption in a heterogeneous setting, where each agent accesses a subset of arms. The adversary can corrup…

cs.LG2024

Combinatorial Logistic Bandits

Xutong Liu, Xiangxiang Dai, Xuchuang Wang +2

We introduce a novel framework called combinatorial logistic bandits (CLogB), where in each round, a subset of base arms (called the super arm) is selected, with the outcome of eac…

cs.LG2024

Stochastic Bandits Robust to Adversarial Attacks

Xuchuang Wang, Jinhang Zuo, Xutong Liu +2

This paper investigates stochastic multi-armed bandit algorithms that are robust to adversarial attacks, where an attacker can first observe the learner's action and {then} alter t…

cs.LG2024★ 1 cited

Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond

Xutong Liu, Siwei Wang, Jinhang Zuo +7

We introduce a novel framework of combinatorial multi-armed bandits (CMAB) with multivariant and probabilistically triggering arms (CMAB-MT), where the outcome of each arm is a …

cs.LG2023

Adversarial Attacks on Cooperative Multi-agent Bandits

Jinhang Zuo, Zhiyao Zhang, Xuchuang Wang +5

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 expos…

cs.LG2023

Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs

Lin Yang, Xuchuang Wang, Mohammad Hajiesmaili +3

Recently, there has been extensive study of cooperative multi-agent multi-armed bandits where a set of distributed agents cooperatively play the same multi-armed bandit game. The g…

cs.LG2023

Multi-Fidelity Multi-Armed Bandits Revisited

Xuchuang Wang, Qingyun Wu, Wei Chen +1

We study the multi-fidelity multi-armed bandit (MF-MAB), an extension of the canonical multi-armed bandit (MAB) problem. MF-MAB allows each arm to be pulled with different costs (f…