8 citations · 14 across the 9 of their papers we have counts for
5 papers · 1 filter
Dual-Anchor Acceleration Is Near-Optimal for Stochastic Monotone Root-Finding
TaeHo Yoon, Nicolas Loizou
Among distinct optimal acceleration mechanisms for deterministic monotone root-finding problems and fixed-point problems, dual-anchoring has recently been shown to admit a more rob…
Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems
Ruichen Jiang, TaeHo Yoon
We study the deterministic oracle complexity of finding approximate solutions to composite monotone inclusion problems, formed by the sum of a smooth single-valued monotone operato…
Polyak-Type Extragradient Methods for Monotone Root-Finding Problems
TaeHo Yoon, Sayantan Choudhury, Ezra Greenberg +1
We study Polyak-type step-size selection for extragradient methods for solving deterministic and stochastic monotone root-finding problems. We show that the known projection-type c…
Direct Acceleration of Stochastic Root-Finding Without Variance Reduction and Regularization
TaeHo Yoon, Nicolas Loizou
Acceleration for deterministic root-finding problems has been extensively studied in recent years; specifically, the anchor-based, or Halpern-type methods achieve optimal convergen…
On Same-Sample and Independent-Sample Stochastic Extragradient for Monotone Variational Inequalities
TaeHo Yoon, Nicolas Loizou
We study stochastic extragradient (SEG) methods for solving monotone variational inequality problems (VIPs) over a feasible set. Although extragradient is a foundational algorithm…