List your company

Minimax Optimization on Unconstrained Finite-Sum Convex-Concave Problems

1Lower BoundSGDA-US
0.950.97511.025Dec 31, 2024

Evaluation results

MethodLinks
SGDA-USsampling=Uniform Sampling2024.121—
SEG-USsampling=Uniform Sampling2024.121—
SGDA-RRsampling=Random Reshuffling2024.121—
SEG-RRsampling=Random Reshuffling2024.121—
SEG-FFsampling=Flip-Flop Shuffling2024.121—