Skip to content
Sagan

Paper

Low-rank Distributional Matrix Completion

Unreadunread

AI summary

arXiv:2606. 04176v1 Announce Type: new Abstract: We study a distributional generalization of the matrix completion problem in which each entry of the target matrix is a probability distribution rather than a scalar.