activity
20122023
most citedSBEED: Convergent Reinforcement Learning with Nonlinear Function Approximation

137 citations · 656 across the 54 of their papers we have counts for

collaborators
Showing 2022 · math.OCShow all

7 papers · 2 filters

math.OC2022★ 3 cited

Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Games

Batuhan Yardim, Semih Cayci, Matthieu Geist +1

Mean-field games have been used as a theoretical tool to obtain an approximate Nash equilibrium for symmetric and anonymous -player games. However, limiting applicability, exist…

math.OC2022★ 6 cited

Sharp Analysis of Stochastic Optimization under Global Kurdyka-Łojasiewicz Inequality

Ilyas Fatkhullin, Jalal Etesami, Niao He +1

We study the complexity of finding the global solution to stochastic nonconvex optimization when the objective function satisfies global Kurdyka-Lojasiewicz (KL) inequality and the…

math.OC2022

TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization

Xiang Li, Junchi Yang, Niao He

Adaptive gradient methods have shown their ability to adjust the stepsizes on the fly in a parameter-agnostic manner, and empirically achieve faster convergence for solving minimiz…

math.OC2022

Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization

Junchi Yang, Xiang Li, Niao He

Adaptive algorithms like AdaGrad and AMSGrad are successful in nonconvex optimization owing to their parameter-agnostic ability -- requiring no a priori knowledge about problem-spe…

math.OC2022★ 1 cited

Generalization Bounds of Nonconvex-(Strongly)-Concave Stochastic Minimax Optimization

Siqi Zhang, Yifan Hu, Liang Zhang +1

This paper takes an initial step to systematically investigate the generalization bounds of algorithms for solving nonconvex-(strongly)-concave (NC-SC/NC-C) stochastic minimax opti…

math.OC2022

Efficient Algorithms for A Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management

Xin Chen, Niao He, Yifan Hu +1

We study a class of stochastic nonconvex optimization in the form of , i.e., is a composition of a convex function and…

math.OC2022★ 6 cited

Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization

Kiran Koshy Thekumparampil, Niao He, Sewoong Oh

We study the bilinearly coupled minimax problem: , where and are both strongly convex smooth functions and admit first-order gra…