Distributed Bayesian Estimation in Sensor Networks: Consensus on Marginal Densities

In this paper, we design and analyze distributed Bayesian estimation algorithms for sensor networks. We consider estimation problems, such as cooperative localization and federated learning, where the data collected at any agent depends on a subset of all variables of interest. We provide a unified formulation of centralized, distributed and marginal probabilistic estimation as a Bayesian density estimation problem using data from non-linear likelihoods at agent. We develop distributed estimation algorithms based on stochastic mirror descent with appropriate regularization to enforce distributed or marginal density constraints. We prove almost-sure convergence to the optimal set of probabilities at each agent in both the distributed and marginal settings. Finally, we present Gaussian density versions of these algorithms and compare them to belief propagation variants in a node localization problem with relative position measurements. We also demonstrate our algorithms in a multi-agent mapping problem using LiDAR data.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-03-28
DOI
https://doi.org/10.1109/tnse.2025.3554729
Primary Topic
Distributed Sensor Networks and Detection Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Bayesian Estimation in Sensor Networks: Consensus on Marginal Densities

Sonia Martı́nez, Nikolay Atanasov, Parth Paritosh
IEEE Transactions on Network Science and Engineering
Distributed Sensor Networks and Detection Algorithms
article

Distributed Bayesian Estimation in Sensor Networks: Consensus on Marginal Densities

Sonia Martı́nez, Nikolay Atanasov, Parth Paritosh
article en

Abstract

In this paper, we design and analyze distributed Bayesian estimation algorithms for sensor networks. We consider estimation problems, such as cooperative localization and federated learning, where the data collected at any agent depends on a subset of all variables of interest. We provide a unified formulation of centralized, distributed and marginal probabilistic estimation as a Bayesian density estimation problem using data from non-linear likelihoods at agent. We develop distributed estimation algorithms based on stochastic mirror descent with appropriate regularization to enforce distributed or marginal density constraints. We prove almost-sure convergence to the optimal set of probabilities at each agent in both the distributed and marginal settings. Finally, we present Gaussian density versions of these algorithms and compare them to belief propagation variants in a node localization problem with relative position measurements. We also demonstrate our algorithms in a multi-agent mapping problem using LiDAR data.

IEEE Transactions on Network Science and EngineeringVol. 12(4)
University of California San Diego (US), Contextual Change (United States) (US)
Openalex Percentile: Top 95%
Distributed Sensor Networks and Detection Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.