Redescending Boltzmann–Lohe Rotation Synchronization and the Hub-Precision Phase Transition on SO(d)

Group synchronization learns latent SO(d) node frames from noisy pairwise measurements on a graph. In multi-view three-dimensional registration and signed community detection, gross Haar outliers from wide-baseline loop closures occur alongside large variations in vertex degree. In such settings, quadratic methods, including spectral synchronization and Riemannian gradient descent, perform poorly. Static degree normalization reduces the influence of corrupted hubs, yet it also penalizes clean overview measurements. Here, we introduce redescending Boltzmann-Lohe synchronization by maximizing an annealed exponential chordal energy via closed-form Kabsch-Umeyama polar retractions in monotonic coordinate ascent. Under power-law noise and outlier contamination with effective exponent gamma_eff, we prove that asymptotic Riemannian Gauss-Markov error is minimized by weighting edges as (d_i d_j)^(-alpha) with alpha* = gamma_eff / 2. Since gamma_eff is unknown in practice, we derive Adaptive Residual-Precision Boltzmann-Lohe (ARP-Lohe), an Empirical-Bayes method that estimates node precisions from accepted chordal residuals. Across 24 scan graphs of the Stanford Bunny, mean geodesic error drops from 4.88 degrees under two-stage Lie-algebraic iteratively reweighted least squares to 4.42 degrees. Under hub corruption, ARP-Lohe achieves 1.65 degrees error on rotation graphs.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24374945
Primary Topic
Statistical and numerical algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Redescending Boltzmann–Lohe Rotation Synchronization and the Hub-Precision Phase Transition on SO(d)

Felipe Provezano Coutinho
Zenodo (CERN European Organization for Nuclear Research)
Statistical and numerical algorithms
preprint

Redescending Boltzmann–Lohe Rotation Synchronization and the Hub-Precision Phase Transition on SO(d)

Felipe Provezano Coutinho
preprint en

Abstract

Group synchronization learns latent SO(d) node frames from noisy pairwise measurements on a graph. In multi-view three-dimensional registration and signed community detection, gross Haar outliers from wide-baseline loop closures occur alongside large variations in vertex degree. In such settings, quadratic methods, including spectral synchronization and Riemannian gradient descent, perform poorly. Static degree normalization reduces the influence of corrupted hubs, yet it also penalizes clean overview measurements. Here, we introduce redescending Boltzmann-Lohe synchronization by maximizing an annealed exponential chordal energy via closed-form Kabsch-Umeyama polar retractions in monotonic coordinate ascent. Under power-law noise and outlier contamination with effective exponent gamma_eff, we prove that asymptotic Riemannian Gauss-Markov error is minimized by weighting edges as (d_i d_j)^(-alpha) with alpha* = gamma_eff / 2. Since gamma_eff is unknown in practice, we derive Adaptive Residual-Precision Boltzmann-Lohe (ARP-Lohe), an Empirical-Bayes method that estimates node precisions from accepted chordal residuals. Across 24 scan graphs of the Stanford Bunny, mean geodesic error drops from 4.88 degrees under two-stage Lie-algebraic iteratively reweighted least squares to 4.42 degrees. Under hub corruption, ARP-Lohe achieves 1.65 degrees error on rotation graphs.

Zenodo (CERN European Organization for Nuclear Research)
Statistical and numerical algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon