{"total":18,"rows":[{"id":"2410.08305","title":"Randomized Asymmetric Chain of LoRA: The First Meaningful Theoretical Framework for Low-Rank Adaptation","created":"2024-10-10","cited_by_count":13,"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":"2306.03240","title":"Improving Accelerated Federated Learning with Compression and Importance Sampling","created":"2023-06-05","cited_by_count":8,"area":null},{"id":"2305.13170","title":"Explicit Personalization and Local Training: Double Communication Acceleration in Federated Learning","created":"2023-05-22","cited_by_count":5,"area":null},{"id":"2403.09904","title":"FedComLoc: Communication-Efficient Distributed Training of Sparse and Quantized Models","created":"2024-03-14","cited_by_count":5,"area":null},{"id":"2502.00775","title":"ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning","created":"2025-02-02","cited_by_count":5,"area":null},{"id":"2509.22860","title":"Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity","created":"2025-09-26","cited_by_count":5,"area":null},{"id":"2402.02569","title":"On the Complexity of Finite-Sum Smooth Optimization under the Polyak-{\\L}ojasiewicz Condition","created":"2024-02-04","cited_by_count":2,"area":null},{"id":"2605.13434","title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","created":"2026-05-13","cited_by_count":2,"area":null},{"id":"2605.18174","title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2309.13307","title":"CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity","created":"2023-09-23","cited_by_count":1,"area":null},{"id":"2505.15371","title":"Distributionally Robust Federated Learning with Client Drift Minimization","created":"2025-05-21","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":"2605.20866","title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","created":"2026-05-20","cited_by_count":1,"area":null},{"id":"2503.21627","title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","created":"2025-03-27","cited_by_count":0,"area":null},{"id":"2605.00740","title":"Randomized Subspace Nesterov Accelerated Gradient","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2608.05358","title":"DG-FedReuse: Proxy-Gradient-Gated Cached-Update Reuse with Matched Sparse Uplink Accounting","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2608.06563","title":"Theoretical Foundations of Communication-Efficient, Robust, and Practical Distributed and Federated Optimization","created":"2026-08-06","cited_by_count":0,"area":null}],"next_cursor":null}