A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data
From MaRDI portal
Publication:5070506
DOI10.1137/21M1405769zbMath1490.62024OpenAlexW4225834014MaRDI QIDQ5070506
Publication date: 12 April 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1405769
Computational methods for problems pertaining to statistics (62-08) Computational methods for sparse matrices (65F50) Artificial neural networks and deep learning (68T07) Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Statistical aspects of big data and data science (62R07) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis
- Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Damped Anderson Acceleration With Restarts and Monotonicity Control for Accelerating EM and EM-like Algorithms
- Low rank approximation. Algorithms, implementation, applications
- The aspect Bernoulli model: multiple causes of presences and absences
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- EM algorithms for ML factor analysis
- An introduction to variational methods for graphical models
- Nonnegative low rank matrix approximation for nonnegative matrices
- Bayesian mean-parameterized nonnegative binary matrix factorization
- Matrix estimation by universal singular value thresholding
- Exact matrix completion via convex optimization
- A survey on deep matrix factorizations
- Generalized Low Rank Models
- A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
- Noisy Matrix Completion Under Sparse Factor Models
- Latent Variable Models and Factor Analysis
- Reducing the Dimensionality of Data with Neural Networks
- Randomized Algorithms for Matrices and Data
- Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation
- The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Parameter expansion to accelerate EM: the PX-EM algorithm
- Probabilistic Principal Component Analysis
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Non-convex Optimization for Machine Learning
- 10.1162/jmlr.2003.3.4-5.993
- Conjugate Gradient Acceleration of the EM Algorithm
- A Limited Memory Algorithm for Bound Constrained Optimization
- Nonnegative Matrix Factorization
- High-Dimensional Data Analysis with Low-Dimensional Models
- 1-Bit matrix completion
- Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
- Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
- Sparse Recovery and Dictionary Learning From Nonlinear Compressive Measurements
- Matrix Completion From a Few Entries
- Learning the parts of objects by non-negative matrix factorization
- Fast monte-carlo algorithms for finding low-rank approximations
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Bilinear Mixed-Effects Models for Dyadic Data
