Skip to Main content Skip to Navigation
Journal articles

Robust distributed consensus using total Variation

Abstract : Consider a connected network of agents endowed with local cost functions representing private objectives. Agents seek to find an agreement on some minimizer of the aggregate cost, by means of repeated communications between neighbors. Consensus on the average over the network, usually addressed by gossip algorithms, is a special instance of this problem, corresponding to quadratic private objectives. Consensus on the median, or more generally, consensus on a given quantile, is also a special instance of this problem. In this paper we show that optimizing the aggregate cost function regularized by a total variation (TV) term has appealing properties. First, it can be done very naturally in a distributed way, yielding algorithms that are efficient on numerical simulations. Secondly, the optimum for the regularized cost is shown to be also the optimum for the initial aggregate cost function under assumptions that are simple to state. Finally, these algorithms are robust to unreliable agents that keep injecting some false value in the network. This is remarkable enough, and is not the case, for instance, of gossip algorithms that are entirely ruled by unreliable agents as detailed in the paper
Document type :
Journal articles
Complete list of metadatas
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Thursday, January 21, 2016 - 10:32:23 AM
Last modification on : Wednesday, October 14, 2020 - 1:25:58 PM



Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz. Robust distributed consensus using total Variation. IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2016, 61 (6), pp.1550 - 1564. ⟨10.1109/TAC.2015.2471755⟩. ⟨hal-01259850⟩



Record views