Independent Vector Analysis via Log-Quadratically Penalized Quadratic Minimization
Robin Scheibler

TL;DR
This paper introduces a novel algorithm for blind source separation called AuxIVA-IPA, which improves convergence speed and success rate over existing methods by solving a new non-convex minimization problem efficiently.
Contribution
It proposes a new iterative projection method with a log-quadratically penalized quadratic minimization approach for IVA, including an efficient Newton-Raphson based solution.
Findings
Achieves faster convergence and higher success rate in synthetic experiments.
Demonstrates up to 8.5 times faster runtime in speech separation tasks.
Performs comparably to existing AuxIVA methods in BSS metrics.
Abstract
We propose a new algorithm for blind source separation (BSS) using independent vector analysis (IVA). This is an improvement over the popular auxiliary function based IVA (AuxIVA) with iterative projection (IP) or iterative source steering (ISS). We introduce iterative projection with adjustment (IPA), where we update one demixing filter and jointly adjust all the other sources along its current direction. Each update involves solving a non-convex minimization problem that we term log-quadratically penalized quadratic minimization (LQPQM), that we think is of interest beyond this work. In the general case, we show that its global minimum corresponds to the largest root of a univariate function, reminiscent of modified eigenvalue problems. We propose a simple procedure based on Newton-Raphson to efficiently compute it. Numerical experiments demonstrate the effectiveness of the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
