Factor graph optimization problems can be lifted via Shor's relaxation and Burer-Monteiro factorization to produce certifiable estimators that preserve the original factor graph connectivity and can be implemented with existing libraries.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
CONDITIONAL 2representative citing papers
Develops safe particle flow for constrained variational inference by applying control barrier functions to probability densities with theoretical guarantees.
citing papers explorer
-
Certifiable Factor Graph Optimization
Factor graph optimization problems can be lifted via Shor's relaxation and Burer-Monteiro factorization to produce certifiable estimators that preserve the original factor graph connectivity and can be implemented with existing libraries.
-
Constrained Variational Inference via Safe Particle Flow
Develops safe particle flow for constrained variational inference by applying control barrier functions to probability densities with theoretical guarantees.