1-Bit matrix completion

DOI10.1093/imaiai/iau006zbMath1309.62124arXiv1209.3672OpenAlexW2964200481MaRDI QIDQ5177868

Mark A. Davenport, Ewout van den Berg, Mary Wootters, Yaniv Plan

Publication date: 6 March 2015

Published in: Information and Inference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.3672

zbMATH Keywords

matrix completionconvex programmingquantizationconstrained maximum likelihood estimationbinary observations

Mathematics Subject Classification ID

Point estimation (62F10) Generalized linear models (logistic models) (62J12) Convex programming (90C25) Matrix completion problems (15A83)

Related Items

Matrix Completion under Low-Rank Missing Mechanism, Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming, Matrix completion via max-norm constrained optimization, 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation, Iterative Collaborative Filtering for Sparse Matrix Estimation, Unnamed Item, A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Unnamed Item, Matrix completion under complex survey sampling, Discussion of the paper ``On concentration for (regularized) empirical risk minimization, Unnamed Item, Unnamed Item, Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization, Adaptive multinomial matrix completion, Link Prediction for Egocentrically Sampled Networks, Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition, Projective, sparse and learnable latent position network models, A Zero-imputation Approach in Recommendation Systems with Data Missing Heterogeneously, High-dimensional estimation with geometric constraints: Table 1., One-bit tensor completion via transformed tensor singular value decomposition, Maximum likelihood estimation of sparse networks with missing observations, Online optimization for max-norm regularization, Variational Inference for Stochastic Block Models From Sampled Data, Unnamed Item, High-dimensional index volatility models via Stein's identity, Flexible low-rank statistical modeling with missing data and side information, Active matrix factorization for surveys, Provable accelerated gradient method for nonconvex low rank optimization, Dynamic Assortment Personalization in High Dimensions, Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably, Unnamed Item, Generalized high-dimensional trace regression via nuclear norm regularization, Structured Latent Factor Analysis for Large-scale Data: Identifiability, Estimability, and Their Implications, Unnamed Item, Joint maximum likelihood estimation for high-dimensional exploratory item factor analysis, Matrix estimation by universal singular value thresholding