mlsanityData to 14 Oct 2026

DeepFlow: Two Convergent Differentiable Approaches for Pairwise Conditional Random Fields

arXiv 2610.16546 ↗First posted 12 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Basic probabilistic models form the basis of modern deep learning largely by defining the final activation layer of a network and allowing the networks outputs to be interpreted through a probabilistic lens. By increasing the complexity of these final activation layers to include features such as spatial regularisation, allow for these models to improve in performance without requiring significantly more data. The challenge however is to ensure that these more complex probabilistic graphical models adapt well to being used in tandem with deep learning, that is, ensuring they converge and have meaningful derivatives. The goal of this paper is to show two algorithms with provable convergence properties to allow this type of regularisation for image and signal classification models. Through both rigorous mathematical analysis and in silico experiments, we can show the differing performance between these solution types.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 12 Oct 2026.

Builds on

8 of 19 references.

References · 8

  1. 2017Generalised Dice overlap as a deep learning loss function for highly unbalanced segmentationscited by 620
  2. 2020A survey of loss functions for semantic segmentationcited by 217
  3. 2015Conditional Random Fields as Recurrent Neural Networkscited by 214
  4. 2020Neural Enhanced Belief Propagation on Factor Graphscited by 57
  5. 2024Neural Markov Random Field for Stereo Matchingcited by 40
  6. 2020Belief Propagation Neural Networkscited by 33
  7. 2015Higher Order Conditional Random Fields in Deep Neural Networkscited by 26
  8. 2023gcDLSeg: Integrating Graph-cut into Deep Learning for Binary Semantic Segmentationcited by 3

Built on by

Not cited yet.