2 citations · 6 across the 22 of their papers we have counts for
24 papers
Steering Frozen LLMs: Adaptive Social Alignment via Online Prompt Routing
Zeyu Zhang, Xiangxiang Dai, Ziyi Han +2
Large language models (LLMs) are typically governed by post-training alignment (e.g., RLHF or DPO), which yields a largely static policy during deployment and inference. However, r…
HiLoRA: Adaptive Hierarchical LoRA Routing for Training-Free Domain Generalization
Ziyi Han, Huanyu Wang, Zeyu Zhang +3
Low-Rank Adaptation (LoRA) has emerged as a widely used technique for adapting large language models (LLMs) to new domains, due to its modular design and broad availability on plat…
Faster, Smaller, and Smarter: Task-Aware Expert Merging for Online MoE Inference
Ziyi Han, Xutong Liu, Ruiting Zhou +2
Sparse Mixture of Experts (SMoE) has become a preferred architecture for scaling Transformer capacity without increasing computational cost, as it activates only a small subset of…
Semantic Caching for Low-Cost LLM Serving: From Offline Learning to Online Adaptation
Xutong Liu, Baran Atalar, Xiangxiang Dai +5
Large Language Models (LLMs) are revolutionizing how users interact with information systems, yet their high inference cost poses serious scalability and sustainability challenges.…
Online Multi-LLM Selection via Contextual Bandits under Unstructured Context Evolution
Manhin Poon, XiangXiang Dai, Xutong Liu +3
Large language models (LLMs) exhibit diverse response behaviors, costs, and strengths, making it challenging to select the most suitable LLM for a given user query. We study the pr…
Federated In-Context Learning: Iterative Refinement for Improved Answer Quality
Ruhan Wang, Zhiyong Wang, Chengkai Huang +5
For question-answering (QA) tasks, in-context learning (ICL) enables language models to generate responses without modifying their parameters by leveraging examples provided in the…
A Unified Online-Offline Framework for Co-Branding Campaign Recommendations
Xiangxiang Dai, Xiaowei Sun, Jinhang Zuo +2
Co-branding has become a vital strategy for businesses aiming to expand market reach within recommendation systems. However, identifying effective cross-industry partnerships remai…
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…
Provable Zero-Shot Generalization in Offline Reinforcement Learning
Zhiyong Wang, Chen Yang, John C. S. Lui +1
In this work, we study offline reinforcement learning (RL) with zero-shot generalization property (ZSG), where the agent has access to an offline dataset including experiences from…
Online Clustering of Dueling Bandits
Zhiyong Wang, Jiahang Sun, Mingze Kong +4
The contextual multi-armed bandit (MAB) is a widely used framework for problems requiring sequential decision-making under uncertainty, such as recommendation systems. In applicati…
Large Language Model-Enhanced Multi-Armed Bandits
Jiahang Sun, Zhiyong Wang, Runhan Yang +3
Large language models (LLMs) have been adopted to solve sequential decision-making tasks such as multi-armed bandits (MAB), in which an LLM is directly instructed to select the arm…
Offline Learning for Combinatorial Multi-armed Bandits
Xutong Liu, Xiangxiang Dai, Jinhang Zuo +4
The combinatorial multi-armed bandit (CMAB) is a fundamental sequential decision-making framework, extensively studied over the past decade. However, existing work primarily focuse…
Quantum Algorithm for Online Exp-concave Optimization
Jianhao He, Chengchang Liu, Xutong Liu +2
We explore whether quantum advantages can be found for the zeroth-order feedback online exp-concave optimization problem, which is also known as bandit exp-concave optimization wit…
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…
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…
Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds
Zhiyong Wang, Dongruo Zhou, John C. S. Lui +1
Learning a transition model via Maximum Likelihood Estimation (MLE) followed by planning inside the learned model is perhaps the most standard and simplest Model-based Reinforcemen…
AxiomVision: Accuracy-Guaranteed Adaptive Visual Model Selection for Perspective-Aware Video Analytics
Xiangxiang Dai, Zeyu Zhang, Peng Yang +3
The rapid evolution of multimedia and computer vision technologies requires adaptive visual model deployment strategies to effectively handle diverse tasks and varying environments…
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 …
Cost-Effective Online Multi-LLM Selection with Versatile Reward Models
Xiangxiang Dai, Jin Li, Xutong Liu +2
With the rapid advancement of large language models (LLMs), the diversity of multi-LLM tasks and the variability in their pricing structures have become increasingly important, as…
Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
Zhiyong Wang, Jize Xie, Yi Chen +2
We investigate the non-stationary stochastic linear bandit problem where the reward distribution evolves each round. Existing algorithms characterize the non-stationarity by the to…
Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users
Hantao Yang, Xutong Liu, Zhiyong Wang +4
We study the problem of federated contextual combinatorial cascading bandits, where agents collaborate under the coordination of a central server to provide tailore…
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…
Online Corrupted User Detection and Regret Minimization
Zhiyong Wang, Jize Xie, Tong Yu +2
In real-world online web systems, multiple users usually arrive sequentially into the system. For applications like click fraud and fake reviews, some users can maliciously perform…
Online Clustering of Bandits with Misspecified User Models
Zhiyong Wang, Jize Xie, Xutong Liu +2
The contextual linear bandit is an important online learning problem where given arm features, a learning agent selects an arm at each round to maximize the cumulative rewards in t…