COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Signal Processing and Communications Lab Seminars > On optimal sampling in off-the-grid sparse regularisation.
On optimal sampling in off-the-grid sparse regularisation.Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Prof. Ramji Venkataramanan. Sparse regularization is a central technique for both machine learning and imaging sciences. Existing performance guarantees assume a separation of the spikes based on an ad-hoc (usually Euclidean) minimum distance condition, which ignore the geometry of the problem. In this talk, we study the BLASSO (i.e. the off-the-grid version of L1 LASSO regularization) and show that the Fisher-Rao distance is the natural way to ensure and quantify support recovery. Under a separation imposed by this distance, I will present results which show that stable recovery of a sparse measure can be achieved when the sampling complexity is (up to log factors) linear with sparsity. On deconvolution problems, which are translation invariant, this generalizes to the multi-dimensional setting existing results of the literature. For more complex translation-varying problems, such as Laplace transform inversion, this gives the first geometry-aware guarantees for sparse recovery. This is joint work with Nicolas Keriven and Gabriel Peyre. This talk is part of the Signal Processing and Communications Lab Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsSustainability in the Built Environment (GreenBRIDGE) Cambridge Rare Earths SocietyOther talksEscape from pluripotency Asteroseismology as a tool for astrophysics: from the deep interiors of stars to the evolution of the Milky Way Categorical Data Analysis Babraham Distinguished Lecture - Antisense-mediated chromatin silencing |