Efficient Identification of Butterfly Sparse Matrix Factorizations
From MaRDI portal
Publication:5885831
DOI10.1137/22M1488727OpenAlexW4213411191MaRDI QIDQ5885831
Elisa Riccietti, Unnamed Author, Rémi Gribonval
Publication date: 30 March 2023
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01230
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Every matrix is a product of Toeplitz matrices
- A mathematical introduction to compressive sensing
- Uniqueness conditions for low-rank matrix recovery
- A fast randomized algorithm for the approximation of matrices
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- The ubiquitous Kronecker product
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Robust and resource-efficient identification of two hidden layer neural networks
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- An algorithm for the rapid evaluation of special function transforms
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Sparse Signal Recovery from Quadratic Measurements via Convex Programming
- Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints
- Blind Deconvolution Using Convex Programming
- Identifiability in Bilinear Inverse Problems With Applications to Subspace or Sparsity-Constrained Blind Gain and Phase Calibration
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
- Self-calibration and biconvex compressive sensing
- Sparse and Redundant Representations
- A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators
- Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
- Multilinear Compressive Sensing and an Application to Convolutional Linear Networks
- Robust and resource efficient identification of shallow neural networks by fewest samples
- Butterfly Factorization
- Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
- Identifiability and Stability in Blind Deconvolution Under Minimal Assumptions
- The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
- Phase Retrieval via Matrix Completion
