Decentralized Dynamic Smoothing with Partial Gradient Tracking on Compact Submanifolds
Abstract
We study decentralized composite optimization on compact embedded submanifolds, where each local objective contains a smooth agent-specific loss and a common convex nonsmooth regularizer. Tracking the full smoothed gradient introduces a Lipschitz factor that diverges as the smoothing parameter decreases. We propose a decentralized smoothing method with partial gradient tracking (DSPGT), which tracks only the heterogeneous smooth gradients and evaluates the common smoothing gradient locally. A Lyapunov function containing the local regularizer values controls the latter term through the Jensen decrease induced by mixing. For a uniformly sampled tail iterate, the expected smoothed stationarity residual and consensus error are . For Moreau smoothing, these bounds give a generalized -stationary point of the original problem at every agent in projection-oracle calls and communication rounds, matching the centralized order. Across the 18 reported settings on MNIST and CIFAR-10, DSPGT has the lowest median residual.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.