arXiv AI
Graphon Particle Systems, Part II: Dynamics of Distributed Stochastic Continuum Optimization
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Statistics ML
Aug 25
DIGing--SGLD: Decentralized and Scalable Langevin Sampling over Time--Varying Networks
arXiv:2511.12836v2 Announce Type: replace-cross Abstract: Sampling from a target distribution induced by training data is central to Bayesian learning, with Stochastic Gradient Langevin Dynamics (SGL...
arXiv Machine Learning
Jun 8
Accelerated Decentralized Stochastic Gradient Descent for Strongly Convex Optimization
arXiv:2606. 07496v1 Announce Type: new Abstract: Decentralized stochastic optimization is a fundamental paradigm for large-scale learning over networks, where agents communicate only with their neighbors and no central coordinator is required.
arXiv Machine Learning
Jun 4
Near-Optimal Decentralized Stochastic Convex Optimization over Networks
arXiv:2606. 04757v1 Announce Type: cross Abstract: We study decentralized stochastic smooth convex optimization, where $M$ workers minimize an average objective using local stochastic gradients and neighbor-only communication over a fixed gossip network.
arXiv AI
Aug 11
Distributed Optimization with Streaming Data: A Temporal Weighting Perspective
arXiv:2608. 09565v1 Announce Type: cross Abstract: Optimization theory is a widely used tool for intelligent decision-making.
arXiv Machine Learning
Jun 3
Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness
arXiv:2509. 08726v3 Announce Type: replace-cross Abstract: This paper focuses on the decentralized stochastic optimization problem $f(\mathbf{x})=\frac{1}{m}\sum_{i=1}^m f_i(\mathbf{x})$ over a connected network of $n$ agents, where each local function has the form of $f_i(\mathbf{x}) = {\mathbb E}\left[F(\mathbf{x};{\boldsymbol \xi}_i)\right]$ which satisfies the $(L_0,L_1)$-smooth condition but possibly nonconvex and each random variable ${\boldsymbol \xi}_i$ follows distribution ${\mathcal D}_i$.
arXiv AI
Jun 3
DeMuon: A Decentralized Muon for Matrix Optimization over Graphs
arXiv:2510. 01377v2 Announce Type: replace-cross Abstract: In this paper, we propose DeMuon, a method for decentralized matrix optimization over a given communication topology.