Pith. sign in

REVIEW 1 cited by

gradSLAM: Automagically differentiable SLAM

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.10672 v3 pith:WFXRWZSV submitted 2019-10-23 cs.RO cs.CVcs.LG

classification cs.ROcs.CVcs.LG
keywords slamdifferentiabledenselearningcomputationalgradient-basedgradslamgraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Blending representation learning approaches with simultaneous localization and mapping (SLAM) systems is an open question, because of their highly modular and complex nature. Functionally, SLAM is an operation that transforms raw sensor inputs into a distribution over the state(s) of the robot and the environment. If this transformation (SLAM) were expressible as a differentiable function, we could leverage task-based error signals to learn representations that optimize task performance. However, several components of a typical dense SLAM system are non-differentiable. In this work, we propose gradSLAM, a methodology for posing SLAM systems as differentiable computational graphs, which unifies gradient-based learning and SLAM. We propose differentiable trust-region optimizers, surface measurement and fusion schemes, and raycasting, without sacrificing accuracy. This amalgamation of dense SLAM with computational graphs enables us to backprop all the way from 3D maps to 2D pixels, opening up new possibilities in gradient-based learning for SLAM. TL;DR: We leverage the power of automatic differentiation frameworks to make dense SLAM differentiable.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AutoLoop: Fast Visual SLAM Fine-tuning through Agentic Curriculum Learning

    cs.RO 2025-01 conditional novelty 4.0 of 10

    AutoLoop uses a DDPG agent to schedule loop-closure loss weights while fine-tuning DPVO on precomputed loop pairs, claiming an order-of-magnitude reduction in training time.

Pith tools