ResearchBenchmarksMinimax Optimization on Unconstrained Finite-Sum Convex-Concave ProblemsFollow1Lower BoundSGDA-US0.950.97511.025Dec 31, 2024Evaluation ResultsMethodMethodLinksLower BoundUpper BoundSGDA-USsampling=Uniform Samplingsampling=Uniform Sampling2024.121—SEG-USsampling=Uniform Samplingsampling=Uniform Sampling2024.121—SGDA-RRsampling=Random Reshuf...sampling=Random Reshuffling2024.121—SEG-RRsampling=Random Reshuf...sampling=Random Reshuffling2024.121—SEG-FFsampling=Flip-Flop Shu...sampling=Flip-Flop Shuffling2024.121—