Continuous-domain assignment flows

Assignment flows denote a class of dynamical models for contextual data labelling (classification) on graphs. We derive a novel parametrisation of assignment flows that reveals how the underlying information geometry induces two processes for assignment regularisation and for gradually enforcing una...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of applied mathematics Vol. 32; no. 3; pp. 570 - 597
Main Authors SAVARINO, F., SCHNÖRR, C.
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.06.2021
Subjects
Online AccessGet full text
ISSN0956-7925
1469-4425
DOI10.1017/S0956792520000273

Cover

Loading…
More Information
Summary:Assignment flows denote a class of dynamical models for contextual data labelling (classification) on graphs. We derive a novel parametrisation of assignment flows that reveals how the underlying information geometry induces two processes for assignment regularisation and for gradually enforcing unambiguous decisions, respectively, that seamlessly interact when solving for the flow. Our result enables to characterise the dominant part of the assignment flow as a Riemannian gradient flow with respect to the underlying information geometry. We consider a continuous-domain formulation of the corresponding potential and develop a novel algorithm in terms of solving a sequence of linear elliptic partial differential equations (PDEs) subject to a simple convex constraint. Our result provides a basis for addressing learning problems by controlling such PDEs in future work.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0956-7925
1469-4425
DOI:10.1017/S0956792520000273