Distributed Maximum Likelihood using Dynamic Average Consensus
Optimization and Control
2018-03-09 v1
Abstract
This paper presents the formulation and analysis of a novel distributed maximum likelihood algorithm that utilizes a first-order optimization scheme. The proposed approach utilizes a static average consensus algorithm to reach agreement on the initial condition to the iterative optimization scheme and a dynamic average consensus algorithm to reach agreement on the gradient direction. The current distributed algorithm is guaranteed to exponentially recover the performance of the centralized algorithm. Though the current formulation focuses on maximum likelihood algorithm built on first-order methods, it can be easily extended to higher order methods. Numerical simulations validate the theoretical contributions of the paper.
Cite
@article{arxiv.1803.03224,
title = {Distributed Maximum Likelihood using Dynamic Average Consensus},
author = {Jemin George},
journal= {arXiv preprint arXiv:1803.03224},
year = {2018}
}