arXiv Machine Learning By Misha Ivkov, Tselil Schramm

Easy, robust approximate message passing for planted spike models

Read the original on arXiv Machine Learning →

arXiv:2606. 00500v1 Announce Type: cross Abstract: We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Statistics ML
Sep 24

Rank-One Signal Recovery in Sparse Wishart Noise

arXiv:2609.28163v1 Announce Type: cross Abstract: We study the high-dimensional recovery of a signal vector $\mathbf{x}$ in the presence of sparse Wishart-like noise. We define an $N \times N$ matrix...

By Preben Forer, Urte Adomaityte, Pierpaolo Vivo
arXiv Machine Learning
Sep 16

Near-Optimal Nonconvex Matrix Completion

arXiv:2609. 17048v1 Announce Type: cross Abstract: We study nonconvex methods for matrix completion, the problem of recovering a low-rank matrix from a subset of its entries.

By Jian-Feng Cai, Xiliang Lu, Juntao You