跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1284新增论文
+1011其中 AI 相关
+150已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 10:50各信源进度 →

统计口径与数据新鲜度

统计 2026-11-19 12:03 — 2026-11-20 12:03(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 10:50库内论文最新更新时间:2026-11-19 12:39

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

28,155 已收录论文23,386 AI 相关8,624 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
版本更新 · v2arXiv:2609.24708

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

Nikolas R. Sanderson, Andrew Fishberg, Haoyu Han, Heng Yang, Jonathan P. How, Hanumant Singh, Michael Everett, Alan Papalia

原文摘要

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.

cs.RO