Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1903.01463
Cited By
SGD without Replacement: Sharper Rates for General Smooth Convex Functions
4 March 2019
Prateek Jain
Dheeraj M. Nagaraj
Praneeth Netrapalli
Re-assign community
ArXiv
PDF
HTML
Papers citing
"SGD without Replacement: Sharper Rates for General Smooth Convex Functions"
25 / 25 papers shown
Title
Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
Shira Vansover-Hager
Tomer Koren
Roi Livni
39
0
0
13 May 2025
Better Rates for Random Task Orderings in Continual Linear Models
Itay Evron
Ran Levinstein
Matan Schliserman
Uri Sherman
Tomer Koren
Daniel Soudry
Nathan Srebro
CLL
35
0
0
06 Apr 2025
Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimization
Zhen Qin
Zhishuai Liu
Pan Xu
26
1
0
24 Oct 2023
Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond
Jaeyoung Cha
Jaewook Lee
Chulhee Yun
28
23
0
13 Mar 2023
On the Convergence of Federated Averaging with Cyclic Client Participation
Yae Jee Cho
Pranay Sharma
Gauri Joshi
Zheng Xu
Satyen Kale
Tong Zhang
FedML
44
27
0
06 Feb 2023
SGDA with shuffling: faster convergence for nonconvex-PŁ minimax optimization
Hanseul Cho
Chulhee Yun
32
9
0
12 Oct 2022
On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms
Lam M. Nguyen
Trang H. Tran
32
2
0
13 Jun 2022
Federated Random Reshuffling with Compression and Variance Reduction
Grigory Malinovsky
Peter Richtárik
FedML
27
10
0
08 May 2022
Benign Underfitting of Stochastic Gradient Descent
Tomer Koren
Roi Livni
Yishay Mansour
Uri Sherman
MLT
20
13
0
27 Feb 2022
Nesterov Accelerated Shuffling Gradient Method for Convex Optimization
Trang H. Tran
K. Scheinberg
Lam M. Nguyen
40
11
0
07 Feb 2022
Distributed Random Reshuffling over Networks
Kun-Yen Huang
Xiao Li
Andre Milzarek
Shi Pu
Junwen Qiu
39
11
0
31 Dec 2021
Random-reshuffled SARAH does not need a full gradient computations
Aleksandr Beznosikov
Martin Takáč
26
7
0
26 Nov 2021
Distributed stochastic proximal algorithm with random reshuffling for non-smooth finite-sum optimization
Xia Jiang
Xianlin Zeng
Jian Sun
Jie Chen
Lihua Xie
18
6
0
06 Nov 2021
Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems
Itay Safran
Ohad Shamir
33
19
0
12 Jun 2021
Can Single-Shuffle SGD be Better than Reshuffling SGD and GD?
Chulhee Yun
S. Sra
Ali Jadbabaie
17
10
0
12 Mar 2021
Variance Reduced Training with Stratified Sampling for Forecasting Models
Yucheng Lu
Youngsuk Park
Lifan Chen
Bernie Wang
Christopher De Sa
Dean Phillips Foster
AI4TS
38
17
0
02 Mar 2021
Permutation-Based SGD: Is Random Optimal?
Shashank Rajput
Kangwook Lee
Dimitris Papailiopoulos
28
14
0
19 Feb 2021
Advances in Electron Microscopy with Deep Learning
Jeffrey M. Ede
35
2
0
04 Jan 2021
A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein Distance
Minhui Huang
Shiqian Ma
Lifeng Lai
26
42
0
09 Dec 2020
SMG: A Shuffling Gradient-Based Method with Momentum
Trang H. Tran
Lam M. Nguyen
Quoc Tran-Dinh
23
21
0
24 Nov 2020
Review: Deep Learning in Electron Microscopy
Jeffrey M. Ede
34
79
0
17 Sep 2020
Breaking the Communication-Privacy-Accuracy Trilemma
Wei-Ning Chen
Peter Kairouz
Ayfer Özgür
14
116
0
22 Jul 2020
Random Reshuffling: Simple Analysis with Vast Improvements
Konstantin Mishchenko
Ahmed Khaled
Peter Richtárik
37
131
0
10 Jun 2020
A Unified Convergence Analysis for Shuffling-Type Gradient Methods
Lam M. Nguyen
Quoc Tran-Dinh
Dzung Phan
Phuong Ha Nguyen
Marten van Dijk
39
78
0
19 Feb 2020
How Good is SGD with Random Shuffling?
Itay Safran
Ohad Shamir
9
80
0
31 Jul 2019
1