On distributed averaging algorithms and quantization effects

Angelia Nedich, Alex Olshevsky, Asuman Ozdaglar, John N. Tsitsiklis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We study a large and natural class of averaging algorithms, which includes the vast majority of algorithms proposed to date, and provide tight polynomial bounds on their convergence time. We then propose and analyze distributed averaging algorithms under the additional constraint that agents can only store and communicate quantized information. We show that these algorithms converge to the average of the initial values of the agents within some error. We establish bounds on the error and tight bounds on the convergence time, as a function of the number of quantization levels.

Original languageEnglish (US)
Title of host publicationProceedings of the 47th IEEE Conference on Decision and Control, CDC 2008
Pages4825-4830
Number of pages6
DOIs
StatePublished - 2008
Externally publishedYes
Event47th IEEE Conference on Decision and Control, CDC 2008 - Cancun, Mexico
Duration: Dec 9 2008Dec 11 2008

Other

Other47th IEEE Conference on Decision and Control, CDC 2008
CountryMexico
CityCancun
Period12/9/0812/11/08

Fingerprint

Parallel algorithms
Averaging
Quantization
Convergence Time
Distributed Algorithms
Iterative Algorithm
Time-varying
Degradation
Topology
Polynomials
Converge
Polynomial

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

Nedich, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2008). On distributed averaging algorithms and quantization effects. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008 (pp. 4825-4830). [4738891] https://doi.org/10.1109/CDC.2008.4738891

On distributed averaging algorithms and quantization effects. / Nedich, Angelia; Olshevsky, Alex; Ozdaglar, Asuman; Tsitsiklis, John N.

Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. 2008. p. 4825-4830 4738891.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nedich, A, Olshevsky, A, Ozdaglar, A & Tsitsiklis, JN 2008, On distributed averaging algorithms and quantization effects. in Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008., 4738891, pp. 4825-4830, 47th IEEE Conference on Decision and Control, CDC 2008, Cancun, Mexico, 12/9/08. https://doi.org/10.1109/CDC.2008.4738891
Nedich A, Olshevsky A, Ozdaglar A, Tsitsiklis JN. On distributed averaging algorithms and quantization effects. In Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. 2008. p. 4825-4830. 4738891 https://doi.org/10.1109/CDC.2008.4738891
Nedich, Angelia ; Olshevsky, Alex ; Ozdaglar, Asuman ; Tsitsiklis, John N. / On distributed averaging algorithms and quantization effects. Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008. 2008. pp. 4825-4830
@inproceedings{e8dd7f88f64546fba9a2688080aac1aa,
title = "On distributed averaging algorithms and quantization effects",
abstract = "We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We study a large and natural class of averaging algorithms, which includes the vast majority of algorithms proposed to date, and provide tight polynomial bounds on their convergence time. We then propose and analyze distributed averaging algorithms under the additional constraint that agents can only store and communicate quantized information. We show that these algorithms converge to the average of the initial values of the agents within some error. We establish bounds on the error and tight bounds on the convergence time, as a function of the number of quantization levels.",
author = "Angelia Nedich and Alex Olshevsky and Asuman Ozdaglar and Tsitsiklis, {John N.}",
year = "2008",
doi = "10.1109/CDC.2008.4738891",
language = "English (US)",
isbn = "9781424431243",
pages = "4825--4830",
booktitle = "Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008",

}

TY - GEN

T1 - On distributed averaging algorithms and quantization effects

AU - Nedich, Angelia

AU - Olshevsky, Alex

AU - Ozdaglar, Asuman

AU - Tsitsiklis, John N.

PY - 2008

Y1 - 2008

N2 - We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We study a large and natural class of averaging algorithms, which includes the vast majority of algorithms proposed to date, and provide tight polynomial bounds on their convergence time. We then propose and analyze distributed averaging algorithms under the additional constraint that agents can only store and communicate quantized information. We show that these algorithms converge to the average of the initial values of the agents within some error. We establish bounds on the error and tight bounds on the convergence time, as a function of the number of quantization levels.

AB - We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We study a large and natural class of averaging algorithms, which includes the vast majority of algorithms proposed to date, and provide tight polynomial bounds on their convergence time. We then propose and analyze distributed averaging algorithms under the additional constraint that agents can only store and communicate quantized information. We show that these algorithms converge to the average of the initial values of the agents within some error. We establish bounds on the error and tight bounds on the convergence time, as a function of the number of quantization levels.

UR - http://www.scopus.com/inward/record.url?scp=62949158336&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62949158336&partnerID=8YFLogxK

U2 - 10.1109/CDC.2008.4738891

DO - 10.1109/CDC.2008.4738891

M3 - Conference contribution

AN - SCOPUS:62949158336

SN - 9781424431243

SP - 4825

EP - 4830

BT - Proceedings of the 47th IEEE Conference on Decision and Control, CDC 2008

ER -