Jul 2026
Geometric planted matchings in high dimensions: The power of multiple views
A simple polynomial-time procedure recovers all relative matchings up to $o(n)$ errors whenever $b>K/(K-1)$ and multiple views can break the impossibility barrier $b=2$ for the original matching problem.
Timothy L. H. Wee, Kaylee Yingxi Yang, Zhou Fan et al.
· arXiv.org · 0 citations