Riemannian gradient descent methods for graph-regularized matrix completion
From MaRDI portal
Recommendations
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- Low-rank matrix completion by Riemannian optimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Guarantees of Riemannian optimization for low rank matrix completion
- A Riemannian rank-adaptive method for low-rank matrix completion
Cites work
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A survey of nonlinear conjugate gradient methods
- An introduction to statistical learning. With applications in R
- Diffusion wavelets
- Exact matrix completion via convex optimization
- Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Function minimization by conjugate gradients
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
- Global rates of convergence for nonconvex optimization on manifolds
- Graph spectral image smoothing using the heat kernel
- Guaranteed Matrix Completion via Non-Convex Factorization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Introductory lectures on convex optimization. A basic course.
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Theory
- Low-rank matrix completion by Riemannian optimization
- Low-rank matrix completion using alternating minimization
- Low-rank optimization with trace norm penalty
- Manopt, a Matlab toolbox for optimization on manifolds
- Matrix Completion From a Few Entries
- Matrix completion and low-rank SVD via fast alternating least squares
- Methods of conjugate gradients for solving linear systems
- Online learning for matrix factorization and sparse coding
- Spectral regularization algorithms for learning large incomplete matrices
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The convex geometry of linear inverse problems
- Vertex-frequency analysis on graphs
Cited in
(4)
This page was built for publication: Riemannian gradient descent methods for graph-regularized matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029849)
