Research map / Learning theory and algorithms / Matrix and tensor methods
Non-Negative Inductive Matrix Completion for Discrete Dyadic Data
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- High Rank Matrix Completion With Side Information (AAAI 2018 · similarity 0.88)
- A Sparse Interactive Model for Matrix Completion with Side Information (NeurIPS 2016 · similarity 0.88)
- Scalable Completion of Nonnegative Matrix with Separable Structure (AAAI 2016 · similarity 0.87)
- Group-Aware Matrix Estimation and Latent Subspace Recovery (NeurIPS 2026 · similarity 0.86)
- A Pairwise Pseudo-likelihood Approach for Matrix Completion with Informative Missingness (NeurIPS 2024 · similarity 0.86)
- Connectivity Shapes Implicit Regularization in Matrix Factorization Models for Matrix Completion (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.