A local-training algorithm for nonconvex distributed optimization achieves communication efficiency and differential privacy via gradient clipping plus additive noise, with proven convergence to a stationary point within bounded distance and formal privacy guarantees.
Combining graph attention networks and distributed optimization for multi-robot mixed- integer convex programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
Communication-Efficient Distributed Learning with Differential Privacy
A local-training algorithm for nonconvex distributed optimization achieves communication efficiency and differential privacy via gradient clipping plus additive noise, with proven convergence to a stationary point within bounded distance and formal privacy guarantees.