An approximate message passing algorithm provably recovers the latent matching between correlated Gaussian matrices under adversarial principal-minor corruption of size n/(log n)^20.
Graph isomorphism in quasi-polynomial time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
stat.ML 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm
An approximate message passing algorithm provably recovers the latent matching between correlated Gaussian matrices under adversarial principal-minor corruption of size n/(log n)^20.