Low-Rank Approximation and Completion of Positive Tensors
From MaRDI portal
Publication:2827064
DOI10.1137/16M1078318zbMath1380.90216arXiv1412.0620OpenAlexW2964322506MaRDI QIDQ2827064
Publication date: 12 October 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0620
Asymptotic properties of parametric estimators (62F12) Random matrices (probabilistic aspects) (60B20) Convex programming (90C25) Combinatorial aspects of simplicial complexes (05E45)
Related Items
Multilayer tensor factorization with applications to recommender systems, Inverse Optimization with Noisy Data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Fixed point and Bregman iterative methods for matrix rank minimization
- Lectures on algebraic statistics
- A survey of cross-validation procedures for model selection
- Covariance regularization by thresholding
- Expressing combinatorial optimization problems by linear programs
- Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization
- Algebraic algorithms for sampling from conditional distributions
- Matrix estimation by universal singular value thresholding
- Regression on manifolds: estimation of the exterior derivative
- Positive tensor factorization
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- A new convergence proof for the higher-order power method and generalizations
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- The Optimal Hard Threshold for Singular Values is <inline-formula> <tex-math notation="TeX">\(4/\sqrt {3}\) </tex-math></inline-formula>
- Robust principal component analysis?
- Graph Implementations for Nonsmooth Convex Programs
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Tensor Completion in Hierarchical Tensor Representations
- On the Optimality of Conditional Expectation as a Bregman Predictor
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
- Better Bootstrap Confidence Intervals
- Variational Analysis
- 10.1162/153244303321897690
- On Tensors, Sparsity, and Nonnegative Factorizations
- Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
- Matrix Completion From a Few Entries
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Most Tensor Problems Are NP-Hard
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
