mlsanityData to 14 Oct 2026

Dual NUP Representations and Min-Maximization in Factor Graphs

arXiv 2501.12113 ↗First posted 21 Jan 2025stat.ML cs.LG cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

Normals with unknown parameters (NUP) can be used to convert nontrivial model-based estimation problems into iterations of linear least-squares or Gaussian estimation problems. In this paper, we extend this approach by augmenting factor graphs with convex-dual variables and pertinent NUP representations. In particular, in a state space setting, we propose a new iterative forward-backward algorithm that is dual to a recently proposed backward-forward algorithm.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 21 Jan 2025.

Builds on

3 of 20 references.

References · 3

  1. 2024Clarabel: An interior-point solver for conic programs with quadratic objectivescited by 44
  2. 2014Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problemscited by 25
  3. 2020Operator splitting for a homogeneous embedding of the linear complementarity problemcited by 21

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.