{"total":17,"rows":[{"id":"2110.10342","title":"Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond","created":"2021-10-20","cited_by_count":36,"area":null},{"id":"2307.04138","title":"On The Impact of Machine Learning Randomness on Group Fairness","created":"2023-07-09","cited_by_count":26,"area":null},{"id":"2303.07160","title":"Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond","created":"2023-03-13","cited_by_count":22,"area":null},{"id":"2205.10733","title":"GraB: Finding Provably Better Data Permutations than Random Reshuffling","created":"2022-05-22","cited_by_count":19,"area":null},{"id":"2202.01838","title":"Characterizing & Finding Good Data Orderings for Fast Convergence of Sequential Gradient Methods","created":"2022-02-03","cited_by_count":16,"area":null},{"id":"2403.07723","title":"On the Last-Iterate Convergence of Shuffling Gradient Methods","created":"2024-03-12","cited_by_count":11,"area":null},{"id":"2307.05906","title":"Mini-Batch Optimization of Contrastive Loss","created":"2023-07-12","cited_by_count":8,"area":null},{"id":"2302.00845","title":"Coordinating Distributed Example Orders for Provably Accelerated Training","created":"2023-02-02","cited_by_count":7,"area":null},{"id":"2312.02368","title":"RINAS: Training with Dataset Shuffling Can Be General and Fast","created":"2023-12-04","cited_by_count":3,"area":null},{"id":"2504.04274","title":"Randomised Splitting Methods and Stochastic Gradient Descent","created":"2025-04-05","cited_by_count":3,"area":null},{"id":"2606.32005","title":"Random Reshuffling Dominates Stochastic Gradient Descent","created":"2026-06-30","cited_by_count":2,"area":null},{"id":"2206.00632","title":"Computing the Variance of Shuffling Stochastic Gradient Algorithms via Power Spectral Density Analysis","created":"2022-06-01","cited_by_count":1,"area":null},{"id":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2401.07694","title":"Stochastic optimization with arbitrary recurrent data sampling","created":"2024-01-15","cited_by_count":0,"area":null},{"id":"2512.04703","title":"Towards Continuous-Time Approximations for Stochastic Gradient Descent without Replacement","created":"2025-12-04","cited_by_count":0,"area":null},{"id":"2609.36271","title":"Stochastic Optimization Under Power-Law Spectra: Tight Bounds and Shuffling Analysis","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.01149","title":"When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}