{"total":16,"rows":[{"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":"2310.20452","title":"AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithms","created":"2023-10-31","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":"2302.00845","title":"Coordinating Distributed Example Orders for Provably Accelerated Training","created":"2023-02-02","cited_by_count":7,"area":null},{"id":"2305.19259","title":"On Convergence of Incremental Gradient for Non-Convex Smooth Functions","created":"2023-05-30","cited_by_count":7,"area":null},{"id":"2305.02247","title":"Select without Fear: Almost All Mini-Batch Schedules Generalize Optimally","created":"2023-05-03","cited_by_count":5,"area":null},{"id":"2402.07052","title":"Understanding the Training Speedup from Sampling with Approximate Losses","created":"2024-02-10","cited_by_count":2,"area":null},{"id":"2603.25047","title":"The Order Is The Message","created":"2026-03-24","cited_by_count":2,"area":null},{"id":"2605.20150","title":"TideGS: Scalable Training of Over One Billion 3D Gaussian Splatting Primitives via Out-of-Core Optimization","created":"2026-05-19","cited_by_count":2,"area":null},{"id":"2411.05868","title":"Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling","created":"2024-11-07","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":"2509.04133","title":"Shuffling Heuristic in Variational Inequalities: Establishing New Convergence Guarantees","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2608.14761","title":"CFR without Unbiasedness: Deterministic Guarantees for Persistent Public-Chance Schedules","created":"2026-08-14","cited_by_count":0,"area":null}],"next_cursor":null}