2000 character limit reached
Formulating Beurling LASSO for Source Separation via Proximal Gradient Iteration (2202.08082v1)
Published 16 Feb 2022 in eess.SP, cs.IR, math.FA, and math.OC
Abstract: Beurling LASSO generalizes the LASSO problem to finite Radon measures regularized via their total variation. Despite its theoretical appeal, this space is hard to parametrize, which poses an algorithmic challenge. We propose a formulation of continuous convolutional source separation with Beurling LASSO that avoids the explicit computation of the measures and instead employs the duality transform of the proximal mapping.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.