Efficient Identification of Butterfly Sparse Matrix Factorizations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 1390107 (Why is no real title available?)
- A fast butterfly algorithm for the computation of Fourier integral operators
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- A fast randomized algorithm for the approximation of matrices
- A mathematical introduction to compressive sensing
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An algorithm for the rapid evaluation of special function transforms
- Blind Deconvolution Using Convex Programming
- Butterfly factorization
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
- Every matrix is a product of Toeplitz matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Identifiability and Stability in Blind Deconvolution Under Minimal Assumptions
- Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration
- Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints
- Lifting for blind deconvolution in random mask imaging: identifiability and convex relaxation
- Multilinear compressive sensing and an application to convolutional linear networks
- Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
- Phase retrieval via matrix completion
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Robust and resource efficient identification of shallow neural networks by fewest samples
- Robust and resource-efficient identification of two hidden layer neural networks
- Self-calibration and biconvex compressive sensing
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse signal recovery from quadratic measurements via convex programming
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- The algebraic combinatorial approach for low-rank matrix completion
- The ubiquitous Kronecker product
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Uniqueness conditions for low-rank matrix recovery
Cited in
(3)
This page was built for publication: Efficient Identification of Butterfly Sparse Matrix Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885831)
