@InProceedings{6952272,
  author = {S. Kar and J. M. F. Moura},
  booktitle = {2014 22nd European Signal Processing Conference (EUSIPCO)},
  title = {Distributed parameter estimation with exponential family statistics: Asymptotic efficiency},
  year = {2014},
  pages = {865-869},
  abstract = {This paper studies the problem of distributed parameter estimation in multi-agent networks with exponential family observation statistics. Conforming to a given inter-agent communication topology, a distributed recursive estimator of the consensus-plus-innovations type is presented in which at every observation sampling epoch the network agents exchange a single round of messages with their communication neighbors and recursively update their local parameter estimates by simultaneously processing the received neighborhood data and the new information (innovation) embedded in the observation sample. Under global observability of the networked sensing model and mean connectivity of the inter-agent communication network, the proposed estimator is shown to yield consistent parameter estimates at each network agent. Furthermore, it is shown that the distributed estimator is asymptotically efficient, in that, the asymptotic covariances of the agent estimates coincide with that of the optimal centralized estimator, i.e., the inverse of the centralized Fisher information rate.},
  keywords = {directed graphs;multi-agent systems;network theory (graphs);recursive estimation;statistical analysis;asymptotic efficiency;distributed parameter estimation problem;multiagent networks;exponential family observation statistics;inter-agent communication topology;distributed recursive estimator;consensus-plus-innovations type;observation sampling epoch;communication neighbors;received neighborhood data processing;global observability;networked sensing model;inter-agent communication network;asymptotic covariances;optimal centralized estimator;centralized Fisher information rate;Estimation;Sensors;Parameter estimation;Technological innovation;Stochastic processes;Observability;Optimization;Multi-agent networks;distributed estimation;exponential family;collaborative network processing;consensus;stochastic aproximation},
  issn = {2076-1465},
  month = {Sep.},
  url = {https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926713.pdf},
}

{"_id":"AoYhLkYKANJKq4ayd","bibbaseid":"kar-moura-distributedparameterestimationwithexponentialfamilystatisticsasymptoticefficiency-2014","authorIDs":[],"author_short":["Kar, S.","Moura, J. M. F."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Kar"],"suffixes":[]},{"firstnames":["J.","M.","F."],"propositions":[],"lastnames":["Moura"],"suffixes":[]}],"booktitle":"2014 22nd European Signal Processing Conference (EUSIPCO)","title":"Distributed parameter estimation with exponential family statistics: Asymptotic efficiency","year":"2014","pages":"865-869","abstract":"This paper studies the problem of distributed parameter estimation in multi-agent networks with exponential family observation statistics. Conforming to a given inter-agent communication topology, a distributed recursive estimator of the consensus-plus-innovations type is presented in which at every observation sampling epoch the network agents exchange a single round of messages with their communication neighbors and recursively update their local parameter estimates by simultaneously processing the received neighborhood data and the new information (innovation) embedded in the observation sample. Under global observability of the networked sensing model and mean connectivity of the inter-agent communication network, the proposed estimator is shown to yield consistent parameter estimates at each network agent. Furthermore, it is shown that the distributed estimator is asymptotically efficient, in that, the asymptotic covariances of the agent estimates coincide with that of the optimal centralized estimator, i.e., the inverse of the centralized Fisher information rate.","keywords":"directed graphs;multi-agent systems;network theory (graphs);recursive estimation;statistical analysis;asymptotic efficiency;distributed parameter estimation problem;multiagent networks;exponential family observation statistics;inter-agent communication topology;distributed recursive estimator;consensus-plus-innovations type;observation sampling epoch;communication neighbors;received neighborhood data processing;global observability;networked sensing model;inter-agent communication network;asymptotic covariances;optimal centralized estimator;centralized Fisher information rate;Estimation;Sensors;Parameter estimation;Technological innovation;Stochastic processes;Observability;Optimization;Multi-agent networks;distributed estimation;exponential family;collaborative network processing;consensus;stochastic aproximation","issn":"2076-1465","month":"Sep.","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926713.pdf","bibtex":"@InProceedings{6952272,\n author = {S. Kar and J. M. F. Moura},\n booktitle = {2014 22nd European Signal Processing Conference (EUSIPCO)},\n title = {Distributed parameter estimation with exponential family statistics: Asymptotic efficiency},\n year = {2014},\n pages = {865-869},\n abstract = {This paper studies the problem of distributed parameter estimation in multi-agent networks with exponential family observation statistics. Conforming to a given inter-agent communication topology, a distributed recursive estimator of the consensus-plus-innovations type is presented in which at every observation sampling epoch the network agents exchange a single round of messages with their communication neighbors and recursively update their local parameter estimates by simultaneously processing the received neighborhood data and the new information (innovation) embedded in the observation sample. Under global observability of the networked sensing model and mean connectivity of the inter-agent communication network, the proposed estimator is shown to yield consistent parameter estimates at each network agent. Furthermore, it is shown that the distributed estimator is asymptotically efficient, in that, the asymptotic covariances of the agent estimates coincide with that of the optimal centralized estimator, i.e., the inverse of the centralized Fisher information rate.},\n keywords = {directed graphs;multi-agent systems;network theory (graphs);recursive estimation;statistical analysis;asymptotic efficiency;distributed parameter estimation problem;multiagent networks;exponential family observation statistics;inter-agent communication topology;distributed recursive estimator;consensus-plus-innovations type;observation sampling epoch;communication neighbors;received neighborhood data processing;global observability;networked sensing model;inter-agent communication network;asymptotic covariances;optimal centralized estimator;centralized Fisher information rate;Estimation;Sensors;Parameter estimation;Technological innovation;Stochastic processes;Observability;Optimization;Multi-agent networks;distributed estimation;exponential family;collaborative network processing;consensus;stochastic aproximation},\n issn = {2076-1465},\n month = {Sep.},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926713.pdf},\n}\n\n","author_short":["Kar, S.","Moura, J. M. F."],"key":"6952272","id":"6952272","bibbaseid":"kar-moura-distributedparameterestimationwithexponentialfamilystatisticsasymptoticefficiency-2014","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2014/html/papers/1569926713.pdf"},"keyword":["directed graphs;multi-agent systems;network theory (graphs);recursive estimation;statistical analysis;asymptotic efficiency;distributed parameter estimation problem;multiagent networks;exponential family observation statistics;inter-agent communication topology;distributed recursive estimator;consensus-plus-innovations type;observation sampling epoch;communication neighbors;received neighborhood data processing;global observability;networked sensing model;inter-agent communication network;asymptotic covariances;optimal centralized estimator;centralized Fisher information rate;Estimation;Sensors;Parameter estimation;Technological innovation;Stochastic processes;Observability;Optimization;Multi-agent networks;distributed estimation;exponential family;collaborative network processing;consensus;stochastic aproximation"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2014url.bib","creationDate":"2021-02-13T17:43:41.639Z","downloads":0,"keywords":["directed graphs;multi-agent systems;network theory (graphs);recursive estimation;statistical analysis;asymptotic efficiency;distributed parameter estimation problem;multiagent networks;exponential family observation statistics;inter-agent communication topology;distributed recursive estimator;consensus-plus-innovations type;observation sampling epoch;communication neighbors;received neighborhood data processing;global observability;networked sensing model;inter-agent communication network;asymptotic covariances;optimal centralized estimator;centralized fisher information rate;estimation;sensors;parameter estimation;technological innovation;stochastic processes;observability;optimization;multi-agent networks;distributed estimation;exponential family;collaborative network processing;consensus;stochastic aproximation"],"search_terms":["distributed","parameter","estimation","exponential","family","statistics","asymptotic","efficiency","kar","moura"],"title":"Distributed parameter estimation with exponential family statistics: Asymptotic efficiency","year":2014,"dataSources":["A2ezyFL6GG6na7bbs","oZFG3eQZPXnykPgnE"]}