Copertina

Distributed Learning over Arbitrary Topology: Linear Speed-Up with Polynomial Transient Time

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	You, Runze, Pu, Shi
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

FedSUM Family: Efficient Federated Learning Methods under Arbitrary Client Participation
di: You, Runze, et al.
Pubblicazione: (2025)

Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Up
di: Mangold, Paul, et al.
Pubblicazione: (2025)

B-ary Tree Push-Pull Method is Provably Efficient for Distributed Learning on Heterogeneous Data
di: You, Runze, et al.
Pubblicazione: (2024)

Achieving Linear Speedup for Composite Federated Learning
di: Huang, Kun, et al.
Pubblicazione: (2026)

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
di: Bayramoğlu, Selin, et al.
Pubblicazione: (2026)

Stochastic Push-Pull for Decentralized Nonconvex Optimization
di: You, Runze, et al.
Pubblicazione: (2025)

Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
di: Tyurin, Alexander, et al.
Pubblicazione: (2024)

Learning of Linear Dynamical Systems as a Non-Commutative Polynomial Optimization Problem
di: Zhou, Quan, et al.
Pubblicazione: (2020)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
di: Qiu, Pu, et al.
Pubblicazione: (2026)

Topology Learning of unknown Networked Linear Dynamical System excited by Cyclostationary inputs
di: Doddi, Harish, et al.
Pubblicazione: (2020)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
di: Zhou, Yijie, et al.
Pubblicazione: (2025)

Accelerating Decentralized Optimization via Overlapping Local Steps
di: Zhou, Yijie, et al.
Pubblicazione: (2026)

Finite-Time Bounds for Two-Time-Scale Stochastic Approximation with Arbitrary Norm Contractions and Markovian Noise
di: Chandak, Siddharth, et al.
Pubblicazione: (2025)

Distributed Random Reshuffling Methods with Improved Convergence
di: Huang, Kun, et al.
Pubblicazione: (2023)

Model-Free Learning for the Linear Quadratic Regulator over Rate-Limited Channels
di: Ye, Lintao, et al.
Pubblicazione: (2024)

Decentralized Min-Max Optimization with Gradient Tracking
di: You, Runze, et al.
Pubblicazione: (2025)

Reinforcement Learning for a Discrete-Time Linear-Quadratic Control Problem with an Application
di: Li, Lucky
Pubblicazione: (2024)

Automated Proof of Polynomial Inequalities via Reinforcement Learning
di: Liu, Banglong, et al.
Pubblicazione: (2025)

A PAC-Bayes Approach for Controlling Unknown Linear Discrete-time Systems
di: Luo, Yujia, et al.
Pubblicazione: (2026)

Action Gaps and Advantages in Continuous-Time Distributional Reinforcement Learning
di: Wiltzer, Harley, et al.
Pubblicazione: (2024)

A Simple Finite-Time Analysis of TD Learning with Linear Function Approximation
di: Mitra, Aritra
Pubblicazione: (2024)

Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes
di: Iommazzo, Gabriele, et al.
Pubblicazione: (2025)

Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time
di: Kim, Sungyoon, et al.
Pubblicazione: (2024)

Decentralized Federated Learning with Gradient Tracking over Time-Varying Directed Networks
di: Nguyen, Duong Thuy Anh, et al.
Pubblicazione: (2024)

Predictor-Based Output-Feedback Control of Linear Systems with Time-Varying Input and Measurement Delays via Neural-Approximated Prediction Horizons
di: Bhan, Luke, et al.
Pubblicazione: (2026)

Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
di: Guo, Luyao, et al.
Pubblicazione: (2023)

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
di: Lee, Wei-Cheng, et al.
Pubblicazione: (2025)

Online Learning for Dynamic Constellation Topologies
di: Norberto, João, et al.
Pubblicazione: (2026)

Shallow Neural Networks Learn Low-Degree Spherical Polynomials with Feature Learning by Learnable Channel Attention
di: Yang, Yingzhen
Pubblicazione: (2025)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
di: Chang, Ting-Jui, et al.
Pubblicazione: (2024)

Mutual Information Optimal Control of Discrete-Time Linear Systems
di: Enami, Shoju, et al.
Pubblicazione: (2025)

Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching
di: Attia, Amit, et al.
Pubblicazione: (2024)

Tight Finite Time Bounds of Two-Time-Scale Linear Stochastic Approximation with Markovian Noise
di: Haque, Shaan Ul, et al.
Pubblicazione: (2023)

Learning to Sparsify Stochastic Linear Bandits
di: Wang, Zhengmiao, et al.
Pubblicazione: (2026)

A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron
di: Garber, Dan
Pubblicazione: (2025)

$O(1/k)$ Finite-Time Bound for Non-Linear Two-Time-Scale Stochastic Approximation
di: Chandak, Siddharth
Pubblicazione: (2025)

Differentially Private Clipped-SGD: High-Probability Convergence with Arbitrary Clipping Level
di: Khah, Saleh Vatan, et al.
Pubblicazione: (2025)

Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networks
di: Papazov, Hristo, et al.
Pubblicazione: (2024)

Policy Gradient Methods for Discrete Time Linear Quadratic Regulator With Random Parameters
di: Li, Deyue
Pubblicazione: (2023)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
di: Shi, Qiankun, et al.
Pubblicazione: (2025)