Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any connected, directed or undirected graph. Unlike most previous gossip algorithms, Weighted Gossip admits stochastic update matrices which need not be doubly stochastic. Double-stochasticity being very restrictive in a distributed setting, this novel degree of freedom is essential and it opens the perspective of designing a large number of new gossip-based algorithms. To give an example, we present one of these algorithms, which we call One-Way Averaging. It is based on random geographic routing, just like Path Averaging, except that routes are one way instead of round trip. Hence in this example, getting rid of double stochasticity allows us to add robustness to Path Averaging.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As previously remarked, our protocol is a perturbation of the so-called 'push-sum' protocol for averaging studied in [1], [4], [10].”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [1]
Citations
Cites
Probability: Theory and Examples.
Prewitt, K., & Durrett, R. (1992) · Journal of the American Statistical Association · doi:10.2307/2290301 · Cited by 3,085
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
PROBABILITY: THEORY AND EXAMPLES
Rogers, L. C. G. (1992) · Bulletin of the London Mathematical Society · doi:10.1112/blms/24.2.205 · Cited by 1,435
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Odentrantz, J. (2000) · Technometrics · doi:10.1080/00401706.2000.10485734 · Cited by 973
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Brémaud, P. (1999) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-3124-8 · Cited by 781
Gossip algorithms: design, analysis and applications
Boyd, S., Ghosh, A., Prabbakar, B., & Shah, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498447 · Cited by 558
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031203 · Cited by 557
Self-citationProblems in Decentralized Decision making and Computation.
Tsitsiklis, J. N. (1984) · Defense Technical Information Center (DTIC) · Cited by 288
Self-citationConsensus Over Ergodic Stationary Graph Processes
Tahbaz-Salehi, A., & Jadbabaie, A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2034054 · Cited by 233
Cited by
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
Kia, S. S., Scoy, B. V., Cortés, J., Freeman, R. A., Lynch, K., & Martínez, S. (2019) · IEEE Control Systems · doi:10.1109/mcs.2019.2900783 · Cited by 449
Adaptation, Learning, and Optimization over Networks
Sayed, A. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781601988515 · Cited by 415
1Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed GraphsPreprint
Nedić, A., & Olshevsky, A. (2016) · Cited by 316
Push-Sum Distributed Dual Averaging for convex optimization
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426375 · Cited by 304
“In [11] convergence is proven for any graph based on weak ergodicity arguments.”
BackgroundDistributed Optimization for Control
Nedić, A., & Liu, J. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105131 · Cited by 302
A Distributed Algorithm for Solving a Linear Algebraic Equation
Mou, S., Liu, J., & Morse, A. S. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2414771 · Cited by 284
Average consensus on general strongly connected digraphs
Cai, K., & Ishii, H. (2012) · Automatica · doi:10.1016/j.automatica.2012.08.003 · Cited by 263
A Linear Algorithm for Optimization Over Directed Graphs With Geometric Convergence
Xin, R., & Khan, U. A. (2018) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2834316 · Cited by 243
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2012.6483403 · Cited by 223
Linear Convergence in Optimization Over Directed Graphs With Row-Stochastic Matrices
Xi, C., Mai, V. S., Xin, R., Abed, E. H., & Khan, U. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2797164 · Cited by 215
Nedic, A. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975210 · Cited by 211
Distributed Subgradient Projection Algorithm Over Directed Graphs
Xi, C., & Khan, U. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2615066 · Cited by 185
ADD-OPT: Accelerated Distributed Directed Optimization
Xi, C., Xin, R., & Khan, U. A. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2737582 · Cited by 181
Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
Nedić, A., & Olshevsky, A. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2529285 · Cited by 181
Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
Li, X., Yi, X., & Xie, L. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3021011 · Cited by 180
Decentralized optimal dispatch of distributed energy resources
Dominguez-Garcia, A. D., Cady, S. T., & Hadjicostis, C. N. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426665 · Cited by 177
DEXTRA: A Fast Algorithm for Optimization Over Directed Graphs
Xi, C., & Khan, U. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2672698 · Cited by 172
Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
Lou, Y., Hong, Y., Xie, L., Shi, G., & Johansson, K. H. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2504962 · Cited by 172
Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
Saadatniaki, F., Xin, R., & Khan, U. A. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2969721 · Cited by 172
Average Consensus in the Presence of Delays in Directed Graph Topologies
Hadjicostis, C. N., & Charalambous, T. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2275669 · Cited by 169
Privacy-Preserving Distributed Averaging via Homomorphically Encrypted Ratio Consensus
Hadjicostis, C. N., & Dominguez-Garcia, A. D. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2968876 · Cited by 159
A General Framework for Decentralized Optimization With First-Order Methods
Xin, R., Pu, S., Nedić, A., & Khan, U. A. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3024266 · Cited by 149
FROST—Fast row-stochastic optimization with uncoordinated step-sizes
Xin, R., Xi, C., & Khan, U. A. (2019) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-018-0596-y · Cited by 122
Distributed Optimization for Smart Cyber-Physical Networks
Notarstefano, G., Notarnicola, I., & Camisa, A. (2019) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000020 · Cited by 122
Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization
Scutari, G., & Sun, Y. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_3 · Cited by 121
Robust Distributed Average Consensus via Exchange of Running Sums
Hadjicostis, C. N., Vaidya, N. H., & Domínguez-García, A. D. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2471695 · Cited by 112
Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
Charalambous, T., Rabbat, M., Johansson, M., & Hadjicostis, C. N. (2015) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2428411 · Cited by 107
Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks
Nedić, A. (2015) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000004 · Cited by 105
Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
Cai, K., & Ishii, H. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2305952 · Cited by 104
Assran, M. S., & Rabbat, M. G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2981035 · Cited by 101
Resilient Networked Control of Distributed Energy Resources
Domínguez-García, A. D., Hadjicostis, C. N., & Vaidya, N. H. (2012) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2012.120711 · Cited by 100
Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
Lee, S., Nedić, A., & Raginsky, M. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2650563 · Cited by 100
A review of distributed optimization: Problems, models and algorithms
Zheng, Y., & Liu, Q. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.06.097 · Cited by 98
Distributed Optimal Dispatch of Distributed Energy Resources Over Lossy Communication Networks
Wu, J., Yang, T., Wu, D. X., Kalsi, K., & Johansson, K. H. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720761 · Cited by 89
Distributed Nesterov Gradient Methods Over Arbitrary Graphs
Xin, R., Jakovetić, D., & Khan, U. A. (2019) · IEEE Signal Processing Letters · doi:10.1109/lsp.2019.2925537 · Cited by 86
On the distributed optimization over directed networks
Xi, C., Wu, Q., & Khan, U. A. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.06.038 · Cited by 84
ExtraPush for Convex Smooth Decentralized Optimization over Directed Networks
Zeng, J., & Yin, W. (2017) · Journal of Computational Mathematics · doi:10.4208/jcm.1606-m2015-0452 · Cited by 82
Distributed Energy Resource Coordination Over Time-Varying Directed Communication Networks
Yang, T., Wu, D. X., Fang, H., Ren, W., Wang, H., Hong, Y., & Johansson, K. H. (2019) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2019.2921284 · Cited by 80
Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs
Vaidya, N. H. (2012) · Defense Technical Information Center (DTIC) · doi:10.21236/ada558910 · Cited by 78
Distributed strategies for average consensus in directed graphs
Domínguez-García, A. D., & Hadjicostis, C. N. (2011) · 2011 50th IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6160462 · Cited by 75
Distributed optimization over time-varying directed graphs
Nedic, A., & Olshevsky, A. (2013) · 52nd IEEE Conference on Decision and Control · doi:10.1109/cdc.2013.6760975 · Cited by 72
A Survey of Distributed Optimization Methods for Multi-Robot SystemsPreprint
Halsted, T., Shorinwa, O., Yu, J., & Schwager, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.12840 · Cited by 71
Second-Order Guarantees of Distributed Gradient Algorithms
Daneshmand, A., Scutari, G., & Kungurtsev, V. (2020) · SIAM Journal on Optimization · doi:10.1137/18m121784x · Cited by 68
Consensus seeking over directed networks with limited information communication
Li, D., Liu, Q., Wang, X., & Lin, Z. (2012) · Automatica · doi:10.1016/j.automatica.2012.11.041 · Cited by 67
Distributed Optimization Methods for Multi-Robot Systems: Part 2—A Survey
Shorinwa, O., Halsted, T., Yu, J., & Schwager, M. (2024) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2024.3352852 · Cited by 66
ExtraPush for convex smooth decentralized optimization over directed networks
Zeng, J., & Yin, W. (2015) · arXiv · doi:10.48550/arxiv.1511.02942 · Cited by 65
Spiridonoff, A., Olshevsky, A., & Paschalidis, I. C. (2018) · PubMed · doi:10.48550/arxiv.1811.03982 · Cited by 65
Stochastic Approximation for Consensus: A New Approach via Ergodic Backward Products
Huang, M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199149 · Cited by 62
Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
Silvestre, D., Hespanha, J. P., & Silvestre, C. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2018.2839341 · Cited by 62
Distributed Nash Equilibrium Seeking for Aggregative Games With Directed Communication Graphs
Fang, X., Wen, G., Zhou, J., Lü, J., & Chen, G. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3168770 · Cited by 57
Analysis of Sum-Weight-Like Algorithms for Averaging in Wireless Sensor Networks
Iutzeler, F., Ciblat, P., & Hachem, W. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2256904 · Cited by 55
Derivation and Analysis of the Primal-Dual Method of Multipliers Based on Monotone Operator Theory
Sherson, T., Heusdens, R. R., & Kleijn, W. B. (2018) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2018.2876754 · Cited by 54
Privacy-Preserving Average Consensus on Directed Graphs Using Push-Sum
Gao, H. B., Zhang, C., Ahmad, M., & Wang, Y. (2018) · IEEE Conference on Communications and Network Security · doi:10.1109/cns.2018.8433217 · Cited by 52
Multiagent Newton–Raphson Optimization Over Lossy Networks
Bof, N., Carli, R., Notarstefano, G., Schenato, L., & Varagnolo, D. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2874748 · Cited by 52
Jin, B., Li, H., Yan, W., & Cao, M. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3021528 · Cited by 47
Privacy-Preserving Average Consensus in Multiagent Systems via Partial Information Transmission
Zhang, J., Lu, J., Liang, J., & Shi, K. (2022) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2022.3220578 · Cited by 47
Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
Dixit, R., Bedi, A. S., & Rajawat, K. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3033712 · Cited by 47
Coordinate Dual Averaging for Decentralized Online Optimization With Nonseparable Global Objectives
Lee, S., Nedić, A., & Raginsky, M. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2016.2573639 · Cited by 46
Reaching approximate Byzantine consensus with multi-hop communication
Su, L., & Vaidya, N. H. (2016) · Information and Computation · doi:10.1016/j.ic.2016.12.003 · Cited by 44
DC-DistADMM: ADMM Algorithm for Constrained Optimization Over Directed Graphs
Khatana, V., & Salapaka, M. V. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3221856 · Cited by 44
Privary Preserving Distributed Average Consensus via Homomorphic Encryption
Hadjicostis, C. N. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619120 · Cited by 44
Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2014) · arXiv · doi:10.48550/arxiv.1406.2075 · Cited by 38
Robust average consensus over packet dropping links: Analysis via coefficients of ergodicity
Vaidya, N. H., Hadjicostis, C. N., & Domínguez-García, A. D. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426252 · Cited by 38
Local Interference Can Accelerate Gossip Algorithms
Nazer, B., Dimakis, A. G., & Gastpar, M. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2124440 · Cited by 37
Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
Rezaeinia, P., Gharesifard, B., Linder, T., & Touri, B. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2929206 · Cited by 36
Towards an Internet-like Power Grid
Kouveliotis-Lysikatos, I. N., Hatziargyriou, N. D., Liu, Y., & Wu, F. F. (2022) · Journal of Modern Power Systems and Clean Energy · doi:10.35833/mpce.2020.000154 · Cited by 35
Average consensus on general digraphs
Cai, K., & Ishii, H. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6160386 · Cited by 35
BlueFog: Make Decentralized Algorithms Practical for Optimization and Deep LearningPreprint
Ying, B., Yuan, K., Hu, H., Chen, Y., & Yin, W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04287 · Cited by 35
Asynchronous implementation of a distributed average consensus algorithm
Kriegleder, M., Oung, R., & D’Andrea, R. (2013) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2013.6696598 · Cited by 33
Carli, R., Notarstefano, G., Schenato, L., & Varagnolo, D. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402236 · Cited by 32
A Case of Distributed Optimization in Adversarial Environment
Ravi, N., Scaglione, A., & Nedić, A. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683442 · Cited by 32
Distributed stopping for average consensus in undirected graphs via event-triggered strategies
Manitara, N. E., & Hadjicostis, C. N. (2016) · Automatica · doi:10.1016/j.automatica.2016.03.030 · Cited by 31
Federated Adaptive Asynchronous Clustering Algorithm for Wireless Mesh Networks
Qiao, C., Brown, K. N., Zhang, F., & Tian, Z. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3119550 · Cited by 30
Algorithm-Level Confidentiality for Average Consensus on Time-Varying Directed Graphs
Gao, H. B., & Wang, Y. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3140274 · Cited by 30
Distributed Parameter Estimation With Quantized Communication via Running Average
Zhu, S., Soh, Y. C., & Xie, L. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2441034 · Cited by 30
On the Linear Convergence of Distributed Optimization over Directed Graphs
Xi, C., & Khan, U. A. (2015) · arXiv · doi:10.48550/arxiv.1510.02149 · Cited by 29
Average Consensus with Asynchronous Updates and Unreliable Communication
Bof, N., Carli, R., & Schenato, L. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.093 · Cited by 29
Asynchronous coordination of distributed energy resources for the provisioning of ancillary services
Hadjicostis, C. N., & Charalambous, T. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120345 · Cited by 29
Distributed Stopping for Average Consensus in Digraphs
Manitara, N. E., & Hadjicostis, C. N. (2017) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2660242 · Cited by 28
Average consensus in sensor networks via broadcast multi-gossip algorithms
Wang, H., Liao, X., & Huang, T. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.01.013 · Cited by 27
Asynchronous distributed averaging using double linear iterations
Liu, J., & Morse, A. S. (2012) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2012.6315266 · Cited by 26
Shi, X., Wang, Y., Song, S., & Yan, G. (2018) · International Journal of Systems Science · doi:10.1080/00207721.2018.1439124 · Cited by 26
Distributed Big-Data Optimization via Blockwise Gradient Tracking
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008713 · Cited by 26
Distributed Averaging Using Periodic Gossiping
Yu, C. B., Anderson, B. D. O., Mou, S., Liu, J., He, F., & Morse, A. S. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2688278 · Cited by 25
Network independent rates in distributed learning
Nedić, A., Olshevsky, A., & Uribe, C. A. (2016) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2016.7525057 · Cited by 24
Broadcast Gossip Ratio Consensus: Asynchronous Distributed Averaging in Strongly Connected Networks
Khosravi, A., & Kavian, Y. S. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2614790 · Cited by 24
Distributed TD(0) With Almost No Communication
Liu, R., & Olshevsky, A. (2023) · IEEE Control Systems Letters · doi:10.1109/lcsys.2023.3287952 · Cited by 23
Fast Coordination of Distributed Energy Resources Over Time-Varying Communication Networks
Zholbaryssov, M., Hadjicostis, C. N., & Domínguez-García, A. D. (2022) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2022.3213626 · Cited by 23
Push-Sum With Transmission Failures
Gerencsér, B. S., & Hendrickx, J. M. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2836861 · Cited by 22
Reaching Approximate Byzantine Consensus with Multi-hop Communication
Su, L., & Vaidya, N. H. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21741-3_2 · Cited by 21
Reachability of consensus and synchronizing automata
Chevalier, P.-Y., Hendrickx, J. M., & Jungers, R. M. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402864 · Cited by 21
Multi-Agent Control: A Graph-Theoretic Perspective
Chen, F., & Ren, W. (2021) · Journal of Systems Science and Complexity · doi:10.1007/s11424-021-1218-6 · Cited by 21
Directed-Distributed Gradient Descent
Xi, C., & Khan, U. A. (2015) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2015.7447120 · Cited by 21
The Impact of Communication Delays on Distributed Consensus AlgorithmsPreprint
Tsianos, K. I., & Rabbat, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.5839 · Cited by 21
On the Distributed Method of Multipliers for Separable Convex Optimization Problems
Sherson, T., Heusdens, R. R., & Kleijn, W. B. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2901649 · Cited by 20
Randomized Gradient-Free Distributed Online Optimization via a Dynamic Regret Analysis
Pang, Y., & Hu, G. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3237975 · Cited by 19
Metadata
- Authors
- Benezit, F., Blondel, V., Thiran, P., Tsitsiklis, J., & Vetterli, M.
- Affiliations
- École Polytechnique Fédérale de Lausanne (CH)
- Massachusetts Institute of Technology (US)
- Venue
- 2010 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 1753-1757
- OpenAlex
- W2135674292
- Cited by
- 224
- References
- 16
- Citations by year
- 2026: 3 · 2025: 5 · 2024: 11 · 2023: 9 · 2022: 12 · 2021: 14 · 2020: 15 · 2019: 20 · 2018: 26 · 2017: 16 · 2016: 17 · 2015: 17 · 2014: 16 · 2013: 11 · 2012: 24
- FWCI
- 12.40
- Type
- conference paper
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- cc-by-nc
- Locations
- IEEE International Symposium on Information Theory (ISIT) (publishedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- Funders
- National Science Foundation (0701623)
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (67322)
- Division of Electrical, Communications and Cyber Systems
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Physical Sciences › Computer Science › Signal Processing › Advanced Adaptive Filtering Techniques
- Keywords
- distributed averaging, directed graphs, convergence
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.