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.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
An overview revisits LoRA variants by categorizing advances in architectural design, efficient optimization, and applications while linking them to classical signal processing tools for principled fine-tuning.
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.
-
Low-Rank Adaptation Redux for Large Models
An overview revisits LoRA variants by categorizing advances in architectural design, efficient optimization, and applications while linking them to classical signal processing tools for principled fine-tuning.