arXiv Machine Learning By Zhangsong Li

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm

Read the original on arXiv Machine Learning →

arXiv:2412. 16457v3 Announce Type: replace-cross Abstract: In this paper, we focus on the matching recovery problem between a pair of correlated Gaussian Wigner matrices with a latent vertex correspondence.

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

arXiv Machine Learning
Jul 10

High-Dimensional Procrustes Matching via Tree Counts

arXiv:2607. 08538v1 Announce Type: cross Abstract: Suppose we observe two sets of $n$ Gaussian vectors in $\mathbb{R}^d$, with the promise that, after applying a permutation of $[n]$ and a rotation of $\mathbb{R}^d$, the two sets are $\rho$-correlated.

By Xiaochun Niu, Tselil Schramm, Jiaming Xu
arXiv Machine Learning
Jul 3

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming

arXiv:2601. 03946v3 Announce Type: replace-cross Abstract: We consider the densest submatrix problem, which seeks the submatrix of fixed size of a given binary matrix that contains the most nonzero entries.

By Valentine Olanubi (University of Alabama, Department of Mathematics), Phineas Agar (University of Alabama, Department of Mathematics), Brendan Ames (University of Southampton, School of Mathematical Sciences)