arXiv (All)
open access
Nuclear Norm-Regularized Bayesian Matrix Completion
Matrix completion, the problem of estimating missing entries in a matrix from noisily observed ones, underlies a diverse array of problems such as recommender systems and counterfactual outcome estimation in panel data. Many algorithms address the problem using regularized least squares, often with
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Transfer Learning for Matrix Completion#1037729
- Graph-Regularized Low-Rank Matrix Completion by Variable Projection#361439
- Causal Inference of Ordinal Outcomes: A Bayesian Solution#1070476
- On the Regularization Landscape for the Linear Recommendation Models#673540
- Fréchet Regression for Random Objects with Euclidean Predictors#1130418
Record · ID 1078149
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive