arXiv Machine Learning By Yuepeng Yang, Cong Ma

Sample-efficient inductive matrix completion with noise and inexact side-information

Read the original on arXiv Machine Learning →

arXiv:2605. 17189v2 Announce Type: replace-cross Abstract: Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
5d ago

Fast Length-Squared Sampling for Positive-Semidefinite Matrices

arXiv:2608. 12503v1 Announce Type: cross Abstract: We describe a simple rejection-sampling-based algorithm to perform length-squared sampling on an $n \times n$ positive-semidefinite (psd) matrix: that is, to sample a column with probability proportional to its squared $\ell_2$-norm.

By Rajarshi Bhattacharjee, Ethan N. Epperly, Cameron Musco, Aaron Tian