2000 character limit reached
Heuristics for Efficient Sparse Blind Source Separation (1812.06737v1)
Published 17 Dec 2018 in cs.LG, astro-ph.IM, eess.SP, and stat.ML
Abstract: Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization problem, its performances largely depend on the optimization strategy. In this context, Proximal Alternating Linearized Minimization (PALM) has become a standard algorithm which, despite its theoretical grounding, generally provides poor practical separation results. In this work, we propose a novel strategy that combines a heuristic approach with PALM. We show its relevance on realistic astrophysical data.