High-Dimensional Procrustes Matching via Tree Counts

arXiv:2607.08538 · stat.ML, cs.IT, cs.LG, math.ST · Submitted 2026-07-09 · Read on arXiv

Xiaochun Niu, Tselil Schramm, Jiaming Xu

stat.ML, cs.IT, cs.LG, math.ST

Submitted: 2026-07-09

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Embeddings — 3× in this paper · explained in 2 episodes
• Foundations of Computer Science — 2× in this paper
• Quadratic Assignment Problem (QAP) — 2× in this paper · explained in 2 episodes
• Clarity — 1× in this paper · explained in 3 episodes
• Fixed Point — 1× in this paper · explained in 2 episodes
• Monotonicity — 1× in this paper · explained in 2 episodes
• Non-asymptotic Analysis — 1× in this paper · explained in 2 episodes
• Papers — 1× in this paper · explained in 3 episodes
• Phase Transition — 1× in this paper · explained in 3 episodes
• Point Clouds — 1× in this paper · explained in 2 episodes
• Structural Constraints — 1× in this paper · explained in 2 episodes

Sources

• The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
• Computational Complexity of Statistics: New Insights from Low-Degree Polynomials

Related papers

• Behavior of prediction performance metrics with rare events
• Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
• A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
• Scalable Posterior Uncertainty for Flexible Density-Based Clustering
• A Transport Geometry of Benign Overfitting
• Efficient quadratic entropy with distance sketches