Ergodic Generative Flows

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Brunswic, Leo Maxime, Clemente, Mateo, Yang, Rui Heng, Sigal, Adam, Rasouli, Amir, Li, Yinchuan
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909602652618752
author Brunswic, Leo Maxime
Clemente, Mateo
Yang, Rui Heng
Sigal, Adam
Rasouli, Amir
Li, Yinchuan
author_facet Brunswic, Leo Maxime
Clemente, Mateo
Yang, Rui Heng
Sigal, Adam
Rasouli, Amir
Li, Yinchuan
contents Generative Flow Networks (GFNs) were initially introduced on directed acyclic graphs to sample from an unnormalized distribution density. Recent works have extended the theoretical framework for generative methods allowing more flexibility and enhancing application range. However, many challenges remain in training GFNs in continuous settings and for imitation learning (IL), including intractability of flow-matching loss, limited tests of non-acyclic training, and the need for a separate reward model in imitation learning. The present work proposes a family of generative flows called Ergodic Generative Flows (EGFs) which are used to address the aforementioned issues. First, we leverage ergodicity to build simple generative flows with finitely many globally defined transformations (diffeomorphisms) with universality guarantees and tractable flow-matching loss (FM loss). Second, we introduce a new loss involving cross-entropy coupled to weak flow-matching control, coined KL-weakFM loss. It is designed for IL training without a separate reward model. We evaluate IL-EGFs on toy 2D tasks and real-world datasets from NASA on the sphere, using the KL-weakFM loss. Additionally, we conduct toy 2D reinforcement learning experiments with a target reward, using the FM loss.
format Preprint
id arxiv_https___arxiv_org_abs_2505_03561
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Ergodic Generative Flows
Brunswic, Leo Maxime
Clemente, Mateo
Yang, Rui Heng
Sigal, Adam
Rasouli, Amir
Li, Yinchuan
Machine Learning
Artificial Intelligence
Differential Geometry
Dynamical Systems
37A25, 68T07, 68W20, 68Q87, 68T99
Generative Flow Networks (GFNs) were initially introduced on directed acyclic graphs to sample from an unnormalized distribution density. Recent works have extended the theoretical framework for generative methods allowing more flexibility and enhancing application range. However, many challenges remain in training GFNs in continuous settings and for imitation learning (IL), including intractability of flow-matching loss, limited tests of non-acyclic training, and the need for a separate reward model in imitation learning. The present work proposes a family of generative flows called Ergodic Generative Flows (EGFs) which are used to address the aforementioned issues. First, we leverage ergodicity to build simple generative flows with finitely many globally defined transformations (diffeomorphisms) with universality guarantees and tractable flow-matching loss (FM loss). Second, we introduce a new loss involving cross-entropy coupled to weak flow-matching control, coined KL-weakFM loss. It is designed for IL training without a separate reward model. We evaluate IL-EGFs on toy 2D tasks and real-world datasets from NASA on the sphere, using the KL-weakFM loss. Additionally, we conduct toy 2D reinforcement learning experiments with a target reward, using the FM loss.
title Ergodic Generative Flows
topic Machine Learning
Artificial Intelligence
Differential Geometry
Dynamical Systems
37A25, 68T07, 68W20, 68Q87, 68T99
url https://arxiv.org/abs/2505.03561