Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary

DOI10.3150/24-BEJ1724MaRDI QIDQ6632601zbMATH OpenFDO

Authors Cristina Butucea, Jean-François Delmas, Anne Dutfoy, Clément Hardy

Publication date 5 November 2024

Published in Bernoulli (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3150/24-BEJ1724

zbMATH Keywords

continuous dictionarygroup-nonlinear-lassointerpolating certificatesmixture modelmulti-task learningnonlinear regression modeloff-the-grid methodssimultaneous recoverysparse spike deconvolution

Mathematics Subject Classification ID

Diagnostics, and linear inference and regression (62J20) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• The sample complexity of dictionary learning
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Supermix: sparse regularization for mixtures
• Learning: Wavelet-dictionaries and continuous dictionaries.
• Oracle inequalities and optimal inference under group sparsity

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Probabilistic and RIPless Theory of Compressed Sensing
• Adapting to unknown noise level in sparse deconvolution
• An Epigraphical Approach to the Representer Theorem
• An off-the-grid approach to multi-compartment magnetic resonance fingerprinting
• Atomic Norm Denoising With Applications to Line Spectral Estimation
• Consistency of the group Lasso and multiple kernel learning
• Exact reconstruction using Beurling minimal extrapolation
• Exact support recovery for sparse spikes deconvolution
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Level Sets and Extrema of Random Processes and Fields
• Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
• Model Selection and Estimation in Regression with Grouped Variables
• Near Minimax Line Spectral Estimation
• On representer theorems and convex regularization
• On the asymptotic properties of the group lasso estimator for linear models
• On the conditions used to prove oracle results for the Lasso
• Oracle inequalities and optimal inference under group sparsity
• Simultaneous analysis of Lasso and Dantzig selector
• Some theoretical results on the grouped variables Lasso
• Sparse optimization on measures with over-parameterized gradient descent
• Sparse regularization on thin grids. I: The \textsc{Lasso}.
• Sparsity oracle inequalities for the Lasso
• Statistics for high-dimensional data. Methods, theory and applications.
• Super-resolution from noisy data
• The alternating descent conditional gradient method for sparse inverse problems
• The benefit of group sparsity
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• The function-on-scalar LASSO with applications to longitudinal GWAS
• The geometry of off-the-grid compressed sensing
• The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
• Towards a Mathematical Theory of Super‐resolution

This page was built for publication: Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632601)