6 citations · 12 across the 13 of their papers we have counts for
29 papers
Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, !
Edem Boahen, Simone Brugiapaglia, Hung-Hsu Chou +2
Motivated by applications such as sparse PCA, in this paper we present provably-accurate one-pass algorithms for the sparse approximation of the top eigenvectors of extremely massi…
High-Dimensional Confidence Regions in Sparse MRI
Frederik Hoppe, Felix Krahmer, Claudio Mayrink Verdun +2
One of the most promising solutions for uncertainty quantification in high-dimensional statistics is the debiased LASSO that relies on unconstrained -minimization. The init…
Uncertainty quantification for learned ISTA
Frederik Hoppe, Claudio Mayrink Verdun, Felix Krahmer +2
Model-based deep learning solutions to inverse problems have attracted increasing attention in recent years as they bridge state-of-the-art numerical performance with interpretabil…
Johnson-Lindenstrauss Embeddings with Kronecker Structure
Stefan Bamberger, Felix Krahmer, Rachel Ward
We prove the Johnson-Lindenstrauss property for matrices where has the restricted isometry property and is a diagonal matrix containing the entries of a Kronecker…
The Hanson-Wright Inequality for Random Tensors
Stefan Bamberger, Felix Krahmer, Rachel Ward
We provide moment bounds for expressions of the type where denotes the Kronecker pro…
Proof methods for robust low-rank matrix recovery
Tim Fuchs, David Gross, Peter Jung +3
Low-rank matrix recovery problems arise naturally as mathematical formulations of various inverse problems, such as matrix completion, blind deconvolution, and phase retrieval. Ove…