The following pages link to (Q2896128):
Displaying 50 items.
- Optspace (Q24556) (← links)
- Optimal large-scale quantum state tomography with Pauli measurements (Q282466) (← links)
- On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
- Matrix completion via max-norm constrained optimization (Q302432) (← links)
- A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
- A graphical approach to the analysis of matrix completion (Q335673) (← links)
- Transfer learning in heterogeneous collaborative filtering domains (Q360050) (← links)
- High-dimensional covariance matrix estimation with missing observations (Q395991) (← links)
- Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
- Sampling, denoising and compression of matrices by coherent matrix organization (Q448484) (← links)
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion (Q460667) (← links)
- A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion (Q503487) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- Estimation of high-dimensional low-rank matrices (Q548539) (← links)
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion (Q661157) (← links)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Robust matrix completion (Q682808) (← links)
- Matrix completion by singular value thresholding: sharp bounds (Q887273) (← links)
- Adaptive multinomial matrix completion (Q902226) (← links)
- Generalized transfer subspace learning through low-rank constraint (Q903542) (← links)
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
- Double instrumental variable estimation of interaction models with big data (Q1676366) (← links)
- Random perturbation of low rank matrices: improving classical bounds (Q1688904) (← links)
- Adaptive confidence sets for matrix completion (Q1708972) (← links)
- Noise-tolerance matrix completion for location recommendation (Q1741358) (← links)
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
- Compressed sensing and matrix completion with constant proportion of corruptions (Q1939501) (← links)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm (Q1946921) (← links)
- Non-asymptotic approach to varying coefficient model (Q1951122) (← links)
- Second order accurate distributed eigenvector computation for extremely large matrices (Q1952103) (← links)
- Rank penalized estimators for high-dimensional matrices (Q1952222) (← links)
- Convex low rank approximation (Q1991504) (← links)
- Robust high-dimensional factor models with applications to statistical machine learning (Q2038305) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- On relaxed greedy randomized iterative methods for the solution of factorized linear systems (Q2083243) (← links)
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
- Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
- An optimal statistical and computational framework for generalized tensor estimation (Q2119217) (← links)
- Heteroskedastic PCA: algorithm, optimality, and applications (Q2119219) (← links)
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
- Tight risk bound for high dimensional time series completion (Q2137821) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Optimal prediction in the linearly transformed spiked model (Q2176630) (← links)
- An alternating minimization method for matrix completion problems (Q2182816) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
