Finding tensor decompositions with sparse optimization
From MaRDI portal
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A new formula for the determinant and bounds on its tensor and Waring ranks
- An improved upper bound for the Waring rank of the determinant
- Dictionary Learning Algorithms for Sparse Representation
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Discovering governing equations from data by sparse identification of nonlinear dynamical systems
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Gaussian elimination is not optimal
- Geometry and complexity theory
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Linear Inversion of Band-Limited Reflection Seismograms
- On the nuclear norm and the singular value decomposition of tensors
- On the rank of a symmetric form
- On the tensor rank of the \(3 \times 3\) permanent and determinant
- Online learning for matrix factorization and sparse coding
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Sparse identification of nonlinear dynamics for model predictive control in the low-data limit
- Tensor analysis. Spectral theory and special tensors
- Tensor Decompositions and Applications
- The expression of a tensor or a polyadic as a sum of products.
- The Hitchhiker guide to: secant varieties and tensor decomposition
This page was built for publication: Finding tensor decompositions with sparse optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030527)
