Chain-Linked Multiple Matrix Integration via Embedding Alignment
From MaRDI portal
Cites work
- A generalized solution of the orthogonal Procrustes problem
- A simpler approach to matrix completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Asymptotic theory for estimating the singular vectors and values of a partially-observed low rank matrix with noise
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Eigenvalue ratio test for the number of factors
- Entrywise eigenvector analysis of random matrices with low expected rank
- Guaranteed Matrix Completion via Non-Convex Factorization
- scientific article; zbMATH DE number 6276219 (Why is no real title available?)
- Inference and uncertainty quantification for noisy matrix completion
- Integrating omics data
- Low-rank matrix completion by Riemannian optimization
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Matrix completion and low-rank SVD via fast alternating least squares
- Matrix completion via max-norm constrained optimization
- Matrix estimation by universal singular value thresholding
- Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,∞ Regularization
- Normalized iterative hard thresholding for matrix completion
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Spectral regularization algorithms for learning large incomplete matrices
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Universal rank inference via residual subsampling with application to large networks
This page was built for publication: Chain-Linked Multiple Matrix Integration via Embedding Alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7320037)
