scholarly journals Dynamic Expectation Maximization Algorithm for Estimation of Linear Systems with Colored Noise

Entropy ◽  
2021 ◽  
Vol 23 (10) ◽  
pp. 1306
Author(s):  
Ajith Anil Meera ◽  
Martijn Wisse

The free energy principle from neuroscience has recently gained traction as one of the most prominent brain theories that can emulate the brain’s perception and action in a bio-inspired manner. This renders the theory with the potential to hold the key for general artificial intelligence. Leveraging this potential, this paper aims to bridge the gap between neuroscience and robotics by reformulating an FEP-based inference scheme—Dynamic Expectation Maximization—into an algorithm that can perform simultaneous state, input, parameter, and noise hyperparameter estimation of any stable linear state space system subjected to colored noises. The resulting estimator was proved to be of the form of an augmented coupled linear estimator. Using this mathematical formulation, we proved that the estimation steps have theoretical guarantees of convergence. The algorithm was rigorously tested in simulation on a wide variety of linear systems with colored noises. The paper concludes by demonstrating the superior performance of DEM for parameter estimation under colored noise in simulation, when compared to the state-of-the-art estimators like Sub Space method, Prediction Error Minimization (PEM), and Expectation Maximization (EM) algorithm. These results contribute to the applicability of DEM as a robust learning algorithm for safe robotic applications.

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Jiechang Wen ◽  
Dan Zhang ◽  
Yiu-ming Cheung ◽  
Hailin Liu ◽  
Xinge You

Within the learning framework of maximum weighted likelihood (MWL) proposed by Cheung, 2004 and 2005, this paper will develop a batch Rival Penalized Expectation-Maximization (RPEM) algorithm for density mixture clustering provided that all observations are available before the learning process. Compared to the adaptive RPEM algorithm in Cheung, 2004 and 2005, this batch RPEM need not assign the learning rate analogous to the Expectation-Maximization (EM) algorithm (Dempster et al., 1977), but still preserves the capability of automatic model selection. Further, the convergence speed of this batch RPEM is faster than the EM and the adaptive RPEM in general. The experiments show the superior performance of the proposed algorithm on the synthetic data and color image segmentation.


2005 ◽  
Vol 25 (1_suppl) ◽  
pp. S678-S678
Author(s):  
Yasuhiro Akazawa ◽  
Yasuhiro Katsura ◽  
Ryohei Matsuura ◽  
Piao Rishu ◽  
Ansar M D Ashik ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document