arxiv
PublishedMay 29, 2026 at 4:00 AM
—neutral
Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithms
Publisher summary· verbatim
arXiv:2401.08197v3 Announce Type: replace Abstract: This paper considers the problem of completing a rating matrix based on sub-sampled matrix entries as well as observed social graphs and hypergraphs. We show that there exists a \emph{sharp threshold} on the sample probability for the task of exact
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
The Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗