Riemannian Patch Assignment Gradient Flows

This paper introduces patch assignment flows for metric data labeling on graphs. Labelings are determined by regularizing initial local labelings through the dynamic interaction of both labels and label assignments across the graph, entirely encoded by a dictionary of competing labeled patches and mediated by patch assignment variables. Maximal consistency of patch assignments is achieved by geometric numerical integration of a Riemannian ascent flow, as critical point of a Lagrangian action functional. Experiments illustrate properties of the approach, including uncertainty quantification of label assignments.

@article{gonzalez-alvarado2025_2504.13024,
  title={ Riemannian Patch Assignment Gradient Flows },
  author={ Daniel Gonzalez-Alvarado and Fabio Schlindwein and Jonas Cassel and Laura Steingruber and Stefania Petra and Christoph Schnörr },
  journal={arXiv preprint arXiv:2504.13024},
  year={ 2025 }
}