{"total":79,"rows":[{"id":"2505.19223","title":"LLaDA 1.5: Variance-Reduced Preference Optimization for Large Language Diffusion Models","created":"2025-05-25","cited_by_count":285,"area":"diffusion"},{"id":"2110.04645","title":"Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning","created":"2021-10-09","cited_by_count":53,"area":null},{"id":"2102.08352","title":"Stochastic Variance Reduction for Variational Inequality Methods","created":"2021-02-16","cited_by_count":47,"area":null},{"id":"2112.14582","title":"A Statistical Analysis of Polyak-Ruppert Averaged Q-learning","created":"2021-12-29","cited_by_count":29,"area":null},{"id":"2102.02322","title":"Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence","created":"2021-02-03","cited_by_count":24,"area":null},{"id":"2102.07245","title":"Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimization","created":"2021-02-14","cited_by_count":21,"area":null},{"id":"2104.09342","title":"Random Reshuffling with Variance Reduction: New Analysis and Better Rates","created":"2021-04-19","cited_by_count":19,"area":null},{"id":"2205.04180","title":"EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimization","created":"2022-05-09","cited_by_count":17,"area":null},{"id":"2110.08084","title":"Gradient Descent on Infinitely Wide Neural Networks: Global Convergence and Generalization","created":"2021-10-15","cited_by_count":16,"area":null},{"id":"2106.03056","title":"MURANA: A Generic Framework for Stochastic Variance-Reduced Optimization","created":"2021-06-06","cited_by_count":14,"area":null},{"id":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","cited_by_count":13,"area":null},{"id":"2210.13277","title":"CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization","created":"2022-10-24","cited_by_count":11,"area":null},{"id":"2310.02987","title":"Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions","created":"2023-10-04","cited_by_count":11,"area":null},{"id":"2403.04348","title":"LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression","created":"2024-03-07","cited_by_count":11,"area":null},{"id":"2302.11147","title":"Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learning","created":"2023-02-22","cited_by_count":10,"area":null},{"id":"2307.14642","title":"Linear Convergence of Black-Box Variational Inference: Should We Stick the Landing?","created":"2023-07-27","cited_by_count":10,"area":null},{"id":"2405.14402","title":"Exact Gauss-Newton Optimization for Training Deep Neural Networks","created":"2024-05-23","cited_by_count":10,"area":null},{"id":"2102.08374","title":"IntSGD: Adaptive Floatless Compression of Stochastic Gradients","created":"2021-02-16","cited_by_count":9,"area":null},{"id":"2110.03294","title":"EF21 with Bells & Whistles: Six Algorithmic Extensions of Modern Error Feedback","created":"2021-10-07","cited_by_count":8,"area":null},{"id":"2206.08627","title":"RECAPP: Crafting a More Efficient Catalyst for Convex Optimization","created":"2022-06-17","cited_by_count":8,"area":null},{"id":"2402.11215","title":"AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods","created":"2024-02-17","cited_by_count":8,"area":null},{"id":"2410.07574","title":"Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition","created":"2024-10-10","cited_by_count":8,"area":"deeprl"},{"id":"2306.08289","title":"$\\textbf{A}^2\\textbf{CiD}^2$: Accelerating Asynchronous Communication in Decentralized Deep Learning","created":"2023-06-14","cited_by_count":7,"area":null},{"id":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2310.20673","title":"Balancing Act: Constraining Disparate Impact in Sparse Models","created":"2023-10-31","cited_by_count":7,"area":null},{"id":"2311.05589","title":"A Coefficient Makes SVRG Effective","created":"2023-11-09","cited_by_count":7,"area":null},{"id":"2306.16484","title":"Towards a Better Theoretical Understanding of Independent Subnetwork Training","created":"2023-06-28","cited_by_count":6,"area":null},{"id":"2410.02116","title":"Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networks","created":"2024-10-03","cited_by_count":6,"area":"distill"},{"id":"2410.12677","title":"Efficient Optimization Algorithms for Linear Adversarial Training","created":"2024-10-16","cited_by_count":6,"area":null},{"id":"2301.03573","title":"Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correction","created":"2023-01-09","cited_by_count":5,"area":null},{"id":"2310.17063","title":"Coreset Markov Chain Monte Carlo","created":"2023-10-25","cited_by_count":5,"area":null},{"id":"2502.02002","title":"The Ball-Proximal (=\"Broximal\") Point Method: a New Algorithm, Convergence Theory, and Applications","created":"2025-02-04","cited_by_count":5,"area":null},{"id":"2101.00935","title":"First-Order Methods for Convex Optimization","created":"2021-01-04","cited_by_count":4,"area":null},{"id":"2302.09766","title":"A One-Sample Decentralized Proximal Algorithm for Non-Convex Stochastic Composite Optimization","created":"2023-02-20","cited_by_count":4,"area":null},{"id":"2302.09832","title":"TAMUNA: Doubly Accelerated Distributed Optimization under Partial Participation","created":"2023-02-20","cited_by_count":4,"area":null},{"id":"2405.15941","title":"A Unified Theory of Stochastic Proximal Point Methods without Smoothness","created":"2024-05-24","cited_by_count":4,"area":null},{"id":"2406.13936","title":"Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods","created":"2024-06-20","cited_by_count":4,"area":null},{"id":"2303.04560","title":"Byzantine-Robust Loopless Stochastic Variance-Reduced Gradient","created":"2023-03-08","cited_by_count":3,"area":null},{"id":"2305.13082","title":"Sketch-and-Project Meets Newton Method: Global $\\mathcal O(k^{-2})$ Convergence with Low-Rank Updates","created":"2023-05-22","cited_by_count":3,"area":null},{"id":"2311.17539","title":"Critical Influence of Overparameterization on Sharpness-aware Minimization","created":"2023-11-29","cited_by_count":3,"area":null},{"id":"2410.01410","title":"On the Convergence of FedProx with Extrapolation and Inexact Prox","created":"2024-10-02","cited_by_count":3,"area":null},{"id":"2507.03404","title":"On the Effectiveness of the z-Transform Method in Quadratic Optimization","created":"2025-07-04","cited_by_count":3,"area":null},{"id":"2512.05226","title":"Variance Matters: Improving Domain Adaptation via Stratified Sampling","created":"2025-12-04","cited_by_count":3,"area":null},{"id":"2101.01505","title":"Delayed Projection Techniques for Linearly Constrained Problems: Convergence Rates, Acceleration, and Applications","created":"2021-01-05","cited_by_count":2,"area":null},{"id":"2112.07839","title":"LoSAC: An Efficient Local Stochastic Average Control Method for Federated Optimization","created":"2021-12-15","cited_by_count":2,"area":null},{"id":"2206.00529","title":"Variance Reduction is an Antidote to Byzantines: Better Rates, Weaker Assumptions and Communication Compression as a Cherry on the Top","created":"2022-06-01","cited_by_count":2,"area":null},{"id":"2311.07411","title":"A Large Deviations Perspective on Policy Gradient Algorithms","created":"2023-11-13","cited_by_count":2,"area":null},{"id":"2403.06677","title":"Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction","created":"2024-03-11","cited_by_count":2,"area":null},{"id":"2406.00920","title":"Demystifying SGD with Doubly Stochastic Gradients","created":"2024-06-03","cited_by_count":2,"area":"diffusion"},{"id":"2407.20956","title":"An Effective Dynamic Gradient Calibration Method for Continual Learning","created":"2024-07-30","cited_by_count":2,"area":null},{"id":"2502.14648","title":"Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shuffling","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2503.13180","title":"GC-Fed: Gradient Centralized Federated Learning with Partial Client Participation","created":"2025-03-17","cited_by_count":2,"area":null},{"id":"2505.21651","title":"AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent","created":"2025-05-27","cited_by_count":2,"area":null},{"id":"2506.04626","title":"Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning","created":"2025-06-05","cited_by_count":2,"area":"deeprl"},{"id":"2605.05084","title":"Order Matters: Improving Domain Adaptation by Reordering Data","created":"2026-05-06","cited_by_count":2,"area":null},{"id":"2111.05530","title":"Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming","created":"2021-11-10","cited_by_count":1,"area":null},{"id":"2211.00176","title":"Xtreme Margin: A Tunable Loss Function for Binary Classification Problems","created":"2022-10-31","cited_by_count":1,"area":null},{"id":"2311.14468","title":"Online Importance Sampling for Stochastic Gradient Optimization","created":"2023-11-24","cited_by_count":1,"area":null},{"id":"2405.17761","title":"Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient","created":"2024-05-28","cited_by_count":1,"area":null},{"id":"2406.18623","title":"Unbiased least squares regression via averaged stochastic gradient descent","created":"2024-06-26","cited_by_count":1,"area":null},{"id":"2410.03760","title":"On the SAGA algorithm with decreasing step","created":"2024-10-02","cited_by_count":1,"area":null},{"id":"2410.20890","title":"Generative Example-Based Explanations: Bridging the Gap between Generative Modeling and Explainability","created":"2024-10-28","cited_by_count":1,"area":null},{"id":"2411.01548","title":"Analysis of regularized federated learning","created":"2024-11-03","cited_by_count":1,"area":null},{"id":"2505.13954","title":"VAMO: Efficient Zeroth-Order Variance Reduction for SGD with Faster Convergence","created":"2025-05-20","cited_by_count":1,"area":null},{"id":"2512.19172","title":"Finite-sample guarantees for data-driven forward-backward operator methods","created":"2025-12-22","cited_by_count":1,"area":null},{"id":"2601.12400","title":"BiCoLoR: Communication-Efficient Optimization with Bidirectional Compression and Local Training","created":"2026-01-18","cited_by_count":1,"area":null},{"id":"2603.22155","title":"RAMPAGE: RAndomized Mid-Point for debiAsed Gradient Extrapolation","created":"2026-03-23","cited_by_count":1,"area":null},{"id":"2210.07290","title":"Joint control variate for faster black-box variational inference","created":"2022-10-13","cited_by_count":0,"area":null},{"id":"2303.16502","title":"Unified analysis of SGD-type methods","created":"2023-03-29","cited_by_count":0,"area":null},{"id":"2309.15676","title":"Joint Sampling and Optimisation for Inverse Rendering","created":"2023-09-27","cited_by_count":0,"area":null},{"id":"2402.12828","title":"Tracking the Median of Gradients with a Stochastic Proximal Point Method","created":"2024-02-20","cited_by_count":0,"area":null},{"id":"2407.14618","title":"SOREL: A Stochastic Algorithm for Spectral Risks Minimization","created":"2024-07-19","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":"2509.10189","title":"Hadamard-Riemannian Optimization for Margin-Variance Ensemble","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2510.20966","title":"Scalable inference of functional neural connectivity at submillisecond timescales","created":"2025-10-23","cited_by_count":0,"area":null},{"id":"2602.05304","title":"A Short and Unified Convergence Analysis of the SAG, SAGA, and IAG Algorithms","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2602.05489","title":"Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2605.05577","title":"Accelerating LMO-Based Optimization via Implicit Gradient Transport","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.28513","title":"Learning Theory of the SVRG: Generalization and Convergence Analysis","created":"2026-05-27","cited_by_count":0,"area":null}],"next_cursor":null}