Journal article
Practical interactive scheme for extremum computation in distributed networks
Proceedings / IEEE International Symposium on Information Theory, v 2016-, pp 1088-1092
01 Jul 2016
Abstract
Several users observing independent random variables exchange error-free messages with one another and a central receiver, the central estimation officer (CEO), with the aim of enabling the CEO to compute either the maximum across users (the max), or a a user attaining this maximum (the arg max) for each element of their local observation sequences. The fundamental lower bound on the information exchange rate required over all quantization schemes, both scalar and vector, is computed for this interactive problem with a known iterative convex geometric method. Next, an optimal dynamic program achieving the minimum expected rate and expected rate delay tradeoff over all scalar quantization schemes is presented, and the benefits of enabling users to overhear each others' messages is assessed. Finally, a series of substantially reduced complexity dynamic programs are shown, both theoretically and empirically, to obtain performance close to the fundamental limits, and to scale favorably as the number of users grow.
Metrics
4 Record Views
Details
- Title
- Practical interactive scheme for extremum computation in distributed networks
- Creators
- Solmaz Torabi - Drexel UniversityJie Ren - Drexel UniversityJohn Walsh - Drexel University
- Publication Details
- Proceedings / IEEE International Symposium on Information Theory, v 2016-, pp 1088-1092
- Publisher
- The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Scopus ID
- 2-s2.0-84985995833
- Other Identifier
- 9781509018062; 1509018069; 991019170477504721