Optimal Transfer Learning for Missing Not-at-Random Matrix Completion
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916636313780224 |
|---|---|
| author | Jalan, Akhil Jedra, Yassir Mazumdar, Arya Mukherjee, Soumendu Sundar Sarkar, Purnamrita |
| author_facet | Jalan, Akhil Jedra, Yassir Mazumdar, Arya Mukherjee, Soumendu Sundar Sarkar, Purnamrita |
| contents | We study transfer learning for matrix completion in a Missing Not-at-Random (MNAR) setting that is motivated by biological problems. The target matrix $Q$ has entire rows and columns missing, making estimation impossible without side information. To address this, we use a noisy and incomplete source matrix $P$, which relates to $Q$ via a feature shift in latent space. We consider both the active and passive sampling of rows and columns. We establish minimax lower bounds for entrywise estimation error in each setting. Our computationally efficient estimation framework achieves this lower bound for the active setting, which leverages the source data to query the most informative rows and columns of $Q$. This avoids the need for incoherence assumptions required for rate optimality in the passive sampling setting. We demonstrate the effectiveness of our approach through comparisons with existing algorithms on real-world biological datasets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_00174 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Optimal Transfer Learning for Missing Not-at-Random Matrix Completion Jalan, Akhil Jedra, Yassir Mazumdar, Arya Mukherjee, Soumendu Sundar Sarkar, Purnamrita Machine Learning We study transfer learning for matrix completion in a Missing Not-at-Random (MNAR) setting that is motivated by biological problems. The target matrix $Q$ has entire rows and columns missing, making estimation impossible without side information. To address this, we use a noisy and incomplete source matrix $P$, which relates to $Q$ via a feature shift in latent space. We consider both the active and passive sampling of rows and columns. We establish minimax lower bounds for entrywise estimation error in each setting. Our computationally efficient estimation framework achieves this lower bound for the active setting, which leverages the source data to query the most informative rows and columns of $Q$. This avoids the need for incoherence assumptions required for rate optimality in the passive sampling setting. We demonstrate the effectiveness of our approach through comparisons with existing algorithms on real-world biological datasets. |
| title | Optimal Transfer Learning for Missing Not-at-Random Matrix Completion |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2503.00174 |