This paper addresses the distributed computation of exact, nonasymptotic confidence regions for the parameter estimation of a linear model from observations at different nodes of a network of sensors. If a central unit gathers all the data, the sign perturbed sums (SPS) method proposed by Csáji et al. can be used to define guaranteed confidence regions with prescribed confidence levels from a finite number of measurements. SPS requires only mild assumptions on the measurement noise. This work proposes distributed solutions, based on SPS and suited to a wide variety of sensor networks, for distributed in-node evaluation of nonasymptotic confidence regions as defined by SPS. More specifically, a tagged and aggregated sum information diffusion algorithm is introduced, which exploits the specificities of SPS to avoid flooding the network with all measurements provided by the sensors. The performance of the proposed solutions is evaluated in terms of required traffic load, both analytically and experimentally on different network topologies. The best information diffusion strategy among nodes depends on how structured the network is.

Distributed Nonasymptotic Confidence Region Computation over Sensor Networks

Zambianchi, Vincenzo;Calisti, Alex;Dardari, Davide;Pasolini, Gianni
2018

Abstract

This paper addresses the distributed computation of exact, nonasymptotic confidence regions for the parameter estimation of a linear model from observations at different nodes of a network of sensors. If a central unit gathers all the data, the sign perturbed sums (SPS) method proposed by Csáji et al. can be used to define guaranteed confidence regions with prescribed confidence levels from a finite number of measurements. SPS requires only mild assumptions on the measurement noise. This work proposes distributed solutions, based on SPS and suited to a wide variety of sensor networks, for distributed in-node evaluation of nonasymptotic confidence regions as defined by SPS. More specifically, a tagged and aggregated sum information diffusion algorithm is introduced, which exploits the specificities of SPS to avoid flooding the network with all measurements provided by the sensors. The performance of the proposed solutions is evaluated in terms of required traffic load, both analytically and experimentally on different network topologies. The best information diffusion strategy among nodes depends on how structured the network is.
Zambianchi, Vincenzo; Bassi, Francesca; Calisti, Alex; Dardari, Davide; Kieffer, Michel; Pasolini, Gianni*
File in questo prodotto:
File Dimensione Formato  
TSIPN2017.pdf

embargo fino al 18/10/2017

Tipo: Postprint
Licenza: Licenza per accesso libero gratuito
Dimensione 719.68 kB
Formato Adobe PDF
719.68 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/667527
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 3
social impact