Pose graph optimization is recast as damped Riemannian dynamics on Lie groups, enabling a fully distributed algorithm with a semi-implicit integrator that converges under both synchronous and asynchronous communication.
Title resolution pending
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 8roles
background 2polarities
background 2representative citing papers
Polynomial-time algorithm samples the Sherrington-Kirkpatrick Gibbs measure at beta < 1/2 with o(1) TVD error by combining potential Hessian ascent, stochastic localization, covariance estimates, and Jarzynski equality with rejection sampling.
RAIC unifies uniform recovery of structured signals from nonlinear observations via PGD, yielding error rates comparable to nonuniform guarantees up to log factors in sparse and 1-bit settings.
A learned feedback policy replaces manual parameter tuning in distributed Riemannian optimization over matrix Lie groups, achieving lower objective values on multi-robot mapping benchmarks.
PLANE jointly estimates latent gene positions from a target network and proxy embeddings on a larger gene set, with provably optimal channel weighting and demonstrated gains in network recovery and imputation.
A norm penalty constraining activations to a sqrt(d)-radius hypersphere accelerates grokking by up to 6x on modular arithmetic via radial suppression in activation dynamics.
Geometric Pareto Control embeds Pareto solutions in a Lie group submanifold and navigates via Riemannian gradient flow to achieve 100% feasibility and low suboptimality in control tasks without retraining.
DiffRGD is a plug-and-play inference-time guidance method that casts each diffusion sampling step as constrained optimization on a spherical manifold and solves it with Riemannian gradient descent to preserve the Gaussian latent structure.
citing papers explorer
-
Distributed Pose Graph Optimization via Continuous Riemannian Dynamics
Pose graph optimization is recast as damped Riemannian dynamics on Lie groups, enabling a fully distributed algorithm with a semi-implicit integrator that converges under both synchronous and asynchronous communication.
-
Potential Hessian Ascent III: Sampling the Sherrington--Kirkpatrick Model at Beta < 1/2
Polynomial-time algorithm samples the Sherrington-Kirkpatrick Gibbs measure at beta < 1/2 with o(1) TVD error by combining potential Hessian ascent, stochastic localization, covariance estimates, and Jarzynski equality with rejection sampling.
-
Robust Uniform Recovery of Structured Signals from Nonlinear Observations
RAIC unifies uniform recovery of structured signals from nonlinear observations via PGD, yielding error rates comparable to nonuniform guarantees up to log factors in sparse and 1-bit settings.
-
Learning Adaptive Solvers for Distributed Factor Graph Optimization on Matrix Lie Groups
A learned feedback policy replaces manual parameter tuning in distributed Riemannian optimization over matrix Lie groups, achieving lower objective values on multi-robot mapping benchmarks.
-
AI-Augmented Statistical Network Estimation with Proxy Gene Embeddings
PLANE jointly estimates latent gene positions from a target network and proxy embeddings on a larger gene set, with provably optimal channel weighting and demonstrated gains in network recovery and imputation.
-
Radial Suppression Accelerates Algorithmic Generalization: A Geometric Analysis of Delayed Generalization
A norm penalty constraining activations to a sqrt(d)-radius hypersphere accelerates grokking by up to 6x on modular arithmetic via radial suppression in activation dynamics.
-
Geometric Pareto Control: Riemannian Gradient Flow of Energy Function via Lie Group Homotopy
Geometric Pareto Control embeds Pareto solutions in a Lie group submanifold and navigates via Riemannian gradient flow to achieve 100% feasibility and low suboptimality in control tasks without retraining.
-
DiffRGD: An Inference-Time Diffusion Guidance Through Riemannian Gradient Descent
DiffRGD is a plug-and-play inference-time guidance method that casts each diffusion sampling step as constrained optimization on a spherical manifold and solves it with Riemannian gradient descent to preserve the Gaussian latent structure.