{"total":23,"rows":[{"id":"2305.16297","title":"Unbiased Compression Saves Communication in Distributed Optimization: When and How Much?","created":"2023-05-25","cited_by_count":14,"area":null},{"id":"2307.11782","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","created":"2023-07-20","cited_by_count":14,"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":"2301.05872","title":"CEDAS: A Compressed Decentralized Stochastic Gradient Method with Improved Convergence","created":"2023-01-14","cited_by_count":9,"area":null},{"id":"2306.06291","title":"Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity","created":"2023-06-09","cited_by_count":7,"area":null},{"id":"2306.07159","title":"On the Computation-Communication Trade-Off with A Flexible Gradient Tracking Approach","created":"2023-06-12","cited_by_count":4,"area":null},{"id":"2505.22549","title":"DES-LOC: Desynced Low Communication Adaptive Optimizers for Training Foundation Models","created":"2025-05-28","cited_by_count":4,"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":"2403.10423","title":"Quantization Avoids Saddle Points in Distributed Optimization","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2510.05361","title":"MT-DAO: Multi-Timescale Distributed Adaptive Optimizers with Local Updates","created":"2025-10-06","cited_by_count":2,"area":null},{"id":"2510.07980","title":"Unveiling the Power of Multiple Gossip Steps: A Stability-Based Generalization Analysis in Decentralized Training","created":"2025-10-09","cited_by_count":2,"area":null},{"id":"2306.09595","title":"Structured Cooperative Learning with Graphical Model Priors","created":"2023-06-16","cited_by_count":1,"area":null},{"id":"2410.06482","title":"OledFL: Unleashing the Potential of Decentralized Federated Learning via Opposite Lookahead Enhancement","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2506.05791","title":"Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization","created":"2025-06-06","cited_by_count":1,"area":null},{"id":"2601.11435","title":"Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise","created":"2026-01-16","cited_by_count":1,"area":null},{"id":"2606.07496","title":"Accelerated Decentralized Stochastic Gradient Descent for Strongly Convex Optimization","created":"2026-06-05","cited_by_count":1,"area":null},{"id":"2606.09154","title":"Improved Convergence Analysis of Topology Dependence in Decentralized SGD","created":"2026-06-08","cited_by_count":1,"area":null},{"id":"2509.08726","title":"Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness","created":"2025-09-10","cited_by_count":0,"area":null},{"id":"2509.18129","title":"Pareto-optimal Trade-offs Between Communication and Computation with Flexible Gradient Tracking","created":"2025-09-11","cited_by_count":0,"area":null},{"id":"2601.02682","title":"Topology-Independent Robustness of the Weighted Mean under Label Poisoning Attacks in Heterogeneous Decentralized Learning","created":"2026-01-06","cited_by_count":0,"area":null},{"id":"2601.03566","title":"Provably Convergent Decentralized Optimization over Directed Graphs under Generalized Smoothness","created":"2026-01-07","cited_by_count":0,"area":null},{"id":"2602.11789","title":"Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2610.05789","title":"Dimension-Free Decentralized Nonsmooth Nonconvex Stochastic Optimization","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}