10 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.LG2022
Byzantine-Robust Federated Linear Bandits
Ali Jadbabaie, Haochuan Li, Jian Qian +1
In this paper, we study a linear bandit optimization problem in a federated setting where a large collection of distributed agents collaboratively learn a common linear bandit mode…
math.OC2021★ 10 cited
Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
Haochuan Li, Yi Tian, Jingzhao Zhang +1
We provide a first-order oracle complexity lower bound for finding stationary points of min-max optimization problems where the objective function is smooth, nonconvex in the minim…