# Decentralized Optimization over Time-Varying Row-Stochastic Digraphs

arXiv: https://arxiv.org/abs/2512.24483 · HTML: https://mlsanity.com/paper/2512.24483/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Dec 2025.

## Built on by (most cited first, 1 of 1)

- [ProofLoom: Proof-Obligation-Driven Theory Construction for Autoformalizing Research-Level Stochastic Optimization](https://mlsanity.com/paper/2609.34960/) (2026)

## Abstract (arXiv)

Decentralized optimization over directed graphs is essential for applications such as robotic swarms, sensor networks, and distributed learning. In many practical scenarios, the underlying network takes the form of a Time-Varying Broadcast Network (TVBN), where only row-stochastic mixing matrices can be constructed due to the unavailability of out-degree information. Achieving exact convergence for decentralized optimization over TVBNs has remained a long-standing open problem, as the limiting distribution of time-varying row-stochastic mixing matrices depends on unpredictable future graph realizations, rendering standard bias-correction techniques infeasible. This paper develops the first decentralized optimization algorithm that achieves exact convergence using only time-varying row-stochastic matrices. We first propose PULM (Pull-with-Memory), a gossip protocol that achieves average consensus with exponential convergence by alternating between row-stochastic mixing and local adjustment steps. Building on PULM, we develop PULM-DGD, which converges to a stationary solution at a rate of O(ln(T)/T) for smooth nonconvex objectives, where T denotes the communication round. Our results significantly broaden the applicability of decentralized optimization to highly dynamic communication environments.