arXiv (All)
open access
Noise-Robust Distributed Optimization Over Directed Graphs With Row Stochastic Matrices
In the presence of information-sharing noise, row-stochastic distributed optimization over directed and unbalanced graphs can suffer not only from noise accumulation in gradient tracking, but also from distortion of the left eigenvector-based gradient scaling used for imbalance compensation. To addr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distributed Time-Varying Optimization via Unbiased Extremum Seeking#972959
- An interacting particle consensus method for constrained global optimization#1117199
- Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers#187280
- dSTAR: Straggler Tolerant and Byzantine Resilient Distributed SGD#1035272
- Elastic consistency: A practical consistency model for distributed stochastic gradient descent#298622
Record · ID 1077410
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive