Metraipolis › archive › dc_2b25af706bdc
Hierarchy-GBP: Accelerating Factor Graph Inference via Abstraction and Recovery — arXiv:2610.06978
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06978
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:42:09.643Z
- SHA-256 of the archived text
aabcb281a1d500e86c19a5321661394a84eb76caaf0dfe704c0b99d75b6f14f3- Stable URL of this page
https://metraipolis.com/documento/dc_2b25af706bdc
How to cite
Hierarchy-GBP: Accelerating Factor Graph Inference via Abstraction and Recovery — arXiv:2610.06978 — arXiv (en), https://arxiv.org/abs/2610.06978 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2b25af706bdc (Metraipolis archive dc_2b25af706bdc, sha256 aabcb281a1d500e86c19a5321661394a84eb76caaf0dfe704c0b99d75b6f14f3)
BibTeX
@misc{dc2b25af706bdc,
title = {Hierarchy-GBP: Accelerating Factor Graph Inference via Abstraction and Recovery — arXiv:2610.06978},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06978},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2b25af706bdc; sha256 aabcb281a1d500e86c19a5321661394a84eb76caaf0dfe704c0b99d75b6f14f3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06978. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Gaussian Belief Propagation (GBP) is a distributed inference algorithm that passes messages in graphical models, making it attractive for scalable spatial intelligence. However, we find GBP most effective locally: it rapidly smooths message errors that vary sharply between neighbor variables, but corrects global errors across distant graph regions incrementally through long-range message propagations. We propose Hierarchy-GBP (H-GBP), an iterative, two-stage framework that accelerates GBP by first solving these global errors with a coarse graph approximation (abstraction) and projecting the results back to the original graph (recovery), then refining the remaining local errors with GBP. We prove H-GBP convergence to the optimum by deriving the combined matrix operator of our abstraction and recovery steps and analyzing its spectral radius. Experiments on linear sparse graphs show that H-GBP converges fundamentally faster than standard GBP. Moreover, we validate H-GBP on two important spatial problems: Pose Graph Optimization (PGO) and Bundle Adjustment (BA). H-GBP markedly accelerates large-scale PGO and achieves state-of-the-art runtime across all tested BA scales. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Machine Learning (cs.LG); Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2610.06978 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T11:19:24.866Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).