The Power of Convex Relaxation: Near-Optimal Matrix Completion
From MaRDI portal
(Redirected from Publication:5281478)
Cited in
(only showing first 100 items - show all)- Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification
- Unitary dilation approach to contractive matrix completion.
- Multivariate GARCH estimation via a Bregman-proximal trust-region method
- A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
- Stable analysis of compressive principal component pursuit
- Matrix completion discriminant analysis
- Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
- Random perturbation of low rank matrices: improving classical bounds
- Affine matrix rank minimization problem via non-convex fraction function penalty
- Adaptive confidence sets for matrix completion
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- Matrix factorization for evolution data
- Linear total variation approximate regularized nuclear norm optimization for matrix completion
- Cross: efficient low-rank tensor completion
- Level-set methods for convex optimization
- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Tensor completion using total variation and low-rank matrix factorization
- Low-rank matrix completion using nuclear norm minimization and facial reduction
- Block tensor train decomposition for missing data estimation
- Templates for convex cone problems with applications to sparse signal recovery
- Flexible low-rank statistical modeling with missing data and side information
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- On the exponentially weighted aggregate with the Laplace prior
- TILT: transform invariant low-rank textures
- Compressed sensing and matrix completion with constant proportion of corruptions
- A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
- Tensor factorization using auxiliary information
- Accelerated linearized Bregman method
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Second order accurate distributed eigenvector computation for extremely large matrices
- Phase retrieval from Fourier measurements with masks
- On the subdifferential of symmetric convex functions of the spectrum for symmetric and orthogonally decomposable tensors
- On polynomial time methods for exact low-rank tensor completion
- Matrix factorization for multivariate time series analysis
- A general self-adaptive relaxed-PPA method for convex programming with linear constraints
- Estimation of the parameters of a weighted nuclear norm model and its application in image denoising
- Inference on tissue transplantation experiments
- Riemannian gradient descent methods for graph-regularized matrix completion
- Low-rank matrix completion in a general non-orthogonal basis
- Ranking recovery from limited pairwise comparisons using low-rank matrix completion
- A selective overview of deep learning
- New applications of matrix methods
- Inductive matrix completion with feature selection
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Low-rank factorization for rank minimization with nonconvex regularizers
- Tensor theta norms and low rank recovery
- Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
- A new method based on the manifold-alternative approximating for low-rank matrix completion
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Tensor Q-rank: new data dependent definition of tensor rank
- An adaptation for iterative structured matrix completion
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- On the robustness of minimum norm interpolators and regularized empirical risk minimizers
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Proof methods for robust low-rank matrix recovery
- Low-CP-rank tensor completion via practical regularization
- A smoothing proximal gradient algorithm for matrix rank minimization problem
- Heteroskedastic PCA: algorithm, optimality, and applications
- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
- Adaptive estimation in multivariate response regression with hidden variables
- A new double-regularized regression using Liu and Lasso regularization
- Tight risk bound for high dimensional time series completion
- Noisy tensor completion via the sum-of-squares hierarchy
- Phase retrieval of complex and vector-valued functions
- Augmented Lagrangian methods for convex matrix optimization problems
- Matrix completion methods for the total electron content video reconstruction
- Complex best \(r\)-term approximations almost always exist in finite dimensions
- Guarantees of Riemannian optimization for low rank matrix completion
- Optimal prediction in the linearly transformed spiked model
- Exponential weights in multivariate regression and a low-rankness favoring prior
- Manifold regularized matrix completion for multi-label learning with ADMM
- An alternating minimization method for matrix completion problems
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Robust PCA using nonconvex rank approximation and sparse regularizer
- Synchronization problems in computer vision with closed-form solutions
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
- Mean estimation with sub-Gaussian rates in polynomial time
- Entrywise eigenvector analysis of random matrices with low expected rank
- Concentration of tempered posteriors and of their variational approximations
- Two relaxation methods for rank minimization problems
- Characterization of sampling patterns for low-tt-rank tensor retrieval
- Matrix completion for matrices with low-rank displacement
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- Normal approximation and confidence region of singular subspaces
- Convergence of projected Landweber iteration for matrix rank minimization
- Robust linear optimization under matrix completion
- Homotopy method for matrix rank minimization based on the matrix hard thresholding method
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Tensor completion based on triple tubal nuclear norm
- Pairwise constraint propagation via low-rank matrix recovery
- Lasso meets horseshoe: a survey
- A non-convex tensor rank approximation for tensor completion
- Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Matrix completion for cost reduction in finite element simulations under hybrid uncertainties
- Non-intrusive tensor reconstruction for high-dimensional random PDEs
This page was built for publication: The Power of Convex Relaxation: Near-Optimal Matrix Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281478)
