arXiv Machine Learning
Rubix: Global Correspondence-Free Point Set Alignment through Assignment Geometry
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jun 26
Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry
arXiv:2606. 26399v1 Announce Type: new Abstract: We study certain extremal problems in combinatorial geometry that ask about configurations of points in an $n \times n$ grid that satisfy strict, global geometric constraints.
Hugging Face Trending Papers
Jun 24
Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry
We study certain extremal problems in combinatorial geometry that ask about configurations of points in an $n \times n$ grid that satisfy strict, global geometric constraints. Classical exact solvers suffer from combinatorial explosion for these types of problems, and standard reinforcement learning and transformer-based models struggle with the sparse reward "validity cliff" and quadratic token-consumption limits.
arXiv Computer Vision
Sep 17
JigSync: Gauge-Resolved Synchronization for Jigsaw Reassembly under Unknown Piece Orientation
arXiv:2609.18379v1 Announce Type: new Abstract: Square jigsaw reassembly requires recovering the spatial arrangement of shuffled fragments from their visual content and pairwise relationships. While...
arXiv Statistics ML
Oct 1
A Unified Dual Method for Matching Problems
arXiv:2609.39339v1 Announce Type: cross Abstract: Matching problems are ubiquitous in data science as they enable the alignment of structured objects and distributions. While existing solvers are oft...
arXiv Computer Vision
Sep 2
Efficient and Robust Absolute Pose Estimation via Gravity-Prior-Driven Transformation Decoupling and Pose Refinement
arXiv:2609.00713v1 Announce Type: new Abstract: Estimation of the absolute pose of an object is an essential task for various robotic applications. Recently, incorporating gravity direction as prior...
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.