3 problems

0 votes0 replies1 view
The sharp two-step convergence-rate conjecture for gradient descent-ascent
Let $F\in\mathcal{F}(L_x,L_y,L_{xy},\mu_x,\mu_y)$ , where $L_x,L_y,L_{xy}$ are the smoothness parameters, $\mu_x,\mu_y$ are the strong-convexity and strong-concavity parameters, and…
Conjectureopengradient-descent-ascent optimization saddle-point-problemsarXiv posted 2 days ago
0 votes0 replies0 views
Variance-reduced complexity conjecture for finite-sum saddle-point problems
Consider the finite-sum saddle-point problem discussed above, with $m_G$ component functions having smoothness parameter $L_G$ , and strong-convexity/strong-concavity parameters…
Conjectureopenoptimization saddle-point-problems variance-reductionarXiv posted 2 days ago
0 votes0 replies0 views
Uniform boundedness conjecture for the truncated mixed variational problem
Uniform boundedness conjecture. For the truncated problem,
Conjectureopennumerical-analysis preconditioning saddle-point-problemsarXiv posted 2 days ago

The sharp two-step convergence-rate conjecture for gradient descent-ascent