Pith. sign in

REVIEW 3 major objections 7 minor 185 references

Learning Adaptive Solvers for Distributed Factor Graph Optimization on Matrix Lie Groups

T0 review · 3 major / 7 minor · reviewed 2026-07-10 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Learned policy replaces hand-tuning in distributed robot optimization

desk verdict Solid L2O approach to distributed Lie-group optimization; train-test dynamics mismatch is a real but non-fatal gap read the letter →

arxiv 2607.08735 v1 pith:MUCANFRK submitted 2026-07-09 cs.RO

Jaeho Shin , Maani Ghaffari , Yulun Tian This is my paper
classification cs.RO
keywords distributedoptimizationgraphgroupsmatrixacrossadaptivecommunication
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that the parameters governing distributed geometric optimization over matrix Lie groups can be replaced by a learned feedback policy. Instead of manually setting mass, damping, and step size for a Riemannian optimizer, the authors unfold the optimizer's iterations into a differentiable computation graph and train a graph neural network to predict these parameters from local optimization context. The network sees local velocities, gradients, residuals, and communication delay statistics, and outputs per-robot, per-iteration parameters. Trained self-supervised by minimizing the optimization cost along 50 unrolled iterations, the resulting solver generalizes to graphs of 10,000+ nodes, 500+ iterations, and communication regimes with random delays and packet loss. On 21 of 26 pose graph benchmarks and all three projective alignment benchmarks, it achieves lower objective values than hand-tuned distributed baselines.

What carries the argument

The load-bearing machinery is the deep unfolding of the CORD Riemannian optimizer: each iteration's parameter selection is made differentiable, gradients of the final optimization cost flow back through 50 iterations of solver steps, and a graph neural network learns to map local optimization state to solver parameters. Implicit differentiation through a preconditioned conjugate gradient solver avoids memory blowup from backpropagating through linear solves.

What would settle it

If the learned policy fails to outperform well-tuned fixed parameters on problem instances whose topology, noise level, or communication regime differs substantially from training data, the core claim of robust generalization would be undermined. The CampusRoad3 synchronous result, where the policy enters premature refinement due to small local gradients despite large global error, is a concrete instance of this failure mode.

Watch

Extended reading notes

Core claim

The central mechanism is the replacement of fixed solver hyperparameters with a shared, locally-computed feedback policy. Each robot constructs a two-hop augmented graph from its own variables and the most recently received neighbor states, attaches node-level features (body velocity, gradient, communication staleness), edge-level features (residuals, precision weights), and graph-level features (intra/inter-robot residual norms, update magnitudes), and feeds these through a GPS graph transformer with a parameter prediction head. The predicted mass, damping, and step size are then consumed by the underlying Riemannian optimizer update. The key empirical finding is that this policy, trained只在

Load-bearing premise

The central assumption is that a policy trained on small graphs (~500 nodes) and short horizons (50 iterations) will generalize to graphs with 10,000+ nodes and 500+ iterations. The paper acknowledges this limitation but the empirical results on the Rim dataset provide the main evidence that it holds.

Editorial extensions

If this is right

  • If a learned policy can replace hand-tuned parameters for distributed Lie group optimization, the same approach could extend to other distributed iterative solvers where parameter sensitivity is the main deployment bottleneck.
  • The finding that parameters trained on 500-node, 50-iteration graphs transfer to 10,000-node, 500-iteration settings suggests that optimization dynamics have transferable structure that a policy can capture without problem-specific retraining.
  • The phase-specific parameter schedules discovered by the policy (conservative early, aggressive late, communication-aware) provide empirical priors that could inform the design of non-learned adaptive solvers.
  • Generalization beyond SE(3) to SL(4) projective alignment with a separate trained model suggests the framework is group-agnostic in principle, though whether a single policy could span multiple groups remains open.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper trains separate models for SE(3) and SL(4), leaving open whether a unified policy across Lie groups is feasible or whether group-specific dynamics require separate learned components.
  • The conservatism on CampusRoad3 (where small local gradients cause premature refinement) suggests that purely local features may be fundamentally insufficient for detecting global optimality, and that some form of global or dual information may be necessary for robust convergence detection.
  • The energy dissipation argument for the simplified training dynamics (Appendix D) suggests that the learned parameters preserve convergence properties of the underlying ODE, but this is shown only for the simplified system used during training, not for the full dynamics used at inference.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 7 minor

Summary. The paper presents DeepCORD, a learning-augmented framework for distributed factor graph optimization over general matrix Lie groups. The method unfolds the CORD distributed Riemannian optimizer into differentiable iterations and trains a GNN-based feedback policy to predict adaptive solver parameters (mass, damping, step size) from local optimization context. Training is self-supervised via deep unfolding, minimizing unrolled objectives without requiring optimal solutions. The method is evaluated on SE(3) pose graph optimization (13 benchmark sequences under synchronous and asynchronous communication) and SL(4) projective submap alignment (3 TUM RGB-D sequences), demonstrating lower objective values than distributed baselines on most benchmarks. The approach is principled in preserving the geometric structure of the underlying optimizer while replacing manual parameter tuning with a learned policy.

Significance. The problem addressed—parameter sensitivity in distributed geometric optimization—is practically important for multi-robot SLAM and 3D reconstruction systems. The contribution of extending learning-to-optimize to distributed optimization over general matrix Lie groups, including under asynchronous communication, is novel and fills a genuine gap in the literature. The self-supervised training formulation (Eq. 7) that avoids dependence on optimal solutions is a strength, as is the demonstration of generalization to graphs larger than those in training (Rim: 10,195 nodes vs. training at ~500 nodes). The extension beyond SE(3) to SL(4) projective alignment, motivated by recent feed-forward SLAM systems, is timely. The extensive experimental evaluation across 26 PGO instances and 3 SL(4) datasets, with both synchronous and asynchronous protocols, provides substantial empirical support for the central claim.

major comments (3)
  1. Train-test dynamics mismatch (§4, Eq. 4 vs. Eq. 8/Appendix D). The policy is trained by unrolling a simplified ODE (Eq. 8) that omits the co-adjoint term ad*_ξ(Mξ) and the time-varying mass term Ṁξ, but at test time the full CORD dynamics (Eq. 4) are used. The co-adjoint term captures Lie-group non-commutativity and is potentially non-negligible for SE(3) (rotation-translation coupling) and especially SL(4) (15-dimensional algebra). Appendix D shows the simplified dynamics preserves energy dissipation qualitatively, but this does not establish that parameters optimal for the simplified dynamics remain near-optimal under the full dynamics. The paper should provide at least one of the following: (a) an ablation comparing test-time performance when the policy is trained on full vs. simplified dynamics, (b) empirical evidence that state distributions (ξ, gradient, residuals) encountered at测试
  2. SL(4) results show a large gap to centralized reference (Table 2). On TUM1, DeepCORD achieves cost 2.304 vs. reference 0.876—a gap of ~2.6×. While the paper attributes this to 'severe initial perturbations' (0.2 rad rotation, 0.1 m translation), it is unclear whether the dynamics mismatch described above contributes to this gap, or whether the gap reflects a fundamental limitation of the distributed approach under such perturbations. A sensitivity analysis varying the perturbation magnitude on SL(4) (analogous to Appendix A.3 for SE(3)) would help disentangle these factors and clarify whether the learned policy is limited by the training simplification or by problem difficulty.
  3. Generalization horizon (§4, §7). The policy is trained on K=50 unrolled iterations but evaluated over 500 iterations (Fig. 5). While the performance profiles show stable convergence, the paper does not report whether the predicted parameters remain well-behaved beyond 100 iterations or whether the policy enters degenerate regimes (e.g., vanishing step sizes) over very long horizons. Reporting the distribution of predicted parameters over the full 500-iteration horizon (extending Fig. 6) would strengthen the claim of stable long-horizon generalization.
minor comments (7)
  1. §4, Eq. (6): The policy outputs (m_k^i, d_k^i, Δt_k^i) are robot-level scalars, but the CORD update in Eq. (4) uses block-diagonal M_i = mH_i and D_i = dH_i where H_i varies per robot. It would help to clarify whether the policy predicts a single scalar per parameter per robot, or per-node values that are aggregated.
  2. Table 1: The 'Ref.' column is described as obtained from SE-Sync, but for some datasets (e.g., S3E sequences) the reference cost is much lower than any distributed method. Clarifying whether SE-Sync was run to global optimality or to a tolerance would help interpret the gaps.
  3. Appendix B.1: The communication feature c_u^k for asynchronous communication is defined as qΔt_{k-q}^j, but the units and interpretation are unclear. Is this the product of delay (in iterations) and the delayed step size? A brief clarification would help reproducibility.
  4. §5.2: The SL(4) evaluation uses only 3 datasets with relatively small graphs (89–249 nodes). Given that the SE(3) evaluation includes graphs up to 10,195 nodes, the SL(4) evaluation would benefit from at least one larger-scale example to support the generalization claim.
  5. Figure 4: The architecture diagram is dense and some labels are difficult to read. Consider simplifying or enlarging key components for clarity.
  6. Appendix C.1: The downsampling procedure for real-trajectory graphs is described in detail, but the rationale for the specific thresholds (5 m for loop closures, 1.4 m for grid/helix, etc.) is not provided. A brief justification would improve reproducibility.
  7. §7 (Limitations): The discussion of overly conservative behavior on CampusRoad3 is useful but brief. Quantifying the 'premature refinement regime' (e.g., showing the predicted parameter trajectories for this specific case) would make the limitation more concrete and actionable.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; self-citation to CORD is the base algorithm being extended, not a theorem invoked to force the conclusion.

full rationale

The paper's derivation chain is: (1) take CORD [45] dynamics (Eq. 3–5), co-authored by present authors; (2) unfold iterations into a differentiable computation graph; (3) learn a policy π_θ that predicts solver parameters (m, d, Δt) via self-supervised loss minimizing the actual cost function along unrolled iterates (Eq. 7); (4) evaluate on external benchmarks not seen during training. The self-citation to CORD [45] is load-bearing in the sense that DeepCORD unfolds CORD's iterations, but this is standard practice in learning-to-optimize: you extend an existing algorithm by learning its hyperparameters. CORD itself is independently validated against external baselines in [45], and the present paper's central contribution—learning adaptive parameters—is independent of CORD's theoretical properties. The training loss (Eq. 7) minimizes the actual optimization objective evaluated along unrolled iterates, not a proxy or fitted quantity, so there is no fitted-input-called-prediction circularity. The simplified ODE used during training (Eq. 8 / Appendix D) is a modeling approximation transparently disclosed and justified by an energy dissipation argument, not an ansatz smuggled through citation. The skeptic's concern about train-test dynamics mismatch (simplified vs. full CORD dynamics) is a correctness/generalization risk, not a circularity issue. No step in the derivation reduces to its own inputs by construction.

Assumptions & free parameters 10 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical entities or mathematical objects. It uses established components: matrix Lie groups, graph neural networks (GPS), and the CORD optimizer. The free parameters are standard hyperparameters for neural network training and regularization.

free parameters (10)
  • Monotonicity regularization weight λ_b = 1.0
    Manually set regularization weight for penalizing cost increase between consecutive iterations (Tab. 6).
  • Damping regularization weight λ_d = 5.0
    Manually set regularization weight for encouraging decaying damping (Tab. 6).
  • Damping decay rate β = 0.5
    Constant in the damping regularization term (Tab. 6).
  • Damping decay offset τ = 5.0
    Constant in the damping regularization term (Tab. 6).
  • Number of unrolled iterations K = 50
    Training horizon, chosen due to memory limitations (Sec. 4).
  • Learning rate = 5e-5
    Adam optimizer learning rate (Sec. C.2).
  • Batch size = 16
    Training batch size (Sec. C.2).
  • GPS hidden dimension h = 128
    Latent space dimension for graph neural network (Sec. B.2).
  • Number of GPS layers = 4
    Depth of the graph transformer backbone (Sec. B.3).
  • Minimum parameter values = 1e-2
    Lower bound for mass and damping via softplus offset (Sec. B.4).
assumptions (4)
  • domain assumption CORD dynamics (Eq. 3) converge to local minimizers with suitable parameters
    The paper builds on the theoretical foundation of CORD [45], assuming its convergence properties hold. This is invoked in Sec. 4 when describing the background.
  • domain assumption Simplified ODE (Eq. 8) preserves energy dissipation
    The paper proves in Appendix D that omitting co-adjoint and time-varying mass terms retains energy dissipation. This is used for training stability (Sec. 4).
  • ad hoc to paper Local graph features capture sufficient optimization context
    The policy predicts parameters from local augmented graph features. The paper acknowledges in Sec. 7 that local features may not fully capture proximity to global optimality.
  • ad hoc to paper Training on 50 iterations generalizes to 500+ iterations
    The training uses K=50 unrolled iterations but evaluation runs for 100-500 iterations. Performance profiles in Fig. 5 provide empirical support.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Learning Adaptive Solvers for Distributed Factor Graph Optimization on Matrix Lie Groups." pith.science (2026). https://pith.science/paper/MUCANFRK

@misc{pith2026260708735,
  author       = {Pith},
  title        = {Pith review of: Learning Adaptive Solvers for Distributed Factor Graph Optimization on Matrix Lie Groups},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MUCANFRK}},
  note         = {Machine review of arXiv:2607.08735}
}
abstract

Modern robotic perception increasingly involves large-scale geometric optimization problems distributed across multiple robots or sessions. However, existing distributed solvers often depend on brittle hand tuning and primarily target rigid body pose graphs. To address this, we present DeepCORD, a learning-augmented framework for distributed factor graph optimization on general matrix Lie groups. By unfolding a parallel and accelerated Riemannian optimizer into differentiable iterations, DeepCORD learns a self-supervised feedback policy that dynamically adapts solver parameters according to the optimization phase and communication status. The resulting method enables adaptive distributed optimization over matrix Lie groups under both synchronous and asynchronous communication regimes. Extensive experiments on real-world $\mathrm{SE}$(3) pose graph optimization and $\mathrm{SL}$(4) projective submap alignment show that our method achieves lower objective values than existing distributed baselines on most benchmarks across realistic operating scenarios.

Figures

Figures reproduced from arXiv: 2607.08735 by the authors.

Figure 1
Figure 1. DeepCORD aligns feed-forward SLAM submaps from four robots through distributed SL(4) optimization, [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. (Left) Node and edge partitioning in distributed opti￾mization. Colors indicate differ￾ent robots. (Right) The augmented graph for the red robot. In the distributed setting, the nodes are partitioned across a set of robots A = {1, . . . , N}. Robot i ∈ A owns a subset of variables Vi ⊆ V and maintains the corresponding local states Xi := {Xℓ}ℓ∈Vi . Each robot only optimizes the variables in its own subgraph. In addi… view at source ↗
Figure 3
Figure 3. Distributed PGO solved by the proposed method. Each color denotes a different robot. Pose Graph Optimization (PGO) over SE(3). State-of-the-art multi-robot SLAM systems use PGO to correct accumulated odometry drift and improve global consistency of trajectory estimation [24, 25, 53]; see [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: Proposed architecture of the adaptive local feedback policy [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 6
Figure 6. Figure 6: Evolution of the adaptive parameters (m, d, ∆t) predicted by DeepCORD over 100 iterations, illustrated across optimization phases and maximum delays. Analysis of Adaptive Parame￾ters. To provide additional insights, we analyze the DeepCORD parameter predictions on the …
Figure 5
Figure 5. Figure 5: Performance profiles of PGO over 500 iterations (∆ = 0 [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]
Figure 7
Figure 7. Figure 7: Fused maps from DeepCORD on CampusRoad1 (left), Dormitory1 (middle), and Library1 (right) after PGO. Each color denotes a different robot. This section presents the reconstructed point cloud maps from three representative sequences of the S3E dataset [1] as additional …
Figure 8
Figure 8. Figure 8: Fused maps from DeepCORD on TUM1 (left), TUM2 (middle), and TUM3 (right) after projective submap [PITH_FULL_IMAGE:figures/full_fig_p013_8.png]
Figure 9
Figure 9. Figure 9: Optimality gap comparison on the Rim dataset under varying initial perturbations. Dots represent the mean over 10 independent runs, and the shaded areas indicate the standard deviation. A.3 Robustness to Initialization Perturbations This section further evaluates the r…

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

185 extracted references · 185 canonical work pages

  1. [1]

    Shin, Sungho , month = may, year =. Graph-. 2023. doi:10.23919/ACC55779.2023.10155947 , language =

    work page doi:10.23919/acc55779.2023.10155947 2023

  2. [2]

    Overlapping

    Shin, Sungho and Anitescu, Mihai and Zavala, Victor , pages =. Overlapping. 2020 59th. doi:10.1109/CDC42340.2020.9304139 , abstract =

    work page doi:10.1109/cdc42340.2020.9304139 2020

  3. [3]

    Na, Sen and Shin, Sungho and Anitescu, Mihai and Zavala, Victor , journal=. On the. 2022 , month=mar, volume=

    work page 2022

  4. [4]

    Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs

    Shin, Sungho and Anitescu, Mihai and Zavala, Victor , month = dec, year =. Exponential. doi:10.48550/arXiv.2101.03067 , abstract =

    work page Pith review arXiv doi:10.48550/arxiv.2101.03067

  5. [5]

    IEEE Trans.\ on Control of Network Systems , author =

    Decentralized. IEEE Trans.\ on Control of Network Systems , author =. 2020 , keywords =. doi:10.1109/TCNS.2020.2967805 , abstract =

    work page doi:10.1109/tcns.2020.2967805 2020

  6. [6]

    IEEE Int

    McGann, Daniel and Lassak, Kyle and Kaess, Michael , file =. IEEE Int. Conf. on Robotics and Automation , title =

    work page

  7. [7]

    McGann and M

    D. McGann and M. Kaess , fullauthor =. Proc. Robotics: Science and Systems (RSS) , address =

    work page

  8. [11]

    and Dellaert, Frank , month = sep, year =

    Choudhary, Siddharth and Carlone, Luca and Christensen, Henrik I. and Dellaert, Frank , month = sep, year =. Exactly sparse memory efficient. 2015. doi:10.1109/IROS.2015.7353543 , abstract =

    work page doi:10.1109/iros.2015.7353543 2015

Show all 185 references
  1. [12]

    2023 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Cross-agent relocalization for decentralized collaborative SLAM , author=. 2023 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2023 , organization=

    2023

  2. [13]

    Distributed Pose Graph Optimization via Contractive Belief Sharing , year=

    Liu, Xiangyu and Chli, Margarita , journal=. Distributed Pose Graph Optimization via Contractive Belief Sharing , year=

  3. [14]

    doi:10.48550/arXiv.2010.00156 , abstract =

    Cristofalo, Eric and Montijano, Eduardo and Schwager, Mac , month = oct, year =. doi:10.48550/arXiv.2010.00156 , abstract =

    2010 doi arXiv

  4. [15]

    Initialization techniques for

    Carlone, Luca and Tron, Roberto and Daniilidis, Kostas and Dellaert, Frank , pages =. Initialization techniques for. 2015. doi:10.1109/ICRA.2015.7139836 , abstract =

    2015 doi

  5. [16]

    Generalized

    Fan, Taosha and Murphey, Todd , editor =. Generalized. Robotics. 2022 , doi =

    2022

  6. [17]

    Decentralization and

    Fan, Taosha and Ortiz, Joseph and Hsiao, Ming and Monge, Maurizio and Dong, Jing and Murphey, Todd and Mukadam, Mustafa , month = jul, year =. Decentralization and. Robotics:. doi:10.15607/RSS.2023.XIX.111 , abstract =

    2023 doi

  7. [18]

    Efficient

    Konolige, K and Grisetti, G and Kümmerle, Rainer and Burgard, W and Limketkai, B and Vincent, R , pages =. Efficient. 2010. doi:10.1109/IROS.2010.5649043 , abstract =

    2010 doi

  8. [19]

    A fast and accurate approximation for planar pose graph optimization , volume =. The Int. Journal of Robotics Research , author =. 2014 , pages =. doi:10.1177/0278364914523689 , abstract =

    2014 doi

  9. [20]

    Wei, Ermin and Ozdaglar, Asuman , month = dec, year =. On the. 2013. doi:10.1109/GlobalSIP.2013.6736937 , language =

    2013 doi

  10. [21]

    Distributed

    Wei, Ermin and Ozdaglar, Asuman , month = dec, year =. Distributed. 2012. doi:10.1109/CDC.2012.6425904 , language =

    2012 doi

  11. [22]

    IEEE Trans

    Present and. IEEE Trans. on Robotics , author =. 2024 , keywords =. doi:10.1109/TRO.2023.3323938 , abstract =

    2024 doi

  12. [23]

    Halsted, Trevor and Shorinwa, Ola and Yu, Javier and Schwager, Mac , month = mar, year =. A. doi:10.48550/arXiv.2103.12840 , abstract =

    doi arXiv

  13. [24]

    and Kumar, V

    Karypis, G. and Kumar, V. , month = nov, year =. Multilevel. doi:10.1109/SC.1998.10018 , abstract =

    1998 doi

  14. [25]

    Iterative

    Saad, Yousef , year =. Iterative

  15. [26]

    IEEE Robotics and Automation Letters , author =

    Distributed. IEEE Robotics and Automation Letters , author =. 2024 , keywords =. doi:10.1109/LRA.2024.3382531 , abstract =

    2024 doi

  16. [27]

    doi:10.48550/arXiv.2406.17249 , abstract =

    Liu, Xu and Lei, Jiuzhou and Prabhu, Ankit and Tao, Yuezhan and Spasojevic, Igor and Chaudhari, Pratik and Atanasov, Nikolay and Kumar, Vijay , month = jul, year =. doi:10.48550/arXiv.2406.17249 , abstract =

    doi

  17. [29]

    Distributed mapping with privacy and communication constraints:. The Int. Journal of Robotics Research , author =. 2017 , pages =. doi:10.1177/0278364917732640 , abstract =

    2017 doi

  18. [30]

    Cunningham, Alexander and Indelman, Vadim and Dellaert, Frank , keywords =. 2013. doi:10.1109/ICRA.2013.6631323 , abstract =

    2013 doi

  19. [31]

    Cunningham, Alexander and Paluri, Manohar and Dellaert, Frank , keywords =. 2010. doi:10.1109/IROS.2010.5652875 , abstract =

    2010 doi

  20. [32]

    Consensus-based

    Cristofalo, Eric and Montijano, Eduardo and Schwager, Mac , month = dec, year =. Consensus-based. 2019. doi:10.1109/CDC40024.2019.9029792 , abstract =

    2019 doi

  21. [34]

    Journal of Intelligent & Robotic Systems , author =

    Distributed. Journal of Intelligent & Robotic Systems , author =. 2025 , pages =. doi:10.1007/s10846-025-02257-w , abstract =

    2025 doi

  22. [35]

    and Carlone, Luca , keywords =

    Chang, Yun and Tian, Yulun and How, Jonathan P. and Carlone, Luca , keywords =. Kimera-. 2021. doi:10.1109/ICRA48506.2021.9561090 , abstract =

    2021 doi

  23. [36]

    on Robotics , author =

    IEEE Trans. on Robotics , author =. 2021 , keywords =. doi:10.1109/TRO.2021.3075644 , abstract =

    2021 doi

  24. [38]

    Field Robotics , author =

    Towards. Field Robotics , author =. 2022 , keywords =. doi:10.55417/fr.2022032 , abstract =

    2022 doi

  25. [39]

    IEEE Trans

    Streaming. IEEE Trans. on Signal Processing , author =. 2022 , keywords =. doi:10.1109/TSP.2022.3188208 , abstract =

    2022 doi

  26. [40]

    Zhang, Yetong and Hsiao, Ming and Dong, Jing and Engel, Jakob and Dellaert, Frank , keywords =. 2021. doi:10.1109/IROS51168.2021.9636687 , abstract =

    2021 doi

  27. [41]

    Decentralised cooperative localisation for heterogeneous teams of mobile robots , doi =

    Bailey, Tim and Bryson, Mitch and Mu, Hua and Vial, John and McCalman, Lachlan and Durrant-Whyte, Hugh , keywords =. Decentralised cooperative localisation for heterogeneous teams of mobile robots , doi =. 2011

    2011

  28. [42]

    Andersson, Lars A. A. and Nygards, Jonas , pages =. C-. 2008. doi:10.1109/ROBOT.2008.4543634 , abstract =

    2008 doi

  29. [43]

    IEEE Trans

    Spectral. IEEE Trans. on Robotics , author =. 2024 , pages =. doi:10.1109/TRO.2023.3327635 , abstract =

    2024 doi

  30. [44]

    2022 , keywords =

    IEEE Robotics and Automation Letters , author =. 2022 , keywords =. doi:10.1109/LRA.2022.3191204 , abstract =

    2022 doi

  31. [45]

    Schmuck, Patrik and Ziegler, Thomas and Karrer, Marco and Perraudin, Jonathan and Chli, Margarita , month = oct, year =. 2021. doi:10.1109/ISMAR-Adjunct54149.2021.00043 , abstract =

    2021 doi

  32. [46]

    Collaborative

    Li, Fu and Yang, Shaowu and Yi, Xiaodong and Yang, Xuejun , year =. Collaborative. doi:10.1007/978-3-030-00916-8_45 , abstract =

    doi

  33. [47]

    Rotation. Int. Journal of Computer Vision , author =. 2013 , pages =. doi:10.1007/s11263-012-0601-0 , abstract =

    2013 doi

  34. [48]

    IEEE Trans

    Communication- and. IEEE Trans. on Robotics , author =. 2025 , pages =. doi:10.1109/TRO.2025.3567540 , abstract =

    2025 doi

  35. [49]

    IEEE Transactions on Robotics , volume=

    Kimera-multi: Robust, distributed, dense metric-semantic slam for multi-robot systems , author=. IEEE Transactions on Robotics , volume=. 2022 , publisher=

    2022

  36. [50]

    How , title =

    Aneesa Sonawalla and Yulun Tian and Jonathan P. How , title =. 2026 , journal=

    2026

  37. [51]

    The invariant extended

    Barrau, Axel and Bonnabel, Silvere , journal=. The invariant extended. 2016 , publisher=

    2016

  38. [52]

    borglab/gtsam , month = May, year = 2022, publisher =

    Frank Dellaert and. borglab/gtsam , month = May, year = 2022, publisher =. doi:10.5281/zenodo.5794541 , url =

    2022 doi

  39. [53]

    Agarwal, Sameer and Mierle, Keir and

  40. [55]

    Journal of Machine Learning Research , year=

    A differential equation for modeling Nesterov's accelerated gradient method: Theory and insights , author=. Journal of Machine Learning Research , year=

  41. [56]

    Soviet Mathematics Doklady , year=

    A method for solving the convex programming problem with convergence rate O (1/k2) , author=. Soviet Mathematics Doklady , year=

  42. [57]

    proceedings of the National Academy of Sciences , volume=

    A variational perspective on accelerated methods in optimization , author=. proceedings of the National Academy of Sciences , volume=. 2016 , publisher=

    2016

  43. [58]

    Journal of Machine Learning Research , pages=

    A Lyapunov analysis of accelerated methods in optimization , author=. Journal of Machine Learning Research , pages=

  44. [59]

    arXiv preprint arXiv:1802.03653 , year=

    On symplectic optimization , author=. arXiv preprint arXiv:1802.03653 , year=

    arXiv

  45. [60]

    Advances in Neural Information Processing Systems , volume=

    Acceleration via symplectic discretization of high-resolution differential equations , author=. Advances in Neural Information Processing Systems , volume=

  46. [61]

    Optimization Methods and Software , volume=

    Practical perspectives on symplectic accelerated optimization , author=. Optimization Methods and Software , volume=. 2023 , publisher=

    2023

  47. [62]

    Geometric numerical integration , volume=

    Structure-preserving algorithms for ordinary differential equations , author=. Geometric numerical integration , volume=. 2006 , publisher=

    2006

  48. [63]

    2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , year=

    Projected gradient descent on Riemannian manifolds with applications to online power system optimization , author=. 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , year=

    2016

  49. [64]

    Journal of Nonlinear Science , volume=

    Accelerated optimization on Riemannian manifolds via discrete constrained variational integrators , author=. Journal of Nonlinear Science , volume=. 2022 , publisher=

    2022

  50. [65]

    Proceedings of the IEEE conference on computer vision and pattern recognition , year=

    Gravitational approach for point set registration , author=. Proceedings of the IEEE conference on computer vision and pattern recognition , year=

  51. [66]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Accelerated gravitational point set alignment with altered physical laws , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

  52. [67]

    IEEE Transactions on Image Processing , volume=

    GraphReg: Dynamical point cloud registration with geometry-aware graph signal processing , author=. IEEE Transactions on Image Processing , volume=. 2022 , publisher=

    2022

  53. [68]

    2018 International Conference on 3D Vision (3DV) , pages=

    Nrga: Gravitational approach for non-rigid point set registration , author=. 2018 International Conference on 3D Vision (3DV) , pages=. 2018 , organization=

    2018

  54. [69]

    IEEE transactions on pattern analysis and machine intelligence , volume=

    Efficient registration of high-resolution feature enhanced point clouds , author=. IEEE transactions on pattern analysis and machine intelligence , volume=. 2018 , publisher=

    2018

  55. [70]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Dynamical pose estimation , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

  56. [71]

    The Euler-Poincar

    Bloch, Anthony and Krishnaprasad, PS and Marsden, Jerrold E and Ratiu, Tudor S , journal=. The Euler-Poincar. 1996 , publisher=

    1996

  57. [72]

    IMA Journal of Numerical Analysis , volume=

    Global rates of convergence for nonconvex optimization on manifolds , author=. IMA Journal of Numerical Analysis , volume=. 2019 , publisher=

    2019

  58. [73]

    SIAM Journal on Optimization , volume=

    Asynchronous stochastic coordinate descent: Parallelism and convergence properties , author=. SIAM Journal on Optimization , volume=. 2015 , publisher=

    2015

  59. [74]

    International conference on machine learning , pages=

    Asynchronous decentralized parallel stochastic gradient descent , author=. International conference on machine learning , pages=. 2018 , organization=

    2018

  60. [75]

    Georgia Institute of Technology, Tech

    Factor graphs and GTSAM: A hands-on introduction , author=. Georgia Institute of Technology, Tech. Rep , volume=

  61. [76]

    Foundations and Trends

    Factor graphs for robot perception , author=. Foundations and Trends. 2017 , publisher=

    2017

  62. [77]

    Mathematical programming , volume=

    Benchmarking optimization software with performance profiles , author=. Mathematical programming , volume=. 2002 , publisher=

    2002

  63. [78]

    2018 , publisher=

    Global formulations of Lagrangian and Hamiltonian dynamics on manifolds , author=. 2018 , publisher=

    2018

  64. [79]

    The International Journal of Robotics Research , volume=

    Convex geometric motion planning of multi-body systems on lie groups via variational integrators and sparse moment relaxation , author=. The International Journal of Robotics Research , volume=. 2025 , publisher=

    2025

  65. [80]

    IEEE Transactions on Robotics , year=

    Port-Hamiltonian neural ODE networks on Lie groups for robot dynamics learning and control , author=. IEEE Transactions on Robotics , year=

  66. [81]

    2008 , publisher=

    Optimization algorithms on matrix manifolds , author=. 2008 , publisher=

    2008

  67. [82]

    Advances in neural information processing systems , volume=

    Learning to learn by gradient descent by gradient descent , author=. Advances in neural information processing systems , volume=

  68. [84]

    Proceedings of the 40th International Conference on Machine Learning , series =

    Jialin Liu and Xiaohan Chen and Zhangyang Wang and Wotao Yin and HanQin Cai , title =. Proceedings of the 40th International Conference on Machine Learning , series =

  69. [85]

    Proceedings of the 27th international conference on international conference on machine learning , pages=

    Learning fast approximations of sparse coding , author=. Proceedings of the 27th international conference on international conference on machine learning , pages=

  70. [86]

    Advances in Neural Information Processing Systems , volume=

    Accelerating quadratic optimization with reinforcement learning , author=. Advances in Neural Information Processing Systems , volume=

  71. [88]

    Saravanos and Evangelos A

    Alex Oshin and Rahul Vodeb Ghosh and Augustinos D. Saravanos and Evangelos A. Theodorou , title =. International Conference on Learning Representations , year=

  72. [89]

    IEEE Transactions on Mobile Computing , volume=

    Distributed learn-to-optimize: Limited communications optimization over networks via deep unfolded distributed ADMM , author=. IEEE Transactions on Mobile Computing , volume=. 2024 , publisher=

    2024

  73. [90]

    Applied and computational harmonic analysis , volume=

    Angular synchronization by eigenvectors and semidefinite programming , author=. Applied and computational harmonic analysis , volume=. 2011 , publisher=

    2011

  74. [91]

    52nd IEEE Conference on Decision and Control , pages=

    Robust estimation of rotations from relative measurements by maximum likelihood , author=. 52nd IEEE Conference on Decision and Control , pages=. 2013 , organization=

    2013

  75. [92]

    International journal of computer vision , volume=

    Rotation averaging , author=. International journal of computer vision , volume=. 2013 , publisher=

    2013

  76. [93]

    European Conference on Computer Vision , pages=

    Shonan rotation averaging: Global optimality by surfing SO (p) n , author=. European Conference on Computer Vision , pages=. 2020 , organization=

    2020

  77. [94]

    The International Journal of Robotics Research , volume=

    SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group , author=. The International Journal of Robotics Research , volume=. 2019 , publisher=

    2019

  78. [95]

    IEEE Robotics and Automation Letters , volume=

    Cartan-sync: Fast and global SE (d)-synchronization , author=. IEEE Robotics and Automation Letters , volume=. 2017 , publisher=

    2017

  79. [96]

    Information and Inference: A Journal of the IMA , volume=

    SE (3) Synchronization by eigenvectors of dual quaternion matrices , author=. Information and Inference: A Journal of the IMA , volume=. 2024 , publisher=

    2024

  80. [97]

    2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=

    Pose Graph Optimization over Planar Unit Dual Quaternions: Improved Accuracy with Provably Convergent Riemannian Optimization , author=. 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=. 2024 , organization=

    2024

  81. [98]

    Maggio, Dominic and Lim, Hyungtae and Carlone, Luca , journal=

  82. [99]

    Maggio, Dominic and Carlone, Luca , journal=

  83. [100]

    SIAM journal on Control and Optimization , volume=

    Consensus optimization on manifolds , author=. SIAM journal on Control and Optimization , volume=. 2009 , publisher=

    2009

  84. [101]

    Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference , pages=

    Consensus on homogeneous manifolds , author=. Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference , pages=. 2009 , organization=

    2009

  85. [102]

    IEEE Transactions on Automatic Control , volume=

    Riemannian consensus for manifolds with bounded curvature , author=. IEEE Transactions on Automatic Control , volume=. 2012 , publisher=

    2012

  86. [103]

    2012 IEEE 51st IEEE Conference on Decision and Control (CDC) , pages=

    Intrinsic consensus on SO (3) with almost-global convergence , author=. 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) , pages=. 2012 , organization=

    2012

  87. [104]

    Automatica , volume=

    Distributed methods for synchronization of orthogonal matrices over graphs , author=. Automatica , volume=. 2017 , publisher=

    2017

  88. [105]

    IEEE Transactions on Robotics , volume=

    Spectral sparsification for communication-efficient collaborative rotation and translation estimation , author=. IEEE Transactions on Robotics , volume=. 2023 , publisher=

    2023

  89. [106]

    IEEE Transactions on Robotics , volume=

    Distributed certifiably correct pose-graph optimization , author=. IEEE Transactions on Robotics , volume=. 2021 , publisher=

    2021

  90. [107]

    IEEE Transactions on Robotics , volume=

    Majorization minimization methods for distributed pose graph optimization , author=. IEEE Transactions on Robotics , volume=. 2023 , publisher=

    2023

  91. [108]

    IEEE Robotics and Automation Letters , volume=

    Asynchronous and parallel distributed pose graph optimization , author=. IEEE Robotics and Automation Letters , volume=. 2020 , publisher=

    2020

  92. [109]

    2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Asynchronous distributed smoothing and mapping via on-manifold consensus ADMM , author=. 2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2024 , organization=

    2024

  93. [110]

    arXiv preprint arXiv:2406.07371 , year=

    iMESA: Incremental distributed optimization for collaborative simultaneous localization and mapping , author=. arXiv preprint arXiv:2406.07371 , year=

    arXiv

  94. [111]

    Robotics: Science and Systems , year=

    Distributed Pose Graph Optimization via Continuous Riemannian Dynamics , author=. Robotics: Science and Systems , year=

  95. [112]

    International Conference on Learning Representations , volume=

    Deep distributed optimization for large-scale quadratic programming , author=. International Conference on Learning Representations , volume=

  96. [113]

    Robotics: science and Systems VI , volume=

    Scale drift-aware large scale monocular SLAM , author=. Robotics: science and Systems VI , volume=. 2010 , publisher=

    2010

  97. [114]

    Robotics: Science and Systems (RSS) , month=

    Building Rome with Convex Optimization , author=. Robotics: Science and Systems (RSS) , month=. 2025 , url=

    2025

  98. [115]

    arXiv preprint arXiv:1910.14139 , year=

    FutureMapping 2: Gaussian belief propagation for spatial AI , author=. arXiv preprint arXiv:1910.14139 , year=

    1910 arXiv

  99. [116]

    IEEE Robotics and Automation Letters , volume=

    Distributed simultaneous localisation and auto-calibration using gaussian belief propagation , author=. IEEE Robotics and Automation Letters , volume=. 2024 , publisher=

    2024

  100. [117]

    2025 , publisher=

    Fan, Taosha and Ortiz, Joseph and Hsiao, Ming and Monge, Maurizio and Dong, Jing and Murphey, Todd D and Mukadam, Mustafa , journal=. 2025 , publisher=

    2025

  101. [118]

    2011 IEEE international conference on robotics and automation , pages=

    g2o: A general framework for graph optimization , author=. 2011 IEEE international conference on robotics and automation , pages=. 2011 , organization=

    2011

  102. [119]

    2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    Mavis: Multi-camera augmented visual-inertial SLAM using se 2 (3) based exact imu pre-integration , author=. 2024 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2024 , organization=

    2024

  103. [120]

    IEEE Transactions on Robotics , volume=

    A robot web for distributed many-device localization , author=. IEEE Transactions on Robotics , volume=. 2023 , publisher=

    2023

  104. [121]

    IEEE Robotics and Automation Letters , volume=

    Distributed Pose Graph Optimization via Contractive Belief Sharing , author=. IEEE Robotics and Automation Letters , volume=. 2025 , publisher=

    2025

  105. [122]

    Foundations and Trends in Machine Learning , volume=

    Tutorial on amortized optimization , author=. Foundations and Trends in Machine Learning , volume=. 2023 , publisher=

    2023

  106. [123]

    Learning for dynamics and control conference , pages=

    End-to-end learning to warm-start for real-time quadratic optimization , author=. Learning for dynamics and control conference , pages=. 2023 , organization=

    2023

  107. [125]

    Advances in Neural Information Processing Systems , volume=

    Recipe for a general, powerful, scalable graph transformer , author=. Advances in Neural Information Processing Systems , volume=

  108. [126]

    2024 , publisher=

    Feng, Dapeng and Qi, Yuhua and Zhong, Shipeng and Chen, Zhiqiang and Chen, Qiming and Chen, Hongbo and Wu, Jin and Ma, Jun , journal=. 2024 , publisher=

    2024

  109. [127]

    2012 IEEE/RSJ international conference on intelligent robots and systems , pages=

    A benchmark for the evaluation of RGB-D SLAM systems , author=. 2012 IEEE/RSJ international conference on intelligent robots and systems , pages=. 2012 , organization=

    2012

  110. [128]

    McGann, Daniel and Potokar, Easton R and Kaess, Michael , journal=

  111. [129]

    Albin, Doncey and Mena, Miles and Thomas, Annika and Biggie, Harel and Sun, Xuefei and Woods, Dusty and McGuire, Steve and Heckman, Christoffer , journal=

  112. [130]

    The International Journal of Robotics Research , volume=

    University of Michigan North Campus long-term vision and lidar dataset , author=. The International Journal of Robotics Research , volume=. 2016 , publisher=

    2016

  113. [131]

    IEEE Robotics and Automation Letters , volume=

    LOCUS 2.0: Robust and Computationally Efficient Lidar Odometry for Real-Time 3D Mapping , author=. IEEE Robotics and Automation Letters , volume=. 2022 , publisher=

    2022

  114. [132]

    Journal of Machine Learning Research , volume=

    Learning to optimize: A primer and a benchmark , author=. Journal of Machine Learning Research , volume=

  115. [134]

    arXiv preprint arXiv:1806.04807 , year=

    Ba-net: Dense bundle adjustment network , author=. arXiv preprint arXiv:1806.04807 , year=

    arXiv

  116. [135]

    Proceedings of the European Conference on Computer Vision (ECCV) , pages=

    Learning to solve nonlinear least squares for monocular stereo , author=. Proceedings of the European Conference on Computer Vision (ECCV) , pages=

  117. [136]

    2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=

    Differentiable factor graph optimization for learning smoothers , author=. 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) , pages=. 2021 , organization=

    2021

  118. [137]

    2020 IEEE International Conference on Robotics and Automation (ICRA) , pages=

    ∇ slam: Dense slam meets automatic differentiation , author=. 2020 IEEE International Conference on Robotics and Automation (ICRA) , pages=. 2020 , organization=

    2020

  119. [138]

    IEEE Control Systems Letters , volume=

    Rl-pgo: Reinforcement learning-based planar pose-graph optimization , author=. IEEE Control Systems Letters , volume=. 2023 , publisher=

    2023

  120. [140]

    Proceedings of the IEEE/CVF international conference on computer vision , pages=

    PoGO-Net: Pose graph optimization with graph neural networks , author=. Proceedings of the IEEE/CVF international conference on computer vision , pages=

  121. [142]

    European conference on computer vision , pages=

    Neurora: Neural robust rotation averaging , author=. European conference on computer vision , pages=. 2020 , organization=

    2020

  122. [143]

    Proceedings of the Computer Vision and Pattern Recognition Conference , pages=

    Vggt: Visual geometry grounded transformer , author=. Proceedings of the Computer Vision and Pattern Recognition Conference , pages=

  123. [144]

    2002 , publisher=

    The implicit function theorem: history, theory, and applications , author=. 2002 , publisher=

    2002

  124. [145]

    Ceres Solver , October 2023

    Sameer Agarwal, Keir Mierle, and The Ceres Solver Team . Ceres Solver , October 2023. URL https://github.com/ceres-solver/ceres-solver

    2023

  125. [146]

    CU-Multi : A dataset for multi-robot data association

    Doncey Albin, Miles Mena, Annika Thomas, Harel Biggie, Xuefei Sun, Dusty Woods, Steve McGuire, and Christoffer Heckman. CU-Multi : A dataset for multi-robot data association. arXiv preprint arXiv:2505.17576, 2025

    2025 arXiv

  126. [147]

    Tutorial on amortized optimization

    Brandon Amos. Tutorial on amortized optimization. Foundations and Trends in Machine Learning, 16 0 (5): 0 592--732, 2023

    2023

  127. [148]

    Learning to learn by gradient descent by gradient descent

    Marcin Andrychowicz, Misha Denil, Sergio Gomez, Matthew W Hoffman, David Pfau, Tom Schaul, Brendan Shillingford, and Nando De Freitas. Learning to learn by gradient descent by gradient descent. Advances in neural information processing systems, 29, 2016

    2016

  128. [149]

    The euler-poincar \'e equations and double bracket dissipation

    Anthony Bloch, PS Krishnaprasad, Jerrold E Marsden, and Tudor S Ratiu. The euler-poincar \'e equations and double bracket dissipation. Communications in mathematical physics, 175 0 (1): 0 1--42, 1996

    1996

  129. [150]

    University of michigan north campus long-term vision and lidar dataset

    Nicholas Carlevaris-Bianco, Arash K Ushani, and Ryan M Eustice. University of michigan north campus long-term vision and lidar dataset. The International Journal of Robotics Research, 35 0 (9): 0 1023--1035, 2016

    2016

  130. [151]

    SLAM Handbook

    Luca Carlone, Ayoung Kim, Timothy Barfoot, Daniel Cremers, and Frank Dellaert, editors. SLAM Handbook. From Localization and Mapping to Spatial Intelligence . Cambridge University Press, 2025

    2025

  131. [152]

    Learning to optimize: A primer and a benchmark

    Tianlong Chen, Xiaohan Chen, Wuyang Chen, Howard Heaton, Jialin Liu, Zhangyang Wang, and Wotao Yin. Learning to optimize: A primer and a benchmark. Journal of Machine Learning Research, 23 0 (189): 0 1--59, 2022

    2022

  132. [153]

    Learning to solve nonlinear least squares for monocular stereo

    Ronald Clark, Michael Bloesch, Jan Czarnowski, Stefan Leutenegger, and Andrew J Davison. Learning to solve nonlinear least squares for monocular stereo. In Proceedings of the European Conference on Computer Vision (ECCV), pages 284--299, 2018

    2018

  133. [154]

    borglab/gtsam, May 2022

    Frank Dellaert and GTSAM Contributors . borglab/gtsam, May 2022. URL https://github.com/borglab/gtsam

    2022

  134. [155]

    Factor graphs for robot perception

    Frank Dellaert and Michael Kaess. Factor graphs for robot perception. Foundations and Trends in Robotics , 6 0 (1-2): 0 1--139, 2017

    2017

  135. [156]

    Shonan rotation averaging: Global optimality by surfing so (p) n

    Frank Dellaert, David M Rosen, Jing Wu, Robert Mahony, and Luca Carlone. Shonan rotation averaging: Global optimality by surfing so (p) n. In European Conference on Computer Vision, pages 292--308. Springer, 2020

    2020

  136. [157]

    a usner, Daniel Hern \'a ndez Escobar, and Jens Sj \

    Henri Doerks, Paul H \"a usner, Daniel Hern \'a ndez Escobar, and Jens Sj \"o lund. Learning to accelerate distributed admm using graph neural networks. arXiv preprint arXiv:2509.05288, 2025

    2025 arXiv

  137. [158]

    Benchmarking optimization software with performance profiles

    Elizabeth D Dolan and Jorge J Mor \'e . Benchmarking optimization software with performance profiles. Mathematical programming, 91 0 (2): 0 201--213, 2002

    2002

  138. [159]

    Graph neural networks with learnable structural and positional representations

    Vijay Prakash Dwivedi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, and Xavier Bresson. Graph neural networks with learnable structural and positional representations. arXiv preprint arXiv:2110.07875, 2021

    2021 arXiv

  139. [160]

    Taosha Fan and Todd D. Murphey. Majorization Minimization Methods for Distributed Pose Graph Optimization . IEEE Trans.\ on Robotics, 40: 0 22--42, 2024. ISSN 1941-0468. doi:10.1109/TRO.2023.3324818

    2024 doi

  140. [161]

    DABA : Decentralized and accelerated large-scale bundle adjustment

    Taosha Fan, Joseph Ortiz, Ming Hsiao, Maurizio Monge, Jing Dong, Todd D Murphey, and Mustafa Mukadam. DABA : Decentralized and accelerated large-scale bundle adjustment. The International Journal of Robotics Research, 44 0 (10-11): 0 1892--1919, 2025

    1919

  141. [162]

    S3E : A multi-robot multimodal dataset for collaborative slam

    Dapeng Feng, Yuhua Qi, Shipeng Zhong, Zhiqiang Chen, Qiming Chen, Hongbo Chen, Jin Wu, and Jun Ma. S3E : A multi-robot multimodal dataset for collaborative slam. IEEE Robotics and Automation Letters, 9 0 (12): 0 11401--11408, 2024

    2024

  142. [163]

    Policies over poses: Reinforcement learning based distributed pose-graph optimization for multi-robot slam

    Sai Krishna Ghanta and Ramviyas Parasuraman. Policies over poses: Reinforcement learning based distributed pose-graph optimization for multi-robot slam. arXiv preprint arXiv:2510.22740, 2025

    2025

  143. [164]

    Learning fast approximations of sparse coding

    Karol Gregor and Yann LeCun. Learning fast approximations of sparse coding. In Proceedings of the 27th international conference on international conference on machine learning, pages 399--406, 2010

    2010

  144. [165]

    Accelerating quadratic optimization with reinforcement learning

    Jeffrey Ichnowski, Paras Jain, Bartolomeo Stellato, Goran Banjac, Michael Luo, Francesco Borrelli, Joseph E Gonzalez, Ion Stoica, and Ken Goldberg. Accelerating quadratic optimization with reinforcement learning. Advances in Neural Information Processing Systems, 34: 0 21043--...

    2021

  145. [166]

    Rl-pgo: Reinforcement learning-based planar pose-graph optimization

    Nikolaos Kourtzanidis and Sajad Saeedi. Rl-pgo: Reinforcement learning-based planar pose-graph optimization. IEEE Control Systems Letters, 7: 0 3777--3782, 2023

    2023

  146. [167]

    g2o: A general framework for graph optimization

    Rainer K \"u mmerle, Giorgio Grisetti, Hauke Strasdat, Kurt Konolige, and Wolfram Burgard. g2o: A general framework for graph optimization. In 2011 IEEE international conference on robotics and automation, pages 3607--3613. IEEE, 2011

    2011

  147. [168]

    Swarm- SLAM : Sparse Decentralized Collaborative Simultaneous Localization and Mapping Framework for Multi - Robot Systems

    Pierre-Yves Lajoie and Giovanni Beltrame. Swarm- SLAM : Sparse Decentralized Collaborative Simultaneous Localization and Mapping Framework for Multi - Robot Systems . IEEE Robotics and Automation Letters, 9(1): 0 475--482, January 2024. ISSN 2377-3766, 2377-3774. doi:10.1109/L...

    2024 doi

  148. [169]

    DOOR - SLAM : Distributed , Online , and Outlier Resilient SLAM for Robotic Teams

    Pierre-Yves Lajoie, Benjamin Ramtoula, Yun Chang, Luca Carlone, and Giovanni Beltrame. DOOR - SLAM : Distributed , Online , and Outlier Resilient SLAM for Robotic Teams . IEEE Robotics and Automation Letters, 5(2): 0 1656--1663, April 2020. ISSN 2377-3766. doi:10.1109/LRA.2020.2967681

    2020 doi

  149. [170]

    Learning to optimize

    Ke Li and Jitendra Malik. Learning to optimize. arXiv preprint arXiv:1606.01885, 2016

    2016 arXiv

  150. [171]

    Pogo-net: Pose graph optimization with graph neural networks

    Xinyi Li and Haibin Ling. Pogo-net: Pose graph optimization with graph neural networks. In Proceedings of the IEEE/CVF international conference on computer vision, pages 5895--5905, 2021

    2021

  151. [172]

    Distributed pose graph optimization via contractive belief sharing

    Xiangyu Liu and Margarita Chli. Distributed pose graph optimization via contractive belief sharing. IEEE Robotics and Automation Letters, 11 0 (1): 0 538--545, 2025

    2025

  152. [173]

    VGGT-SLAM 2.0 : Real-time dense feed-forward scene reconstruction

    Dominic Maggio and Luca Carlone. VGGT-SLAM 2.0 : Real-time dense feed-forward scene reconstruction. Robotics: Science and Systems, 2026

    2026

  153. [174]

    VGGT-SLAM : Dense rgb slam optimized on the sl (4) manifold

    Dominic Maggio, Hyungtae Lim, and Luca Carlone. VGGT-SLAM : Dense rgb slam optimized on the sl (4) manifold. Advances in Neural Information Processing Systems, 38, 2025

    2025

  154. [175]

    McGann and M

    D. McGann and M. Kaess. iMESA : Incremental distributed optimization for collaborative simultaneous localization and mapping. In Proc. Robotics: Science and Systems (RSS), Delft, NL , 2024

    2024

  155. [176]

    Asynchronous Distributed Smoothing and Mapping via On - Manifold Consensus ADMM

    Daniel McGann, Kyle Lassak, and Michael Kaess. Asynchronous Distributed Smoothing and Mapping via On - Manifold Consensus ADMM . In IEEE Int. Conf. on Robotics and Automation, pages 4577--4583, 2024

    2024

  156. [177]

    COSMO - B ench: A benchmark for collaborative slam optimization

    Daniel McGann, Easton R Potokar, and Michael Kaess. COSMO - B ench: A benchmark for collaborative slam optimization. arXiv preprint arXiv:2508.16731, 2025

    2025 arXiv

  157. [178]

    Distributed simultaneous localisation and auto-calibration using gaussian belief propagation

    Riku Murai, Ignacio Alzugaray, Paul HJ Kelly, and Andrew J Davison. Distributed simultaneous localisation and auto-calibration using gaussian belief propagation. IEEE Robotics and Automation Letters, 9 0 (3): 0 2136--2143, 2024 a

    2024

  158. [179]

    Riku Murai, Joseph Ortiz, Sajad Saeedi, Paul H. J. Kelly, and Andrew J. Davison. A Robot Web for Distributed Many - Device Localization . IEEE Trans. on Robotics, 40: 0 121--138, 2024 b . ISSN 1941-0468. doi:10.1109/TRO.2023.3324127

    2024 doi

  159. [180]

    Distributed learn-to-optimize: Limited communications optimization over networks via deep unfolded distributed admm

    Yoav Noah and Nir Shlezinger. Distributed learn-to-optimize: Limited communications optimization over networks via deep unfolded distributed admm. IEEE Transactions on Mobile Computing, 24 0 (4): 0 3012--3024, 2024

    2024

  160. [181]

    Saravanos, and Evangelos A

    Alex Oshin, Rahul Vodeb Ghosh, Augustinos D. Saravanos, and Evangelos A. Theodorou. Deep flexqp: Accelerated nonlinear programming via deep unfolding. In International Conference on Learning Representations, 2026

    2026

  161. [182]

    Neurora: Neural robust rotation averaging

    Pulak Purkait, Tat-Jun Chin, and Ian Reid. Neurora: Neural robust rotation averaging. In European conference on computer vision, pages 137--154. Springer, 2020

    2020

  162. [183]

    Recipe for a general, powerful, scalable graph transformer

    Ladislav Ramp \'a s ek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu, Guy Wolf, and Dominique Beaini. Recipe for a general, powerful, scalable graph transformer. Advances in Neural Information Processing Systems, 35: 0 14501--14515, 2022

    2022

  163. [184]

    Locus 2.0: Robust and computationally efficient lidar odometry for real-time 3d mapping

    Andrzej Reinke, Matteo Palieri, Benjamin Morrell, Yun Chang, Kamak Ebadi, Luca Carlone, and Ali-Akbar Agha-Mohammadi. Locus 2.0: Robust and computationally efficient lidar odometry for real-time 3d mapping. IEEE Robotics and Automation Letters, 7 0 (4): 0 9043--9050, 2022

    2022

  164. [185]

    SE-Sync : A certifiably correct algorithm for synchronization over the special Euclidean group

    David M Rosen, Luca Carlone, Afonso S Bandeira, and John J Leonard. SE-Sync : A certifiably correct algorithm for synchronization over the special Euclidean group. The Int. Journal of Robotics Research, 38(2-3): 0 95--125, 2019. doi:10.1177/0278364918784361

    2019 doi

  165. [186]

    Learning algorithm hyperparameters for fast parametric convex optimization

    Rajiv Sambharya and Bartolomeo Stellato. Learning algorithm hyperparameters for fast parametric convex optimization. arXiv preprint arXiv:2411.15717, 2024

    2024 arXiv

  166. [187]

    End-to-end learning to warm-start for real-time quadratic optimization

    Rajiv Sambharya, Georgina Hall, Brandon Amos, and Bartolomeo Stellato. End-to-end learning to warm-start for real-time quadratic optimization. In Learning for dynamics and control conference, pages 220--234. PMLR, 2023

    2023

  167. [188]

    Deep distributed optimization for large-scale quadratic programming

    Augustinos Saravanos, Hunter Kuperman, Alex Oshin, Arshiya Taj Abdul, Vincent Pacelli, and Evangelos Theodorou. Deep distributed optimization for large-scale quadratic programming. In International Conference on Learning Representations, volume 2025, pages 93580--93619, 2025

    2025

  168. [189]

    Distributed pose graph optimization via continuous riemannian dynamics

    Jaeho Shin, Maani Ghaffari, and Yulun Tian. Distributed pose graph optimization via continuous riemannian dynamics. In Robotics: Science and Systems, 2026

    2026

  169. [190]

    Angular synchronization by eigenvectors and semidefinite programming

    Amit Singer. Angular synchronization by eigenvectors and semidefinite programming. Applied and computational harmonic analysis, 30 0 (1): 0 20--36, 2011

    2011

  170. [191]

    Aneesa Sonawalla, Yulun Tian, and Jonathan P. How. Overlapping domain decomposition for distributed pose graph optimization. arXiv preprint arXiv:2603.03499, 2026

    2026

  171. [192]

    Scale drift-aware large scale monocular slam

    Hauke Strasdat, J Montiel, Andrew J Davison, et al. Scale drift-aware large scale monocular slam. Robotics: science and Systems VI, 2 0 (3): 0 7, 2010

    2010

  172. [193]

    A benchmark for the evaluation of rgb-d slam systems

    J \"u rgen Sturm, Nikolas Engelhard, Felix Endres, Wolfram Burgard, and Daniel Cremers. A benchmark for the evaluation of rgb-d slam systems. In 2012 IEEE/RSJ international conference on intelligent robots and systems, pages 573--580. IEEE, 2012

    2012

  173. [194]

    Rotation averaging with attention graph neural networks

    Joshua Thorpe, Ruwan Tennakoon, and Alireza Bab-Hadiashar. Rotation averaging with attention graph neural networks. arXiv preprint arXiv:2010.06773, 2020

    2010 arXiv

  174. [195]

    Yulun Tian, Alec Koppel, Amrit Singh Bedi, and Jonathan P. How. Asynchronous and Parallel Distributed Pose Graph Optimization . IEEE Robotics and Automation Letters, 5(4): 0 5819--5826, October 2020. ISSN 2377-3766. doi:10.1109/LRA.2020.3010216

    2020 doi

  175. [196]

    Rosen, and Jonathan P

    Yulun Tian, Kasra Khosoussi, David M. Rosen, and Jonathan P. How. Distributed Certifiably Correct Pose - Graph Optimization . IEEE Trans. on Robotics, 37(6): 0 2137--2156, December 2021. ISSN 1941-0468. doi:10.1109/TRO.2021.3072346

    2021 doi

  176. [197]

    Kimera-multi: Robust, distributed, dense metric-semantic slam for multi-robot systems

    Yulun Tian, Yun Chang, Fernando Herrera Arias, Carlos Nieto-Granda, Jonathan P How, and Luca Carlone. Kimera-multi: Robust, distributed, dense metric-semantic slam for multi-robot systems. IEEE Transactions on Robotics, 38 0 (4), 2022

    2022

  177. [198]

    Vggt: Visual geometry grounded transformer

    Jianyuan Wang, Minghao Chen, Nikita Karaev, Andrea Vedaldi, Christian Rupprecht, and David Novotny. Vggt: Visual geometry grounded transformer. In Proceedings of the Computer Vision and Pattern Recognition Conference, pages 5294--5306, 2025

    2025

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.