{"total":65,"rows":[{"id":"2107.06917","title":"A Field Guide to Federated Optimization","created":"2021-07-14","cited_by_count":315,"area":null},{"id":"2106.05203","title":"EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback","created":"2021-06-09","cited_by_count":133,"area":null},{"id":"2102.07053","title":"Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse Gradients","created":"2021-02-14","cited_by_count":123,"area":null},{"id":"2102.07845","title":"MARINA: Faster Non-Convex Distributed Learning with Compression","created":"2021-02-15","cited_by_count":78,"area":null},{"id":"2106.02969","title":"FedNL: Making Newton-Type Methods Applicable to Federated Learning","created":"2021-06-05","cited_by_count":52,"area":null},{"id":"2111.00465","title":"DAdaQuant: Doubly-adaptive quantization for communication-efficient Federated Learning","created":"2021-10-31","cited_by_count":41,"area":null},{"id":"2202.07262","title":"Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methods","created":"2022-02-15","cited_by_count":37,"area":null},{"id":"2103.03239","title":"Moshpit SGD: Communication-Efficient Decentralized Training on Heterogeneous Unreliable Devices","created":"2021-03-04","cited_by_count":36,"area":null},{"id":"2206.03611","title":"FedPop: A Bayesian Approach for Personalised Federated Learning","created":"2022-06-07","cited_by_count":35,"area":null},{"id":"2510.16981","title":"MuonBP: Faster Muon via Block-Periodic Orthogonalization","created":"2025-10-19","cited_by_count":35,"area":null},{"id":"2206.09888","title":"SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compression","created":"2022-06-20","cited_by_count":34,"area":null},{"id":"2206.03665","title":"Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression","created":"2022-06-08","cited_by_count":33,"area":null},{"id":"2207.04338","title":"Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learning","created":"2022-07-09","cited_by_count":33,"area":null},{"id":"2305.15155","title":"Momentum Provably Improves Error Feedback!","created":"2023-05-24","cited_by_count":31,"area":null},{"id":"2106.00797","title":"QLSD: Quantised Langevin stochastic dynamics for Bayesian federated learning","created":"2021-06-01","cited_by_count":26,"area":null},{"id":"2102.07158","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","created":"2021-02-14","cited_by_count":25,"area":null},{"id":"2107.09461","title":"CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression","created":"2021-07-20","cited_by_count":23,"area":null},{"id":"2201.07598","title":"Near-Optimal Sparse Allreduce for Distributed Deep Learning","created":"2022-01-19","cited_by_count":23,"area":null},{"id":"2210.07863","title":"Revisiting Optimal Convergence Rate for Smooth and Non-convex Stochastic Decentralized Optimization","created":"2022-10-14","cited_by_count":23,"area":null},{"id":"2212.14370","title":"Can 5th Generation Local Training Methods Support Client Sampling? Yes!","created":"2022-12-29","cited_by_count":22,"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":"2102.12528","title":"Preserved central model for faster bidirectional compression in distributed settings","created":"2021-02-24","cited_by_count":21,"area":null},{"id":"2207.03957","title":"Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with Inexact Prox","created":"2022-07-08","cited_by_count":19,"area":null},{"id":"2206.07021","title":"Federated Optimization Algorithms with Random Reshuffling and Gradient Compression","created":"2022-06-14","cited_by_count":18,"area":null},{"id":"2203.08134","title":"Privacy-Aware Compression for Federated Data Analysis","created":"2022-03-15","cited_by_count":17,"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":"2202.01268","title":"DASHA: Distributed Nonconvex Optimization with Communication Compression, Optimal Oracle Complexity, and No Client Synchronization","created":"2022-02-02","cited_by_count":16,"area":null},{"id":"2204.02593","title":"Nonlinear gradient mappings and stochastic optimization: A general framework with applications to heavy-tail noise","created":"2022-04-06","cited_by_count":16,"area":null},{"id":"2110.03313","title":"Distributed Methods with Compressed Communication for Solving Variational Inequalities, with Theoretical Guarantees","created":"2021-10-07","cited_by_count":15,"area":null},{"id":"2111.01847","title":"Basis Matters: Better Communication-Efficient Second Order Methods for Federated Learning","created":"2021-11-02","cited_by_count":15,"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":"2112.13097","title":"Faster Rates for Compressed Federated Learning with Client-Variance Reduction","created":"2021-12-24","cited_by_count":14,"area":null},{"id":"2104.06685","title":"BROADCAST: Reducing Both Stochastic and Compression Noise to Robustify Communication-Efficient Federated Learning","created":"2021-04-14","cited_by_count":13,"area":null},{"id":"2111.00705","title":"Communication-Compressed Adaptive Gradient Method for Distributed Nonconvex Optimization","created":"2021-11-01","cited_by_count":12,"area":null},{"id":"2301.00944","title":"Temporal Difference Learning with Compressed Updates: Error-Feedback meets Reinforcement Learning","created":"2023-01-03","cited_by_count":12,"area":null},{"id":"2310.09804","title":"Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates","created":"2023-10-15","cited_by_count":12,"area":null},{"id":"2206.03588","title":"Distributed Newton-Type Methods with Communication Compression and Bernoulli Aggregation","created":"2022-06-07","cited_by_count":11,"area":null},{"id":"2305.07612","title":"Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression","created":"2023-05-12","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":"2507.08784","title":"Greedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees","created":"2025-07-11","cited_by_count":11,"area":null},{"id":"2106.03524","title":"Theoretically Better and Numerically Faster Distributed Optimization with Smoothness-Aware Quantization Techniques","created":"2021-06-07","cited_by_count":9,"area":null},{"id":"2202.02491","title":"Distributed Learning With Sparsified Gradient Differences","created":"2022-02-05","cited_by_count":9,"area":null},{"id":"2203.01198","title":"Linear Stochastic Bandits over a Bit-Constrained Channel","created":"2022-03-02","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.09446","title":"Compression and Data Similarity: Combination of Two Techniques for Communication-Efficient Solving of Distributed Variational Inequalities","created":"2022-06-19","cited_by_count":8,"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":"2110.07751","title":"Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation","created":"2021-10-14","cited_by_count":7,"area":null},{"id":"2206.10452","title":"Shifted Compression Framework: Generalizations and Improvements","created":"2022-06-21","cited_by_count":6,"area":null},{"id":"2209.05148","title":"Personalized Federated Learning with Communication Compression","created":"2022-09-12","cited_by_count":6,"area":null},{"id":"2111.02083","title":"Federated Expectation Maximization with heterogeneity mitigation and variance reduction","created":"2021-11-03","cited_by_count":5,"area":null},{"id":"2311.14127","title":"Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences","created":"2023-11-23","cited_by_count":5,"area":null},{"id":"2203.02383","title":"Distributed Methods with Absolute Compression and Error Compensation","created":"2022-03-04","cited_by_count":4,"area":null},{"id":"2206.00920","title":"Federated Learning with a Sampling Algorithm under Isoperimetry","created":"2022-06-02","cited_by_count":4,"area":null},{"id":"2102.03112","title":"DeepReduce: A Sparse-tensor Communication Framework for Distributed Deep Learning","created":"2021-02-05","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":"2210.09626","title":"FLECS-CGD: A Federated Learning Second-Order Framework via Compression and Sketching with Compressed Gradient Differences","created":"2022-10-18","cited_by_count":2,"area":null},{"id":"2302.09634","title":"Magnitude Matters: Fixing SIGNSGD Through Magnitude-Aware Sparsification in the Presence of Data Heterogeneity","created":"2023-02-19","cited_by_count":2,"area":null},{"id":"2402.18018","title":"Communication Efficient ConFederated Learning: An Event-Triggered SAGA Approach","created":"2024-02-28","cited_by_count":2,"area":null},{"id":"2102.09631","title":"Peering Beyond the Gradient Veil with Distributed Auto Differentiation","created":"2021-02-18","cited_by_count":1,"area":null},{"id":"2412.17082","title":"MARINA-P: Superior Performance in Non-smooth Federated Optimization with Adaptive Stepsizes","created":"2024-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":"2604.24012","title":"FedSLoP: Memory-Efficient Federated Learning with Low-Rank Gradient Projection","created":"2026-04-27","cited_by_count":1,"area":null},{"id":"2207.00392","title":"Better Methods and Theory for Federated Learning: Compression, Client Selection and Heterogeneity","created":"2022-07-01","cited_by_count":0,"area":null},{"id":"2507.05508","title":"Beyond Communication Overhead: A Multilevel Monte Carlo Approach for Mitigating Compression Bias in Distributed Learning","created":"2025-07-07","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}