bibtype M - Monography Chapter
ARLID 0493396
utime 20240103220501.8
mtime 20180917235959.9
WOS 000488278200005
DOI 10.1016/B978-0-12-813677-5.00004-3
title (primary) (eng) Bayesian approach to collaborative inference in networks of agents
specification
book_pages 837
page_count 15 s.
media_type P
serial
ARLID cav_un_epca*0493395
ISBN 978-0-12-813677-5
title Cooperative and graph signal processing
page_num 131-145
publisher
place London
name Academic Press
year 2018
editor
name1 Djurić
name2 Petar M.
editor
name1 Richard
name2 Cédric
keyword Distributed estimation
keyword diffusion network
keyword information diffusion
author (primary)
ARLID cav_un_auth*0242543
name1 Dedecius
name2 Kamil
institution UTIA-B
full_dept (cz) Adaptivní systémy
full_dept (eng) Department of Adaptive Systems
department (cz) AS
department (eng) AS
full_dept Department of Adaptive Systems
country CZ
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0306051
name1 Djurić
name2 P. M.
country US
source
url http://library.utia.cas.cz/separaty/2018/AS/dedecius-0493396.pdf
cas_special
project
ARLID cav_un_auth*0331019
project_id GA16-09848S
agency GA ČR
abstract (eng) Bayesian inference has become a standard tool in the modern statistical signal processing theory, particularly due to the probabilistically consistent representation of the available knowledge about the variables of interest, and the amount of the uncertainty contained in this knowledge. Unlike in the 'standard' theory, the underlying inferential principles are generally applicable to virtually any inference task, from linear models to nonlinear, mixture, or hierarchical models. Furthermore, the rapid development of the modern devices with high computational performance finally eliminated the major drawback of the Bayesian theory: the frequent analytical intractability of the posterior distributions. This chapter studies the possible implementation of the Bayesian inference in networks of collaborating agents. In particular, we focus on the diffusion networks, where the agents may share information (measurements and/or estimates) with their adjacent neighbors, and incorporate it into own knowledge about the unknown variables of interest. There are several ways how to perform this incorporation in an optimal way according to a convenient user-selected information criterion, and under certain conditions where the model belongs to the exponential family of distributions and the prior distributions are conjugate, the results are analytically tractable. The celebrated Kalman filter serves as an illustrative example demonstrating the straightforward application of the abstractly described principles to a particular problem. It is reformulated for the collaborative estimation task in networks where both the neighbors' observations and posterior distributions are available to each agent. Naturally, the analyticity of the resulting filter is preserved.
RIV BC
FORD0 20000
FORD1 20200
FORD2 20205
reportyear 2019
num_of_auth 2
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0286994
confidential S
mrcbC86 3+4 Article Computer Science Artificial Intelligence|Computer Science Theory Methods
arlyear 2018
mrcbU14 SCOPUS
mrcbU24 PUBMED
mrcbU34 000488278200005 WOS
mrcbU63 cav_un_epca*0493395 Cooperative and graph signal processing Academic Press 2018 London 131 145 978-0-12-813677-5
mrcbU67 340 Djurić Petar M.
mrcbU67 340 Richard Cédric