arXiv (All)
open access
Transfer Learning for Matrix Completion
In this paper, we explore the knowledge transfer under the setting of matrix completion, which aims to enhance the estimation of a low-rank target matrix with auxiliary data available. We propose a transfer learning procedure given prior information on which source datasets are favorable. We study i
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
- Graph-Regularized Low-Rank Matrix Completion by Variable Projection#361439
- Nuclear Norm-Regularized Bayesian Matrix Completion#1078149
- Empirical Bayes 1-bit matrix completion#1141535
- Low-rank matrix recovery landscapes beyond RIP with application to rank-one measurements#973750
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
Record · ID 1037729
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