scientific article; zbMATH DE number 7278076

DOI10.4230/LIPICS.FSTTCS.2017.4zbMATH Open1496.62096MaRDI QIDQ5136293FDOQ5136293

Devavrat Shah

Publication date: 25 November 2020

Title of this publication is not available (Why is that?)

zbMATH Keywords

graphon estimationcollaborative filteringmatrix estimation

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Estimation in multivariate analysis (62H12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix completion from noisy entries
• Rate-optimal graphon estimation
• Matrix estimation by universal singular value thresholding
• 1-Bit matrix completion
• Exact matrix completion via convex optimization
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Oracle inequalities for network models and sparse graphon estimation
• Representations for partially exchangeable arrays of random variables
• Graph limits and exchangeable random graphs
• Matrix Completion From a Few Entries
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Exchangeable random measures
• A Simpler Approach to Matrix Completion
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence

Cited In (4)

• Matrix inference and estimation in multi-layer models*
• An optimal statistical and computational framework for generalized tensor estimation
• Active matrix factorization for surveys
• Iterative Collaborative Filtering for Sparse Matrix Estimation

This page was built for publication:

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