Multiplicative Updating Rule for Blind Separation Derived from the Method of Scoring
Lists
Only you see this
Abstract
For blind source separation, when the Fisher information matrix is used as the Riemannian metric tensor for the parameter space, the steepest descent algorithm to maximize the likelihood function in this Riemannian parameter space becomes the serial updating rule with equivariant property. This algorithm can be further simplified by using the asymptotic form of the Fisher information matrix around the equilibrium.
BibTeX
@inproceedings{yang1997multiplicative,
author = {Howard H. Yang},
title = {{Multiplicative Updating Rule for Blind Separation Derived from the Method of Scoring}},
booktitle = {Advances in Neural Information Processing Systems},
year = {1997},
}Loading related content...