Sign inGet started
Paper · arXiv

A Gated Graph Neural Network Approach to Fast-Convergent Dynamic Average Estimation

Dynamic average estimation is a critical problem in multi-agent systems, enabling agents to collaboratively estimate time-varying signals using only local information exchange. Traditional model-based approaches often face challenges related to convergence speed and sensitivity to network topology changes. This paper introduces a novel learning-based solution leveraging Gated Graph Neural Networks (GGNNs) for fast-convergent dynamic average estimation in a fully distributed manner. Taking advantage of the inherent structure of GGNNs, the proposed method models the estimation process as a distributed autoregressor, ensuring rapid convergence while maintaining stability. We incorporate a re...

AuthorsAntonio Marino, Claudio Pacchierotti, Paolo Robuffo Giordano
Primary categorycs.LG
Published18 June 2026
Last updated at source18 June 2026
cs.LGcs.RO
Embed this entry
<iframe src="https://silytics.si/embed/item/e699ca47-8984-479d-80ea-390d1d66cb8a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.