4 citations · 8 across the 13 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2021
A Near-Optimal Algorithm for Stochastic Bilevel Optimization via Double-Momentum
Prashant Khanduri, Siliang Zeng, Mingyi Hong +3
This paper proposes a new algorithm -- the \underline{S}ingle-timescale Do\underline{u}ble-momentum \underline{St}ochastic \underline{A}pprox\underline{i}matio\underline{n} (SUSTAI…
math.OC2020★ 2 cited
On the Divergence of Decentralized Non-Convex Optimization
Mingyi Hong, Siliang Zeng, Junyu Zhang +1
We study a generic class of decentralized algorithms in which agents jointly optimize the non-convex objective , while only communicating with th…