Matrix estimation, latent variable model and collaborative filtering
From MaRDI portal
Publication:5136293
Recommendations
Cites work
- scientific article; zbMATH DE number 3780300 (Why is no real title available?)
- 1-bit matrix completion
- A simpler approach to matrix completion
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Exact matrix completion via convex optimization
- Exchangeable random measures
- Graph limits and exchangeable random graphs
- Large networks and graph limits
- Matrix Completion From a Few Entries
- Matrix completion from noisy entries
- Matrix estimation by universal singular value thresholding
- Oracle inequalities for network models and sparse graphon estimation
- Rate-optimal graphon estimation
- Representations for partially exchangeable arrays of random variables
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(5)
This page was built for publication: Matrix estimation, latent variable model and collaborative filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136293)