Skip to Main content Skip to Navigation
Conference papers

Gradient descent for resource allocation with packet loss

Renato Vizuete 1, 2 Paolo Frasca 2 Elena Panteley 1 
2 DANCE - Dynamics and Control of Networks
Inria Grenoble - Rhône-Alpes, GIPSA-PAD - GIPSA Pôle Automatique et Diagnostic
Abstract : This paper studies the effect of packet loss during the application of the weighted gradient descent to solve a resource allocation problem with piecewise quadratic cost functions in a multi-agent system. We define two performance metrics that measure, respectively, the deviation from the constraint and the error on the expected cost function. We derive upper bounds on both metrics: both bounds are proportional to the difference between the initial cost function and the cost function evaluated at the minimizer. Then, we extend the analysis of the constraint violation to open multi-agent systems where agents are replaced: based on a preliminary result and simulations we show that the combination of replacements and losses makes the constraint violation error diverge with time.
Complete list of metadata
Contributor : Renato Vizuete Connect in order to contact the contributor
Submitted on : Monday, June 27, 2022 - 8:36:23 AM
Last modification on : Tuesday, July 26, 2022 - 4:51:25 PM


Files produced by the author(s)


  • HAL Id : hal-03705202, version 1


Renato Vizuete, Paolo Frasca, Elena Panteley. Gradient descent for resource allocation with packet loss. NecSys 2022 - 9th IFAC Conference on Networked Systems, Jul 2022, Zurich, Switzerland. pp.1-5. ⟨hal-03705202⟩



Record views


Files downloads