Adaptive and Implicit Regularization for Matrix Completion
From MaRDI portal
Recommendations
- Adaptive Low Rank Matrix Completion
- An adaptation for iterative structured matrix completion
- Adaptive multinomial matrix completion
- Matrix completion via an alternating direction method
- An ADMM-factorization algorithm for low rank matrix completion
- Some empirical advances in matrix completion
- A Riemannian rank-adaptive method for low-rank matrix completion
- Matrix completion via minimizing an approximate rank
- Adaptive confidence sets for matrix completion
- Matrix completion via max-norm constrained optimization
Cites work
- A mean field view of the landscape of two-layer neural networks
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact matrix completion via convex optimization
- Learning the parts of objects by non-negative matrix factorization
- Multifidelity Dimension Reduction via Active Subspaces
- Non-blind and blind deconvolution under Poisson noise using fractional-order total variation
- Nonlinear total variation based noise removal algorithms
- Nonlocal Image Restoration With Bilateral Variance Estimation: A Low-Rank Approach
- Scheduled restart momentum for accelerated stochastic gradient descent
- Some methods of speeding up the convergence of iteration methods
- Trainability and Accuracy of Artificial Neural Networks: An Interacting Particle System Approach
- Wide neural networks of any depth evolve as linear models under gradient descent *
Cited in
(3)
This page was built for publication: Adaptive and Implicit Regularization for Matrix Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056933)