10 citations · 22 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
cs.LG2021★ 2 cited
Provably Efficient Algorithms for Multi-Objective Competitive RL
Tiancheng Yu, Yi Tian, Jingzhao Zhang +1
We study multi-objective reinforcement learning (RL) where an agent's reward is represented as a vector. In settings where an agent competes against opponents, its performance is m…