Saved in:
Bibliographic Details
Main Authors: Li, Zilin, Xu, Weiwei, Tong, Xuchun, Lu, Xuanbo, Zhao, Xuanqi
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.16801
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915943492354048
author Li, Zilin
Xu, Weiwei
Tong, Xuchun
Lu, Xuanbo
Zhao, Xuanqi
author_facet Li, Zilin
Xu, Weiwei
Tong, Xuchun
Lu, Xuanbo
Zhao, Xuanqi
contents While modern representation learning relies heavily on global error signals, decentralized algorithms driven by local interactions offer a fundamental distributed alternative. However, the macroscopic convergence properties of these discrete dynamics on continuous data manifolds remain theoretically unresolved, notoriously suffering from parameter explosion. We bridge this gap by formalizing decentralized learning as a coupled slow-fast dynamical system on Riemannian manifolds. First, using measure-theoretic limits, we prove that the discrete spatial transitions converge uniformly to an overdamped Langevin stochastic differential equation. Second, via the Itô-Poisson resolvent and a stochastic extension of LaSalle's Invariance Principle, we establish that the representation weights unconditionally avoid divergence and align strictly with the principal eigenspace of the spatial measure. Finally, we construct a joint Lyapunov functional for the fully coupled spatial-parametric flow. This proves global dissipativity and demonstrates that orthogonally disentangled, linearly separable features emerge spontaneously at the stationary limit. Our framework bridges discrete algorithms with continuous stochastic analysis, providing a formal theoretical baseline for decentralized representation learning.
format Preprint
id arxiv_https___arxiv_org_abs_2604_16801
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Continuous Limits of Coupled Flows in Representation Learning
Li, Zilin
Xu, Weiwei
Tong, Xuchun
Lu, Xuanbo
Zhao, Xuanqi
Machine Learning
While modern representation learning relies heavily on global error signals, decentralized algorithms driven by local interactions offer a fundamental distributed alternative. However, the macroscopic convergence properties of these discrete dynamics on continuous data manifolds remain theoretically unresolved, notoriously suffering from parameter explosion. We bridge this gap by formalizing decentralized learning as a coupled slow-fast dynamical system on Riemannian manifolds. First, using measure-theoretic limits, we prove that the discrete spatial transitions converge uniformly to an overdamped Langevin stochastic differential equation. Second, via the Itô-Poisson resolvent and a stochastic extension of LaSalle's Invariance Principle, we establish that the representation weights unconditionally avoid divergence and align strictly with the principal eigenspace of the spatial measure. Finally, we construct a joint Lyapunov functional for the fully coupled spatial-parametric flow. This proves global dissipativity and demonstrates that orthogonally disentangled, linearly separable features emerge spontaneously at the stationary limit. Our framework bridges discrete algorithms with continuous stochastic analysis, providing a formal theoretical baseline for decentralized representation learning.
title Continuous Limits of Coupled Flows in Representation Learning
topic Machine Learning
url https://arxiv.org/abs/2604.16801