Probabilistic low-rank matrix completion from quantized measurements

MaRDI QIDQ2810863zbMATH OpenFDO

Authors Sonia A. Bhaskar

Publication date 6 June 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://jmlr.csail.mit.edu/papers/v17/15-273.html

zbMATH Keywords

collaborative filteringconvex optimizationmatrix completionmaximum likelihood

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Quantum measurement theory, state operations, state preparations (81P15) Convex programming (90C25)

Recommendations

• Adaptive multinomial matrix completion
• Matrix completion from noisy entries
• 1-bit matrix completion
• Exact matrix completion via convex optimization
• A simpler approach to matrix completion

Cited in

(14)

• 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation
• Two-level monotonic multistage recommender systems
• Decentralized and privacy-preserving low-rank matrix completion
• Von Neumann entropy penalization and low-rank matrix estimation
• Recovering structured probability matrices
• A nonlinear matrix decomposition for mining the zeros of sparse data
• Matrix estimation, latent variable model and collaborative filtering
• Low-rank matrix completion and denoising under Poisson noise
• 1-bit matrix completion
• Quantization for low-rank matrix recovery
• Low-Complexity Modeling of Partially Available Second-Order Statistics: Theory and an Efficient Matrix Completion Algorithm
• Item response theory -- a statistical framework for educational and psychological measurement
• Online network change point detection with missing values and temporal dependence
• Adaptive multinomial matrix completion

Describes a project that uses

Uses Software

• SDPLR
• Jellyfish

This page was built for publication: Probabilistic low-rank matrix completion from quantized measurements

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