On Sparsity by NUV-EM, Gaussian Message Passing, and Kalman Smoothing

February 08, 2016 Β· Declared Dead Β· πŸ› Information Theory and Applications Workshop

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hans-Andrea Loeliger, Lukas Bruderer, Hampus Malmberg, Federico Wadehn, Nour Zalmai arXiv ID 1602.02673 Category cs.IT: Information Theory Citations 50 Venue Information Theory and Applications Workshop Last Checked 5 months ago
Abstract
Normal priors with unknown variance (NUV) have long been known to promote sparsity and to blend well with parameter learning by expectation maximization (EM). In this paper, we advocate this approach for linear state space models for applications such as the estimation of impulsive signals, the detection of localized events, smoothing with occasional jumps in the state space, and the detection and removal of outliers. The actual computations boil down to multivariate-Gaussian message passing algorithms that are closely related to Kalman smoothing. We give improved tables of Gaussian-message computations from which such algorithms are easily synthesized, and we point out two preferred such algorithms.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted