A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

zbMath1318.62172arXiv1309.6013MaRDI QIDQ2933966

Wen-Xin Zhou

Publication date: 8 December 2014

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

zbMATH Keywords

constrained optimizationoptimal rate of convergencemaximum likelihood estimatelow-rank matrixmax-normtrace-norm1-bit matrix completion

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12)

Related Items (18)

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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data ⋮ Unnamed Item ⋮ Adaptive multinomial matrix completion ⋮ Imputation and low-rank estimation with missing not at random data ⋮ One-bit tensor completion via transformed tensor singular value decomposition ⋮ Online optimization for max-norm regularization ⋮ Flexible low-rank statistical modeling with missing data and side information ⋮ Main effects and interactions in mixed and incomplete data frames ⋮ Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions ⋮ 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

This page was built for publication: A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion