Iterative Collaborative Filtering for Sparse Matrix Estimation

DOI10.1287/OPRE.2021.2193MaRDI QIDQ5060494zbMATH OpenOpenAlexWikidataFDO

Authors Devavrat Shah, Christina Lee Yu, Christian Borgs, Jennifer T. Chayes

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

zbMATH Keywords

entrywise boundslatent variable modelsmatrix completionmatrix estimationrecommendation systemssimilarity based collaborative filtering

Mathematics Subject Classification ID

Statistics (62-XX)

Recommendations

• Matrix estimation, latent variable model and collaborative filtering

Cites work

• 1-bit matrix completion
• A proof of the block model threshold conjecture
• A simpler approach to matrix completion
• An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Community detection thresholds and the weak Ramanujan property
• Consistent nonparametric estimation for heavy-tailed sparse graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Entrywise eigenvector analysis of random matrices with low expected rank
• Estimating network edge probabilities by neighbourhood smoothing
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• Graph limits and exchangeable random graphs
• Large networks and graph limits
• Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
• Matrix Completion From a Few Entries
• Matrix completion from noisy entries
• Matrix estimation by universal singular value thresholding
• Near-optimal bounds for phase synchronization
• Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model
• On inverses of Vandermonde and confluent Vandermonde matrices
• Oracle inequalities for network models and sparse graphon estimation
• Rate-optimal graphon estimation
• Sparse exchangeable graphs and their limits via graphon processes
• Spectral method and regularized MLE are both optimal for top-\(K\) ranking
• Spectral redemption in clustering sparse networks
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Why Are Big Data Matrices Approximately Low Rank?

Cited in

(3)

• scientific article; zbMATH DE number 7626706 (Why is no real title available?)
• A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
• Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction

This page was built for publication: Iterative Collaborative Filtering for Sparse Matrix Estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060494)