The following pages link to 1-Bit matrix completion (Q5177868):
Displayed 37 items.
- Variational Inference for Stochastic Block Models From Sampled Data (Q99254) (← links)
- Matrix completion via max-norm constrained optimization (Q302432) (← links)
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
- Adaptive multinomial matrix completion (Q902226) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- Discussion of the paper ``On concentration for (regularized) empirical risk minimization'' (Q1688425) (← links)
- Flexible low-rank statistical modeling with missing data and side information (Q1799348) (← links)
- Online optimization for max-norm regularization (Q2014582) (← links)
- High-dimensional index volatility models via Stein's identity (Q2040038) (← links)
- Active matrix factorization for surveys (Q2044242) (← links)
- One-bit tensor completion via transformed tensor singular value decomposition (Q2242530) (← links)
- Maximum likelihood estimation of sparse networks with missing observations (Q2242863) (← links)
- Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
- Generalized high-dimensional trace regression via nuclear norm regularization (Q2323374) (← links)
- Joint maximum likelihood estimation for high-dimensional exploratory item factor analysis (Q2331148) (← links)
- Matrix estimation by universal singular value thresholding (Q2338924) (← links)
- Dynamic Assortment Personalization in High Dimensions (Q3387950) (← links)
- (Q4558187) (← links)
- High-dimensional estimation with geometric constraints: Table 1. (Q4603716) (← links)
- (Q4969035) (← links)
- (Q4998876) (← links)
- (Q4998890) (← links)
- Matrix Completion under Low-Rank Missing Mechanism (Q5037801) (← links)
- Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming (Q5043284) (← links)
- Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
- A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data (Q5070506) (← links)
- (Q5136293) (← links)
- Structured Latent Factor Analysis for Large-scale Data: Identifiability, Estimability, and Their Implications (Q5146028) (← links)
- (Q5148935) (← links)
- (Q5214241) (← links)
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
- Matrix completion under complex survey sampling (Q6046052) (← links)
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization (Q6144773) (← links)
- Link Prediction for Egocentrically Sampled Networks (Q6181401) (← links)
- Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition (Q6181402) (← links)
- Projective, sparse and learnable latent position network models (Q6183873) (← links)
- A Zero-imputation Approach in Recommendation Systems with Data Missing Heterogeneously (Q6185137) (← links)