Iterative Collaborative Filtering for Sparse Matrix Estimation
From MaRDI portal
Publication:5060494
DOI10.1287/opre.2021.2193OpenAlexW2774673489WikidataQ113239960 ScholiaQ113239960MaRDI QIDQ5060494
Christina Lee Yu, Devavrat Shah, Jennifer T. Chayes, Christian Borgs
Publication date: 10 January 2023
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.00710
matrix completionlatent variable modelsmatrix estimationrecommendation systemsentrywise boundssimilarity based collaborative filtering
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Rate-optimal graphon estimation
- Oracle inequalities for network models and sparse graphon estimation
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- On inverses of Vandermonde and confluent Vandermonde matrices
- A proof of the block model threshold conjecture
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Entrywise eigenvector analysis of random matrices with low expected rank
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Matrix estimation by universal singular value thresholding
- Spectral redemption in clustering sparse networks
- Graph limits and exchangeable random graphs
- Sparse exchangeable graphs and their limits via graphon processes
- Near-Optimal Bounds for Phase Synchronization
- Why Are Big Data Matrices Approximately Low Rank?
- Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model
- Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
- 1-Bit matrix completion
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Community detection thresholds and the weak Ramanujan property
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Estimating network edge probabilities by neighbourhood smoothing
- A Simpler Approach to Matrix Completion
