v1v2 (latest)

Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization

Neural Information Processing Systems (NeurIPS), 2022

7 June 2022

Papers citing "Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization"

3 / 3 papers shown

Title
Provably Fast Finite Particle Variants of SVGD via Virtual Particle Stochastic ApproximationNeural Information Processing Systems (NeurIPS), 2023 Aniket Das Dheeraj M. Nagaraj 376 8 0 27 May 2023
SGDA with shuffling: faster convergence for nonconvex-PŁ minimax optimizationInternational Conference on Learning Representations (ICLR), 2022 Hanseul Cho Chulhee Yun 193 9 0 12 Oct 2022
Fixed-Time Convergence for a Class of Nonconvex-Nonconcave Min-Max Problems Kunal Garg Mayank Baranwal 100 3 0 26 Jul 2022