Low Permutation-rank Matrices: Structural Properties and Noisy Completion
From MaRDI portal
Publication:5214186
zbMath1434.68451arXiv1709.00127MaRDI QIDQ5214186
Martin J. Wainwright, Nihar B. Shah, Sivaraman Balakrishnan
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1709.00127
recommender systemsoracle inequalitiesminimax theorypermutation-based modelnon-negative matrix completion
Estimation in multivariate analysis (62H12) Minimax procedures in statistical decision theory (62C20) Learning and adaptive systems in artificial intelligence (68T05) Matrix completion problems (15A83)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Minimax risk of matrix denoising by singular value thresholding
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- On the parameterization of the CreditRisk\(^+\) model for estimating credit portfolio risk
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Optimal rates of statistical seriation
- Concentration around the mean for maxima of empirical processes
- Active ranking from pairwise comparisons and when parametric assumptions do not help
- Matrix estimation by universal singular value thresholding
- Noisy low-rank matrix completion with general sampling distribution
- Fast singular value thresholding without singular value decomposition
- Exact matrix completion via convex optimization
- Learning mixtures of spherical gaussians
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- A Singular Value Thresholding Algorithm for Matrix Completion
- Tensor rank is NP-complete
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Competitive analysis of the top-K ranking problem
- A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness
- Estimation in Tournaments and Graphs Under Monotonicity Constraints
- Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Learning the parts of objects by non-negative matrix factorization
- Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
- A Simpler Approach to Matrix Completion
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
- Computing a nonnegative matrix factorization -- provably
- Low-rank matrix completion using alternating minimization
- Introduction to nonparametric estimation
