activity
20182026
most citedMemory-Constrained No-Regret Learning in Adversarial Bandits

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

collaborators

5 papers

stat.ME2026

Orthogonal Uplift Learning with Permutation-Invariant Representations for Combinatorial Treatments

Xinyan Su, Jiacan Gao, Mingyuan Ma +6

We study uplift estimation for combinatorial treatments. Uplift measures the pure incremental causal effect of an intervention (e.g., sending a coupon or a marketing message) on us…

cs.LG2020★ 1 cited

Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interests

Xiao Xu, Fang Dong, Yanghua Li +2

A contextual bandit problem is studied in a highly non-stationary environment, which is ubiquitous in various recommender systems due to the time-varying interests of users. Two mo…

cs.GT2020

Distributed No-Regret Learning in Multi-Agent Systems

Xiao Xu, Qing Zhao

In this tutorial article, we give an overview of new challenges and representative results on distributed no-regret learning in multi-agent systems modeled as repeated unknown game…

cs.LG2020★ 3 cited

Memory-Constrained No-Regret Learning in Adversarial Bandits

Xiao Xu, Qing Zhao

An adversarial bandit problem with memory constraints is studied where only the statistics of a subset of arms can be stored. A hierarchical learning policy that requires only a su…

cs.LG2018★ 1 cited

Multi-Armed Bandits on Partially Revealed Unit Interval Graphs

Xiao Xu, Sattar Vakili, Qing Zhao +1

A stochastic multi-armed bandit problem with side information on the similarity and dissimilarity across different arms is considered. The action space of the problem can be repres…