跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2609.24708 · v2

SPARSER: Sparse Variable Projection by Exploiting Separable Structure in Robotic Perception

首次提交 2026-09-21 22:52
版本更新 2026-11-18 06:31
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

Robotic perception often requires solving large nonlinear least-squares (NLS) problems. While sparsity has been well exploited to scale solvers, separability remains underexploited: some variables (e.g., landmarks) appear linearly in the residuals and admit a closed-form solution once the others (e.g., poses) are fixed. Variable projection (VarPro) exploits this by analytically eliminating the linear variables, yielding a reduced problem with favorable properties. However, VarPro is rarely used in robotic perception, largely because gauge symmetries (e.g., invariance to global shifts and rotations), common in perception, complicate standard VarPro approaches. We present SPARSER (Sparsity Preserving Analytic Reduction for Separable Estimation in Robotics), a VarPro scheme for problems with gauge symmetries that jointly exploits separability and sparsity. Via one-time preprocessing, it builds a matrix-free Schur complement operator that evaluates costs, gradients, and Hessian-vector products of the reduced problem and integrates with standard iterative NLS solvers. We characterize the applicable problem class and common special cases admitting further analytical savings. The method extends to robust costs via iteratively reweighted least squares (IRLS): symbolic preprocessing is reused across reweightings, so each IRLS iteration needs only a numerical refactorization. On 42 benchmark datasets spanning pose-graph optimization, range-aided SLAM, sensor network localization, and structure from motion, SPARSER is fastest on 41 on CPU and 35 on GPU, and is the only method to solve all. On 24 real-world multi-robot SLAM datasets with outlier-corrupted loop closures, our robust variant is the only method to solve all and is fastest on each, running 1.1-3.1x faster than the graduated non-convexity (GNC) solver in GTSAM. We release open-source C++ code and all datasets.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-18 06:31 · 最新观测版本

SPARSER: Sparse Variable Projection by Exploiting Separable Structure in Robotic Perception

Robotic perception often requires solving large nonlinear least-squares (NLS) problems. While sparsity has been well exploited to scale solvers, separability remains underexploited: some variables (e.g., landmarks) appear linearly in the residuals and admit a closed-form solution once the others (e.g., poses) are fixed. Variable projection (VarPro) exploits this by analytically eliminating the linear variables, yielding a reduced problem with favorable properties. However, VarPro is rarely used in robotic perception, largely because gauge symmetries (e.g., invariance to global shifts and rotations), common in perception, complicate standard VarPro approaches. We present SPARSER (Sparsity Preserving Analytic Reduction for Separable Estimation in Robotics), a VarPro scheme for problems with gauge symmetries that jointly exploits separability and sparsity. Via one-time preprocessing, it builds a matrix-free Schur complement operator that evaluates costs, gradients, and Hessian-vector products of the reduced problem and integrates with standard iterative NLS solvers. We characterize the applicable problem class and common special cases admitting further analytical savings. The method extends to robust costs via iteratively reweighted least squares (IRLS): symbolic preprocessing is reused across reweightings, so each IRLS iteration needs only a numerical refactorization. On 42 benchmark datasets spanning pose-graph optimization, range-aided SLAM, sensor network localization, and structure from motion, SPARSER is fastest on 41 on CPU and 35 on GPU, and is the only method to solve all. On 24 real-world multi-robot SLAM datasets with outlier-corrupted loop closures, our robust variant is the only method to solve all and is fastest on each, running 1.1-3.1x faster than the graduated non-convexity (GNC) solver in GTSAM. We release open-source C++ code and all datasets.

查看此版本解读 →查看此版本原文 ↗