about
Zero-Flow Encoders (arxiv.org)
1 point by E-Reverance 89 days ago | hide | past | pdf | discuss on HN

In plain words: A flow model that learns to turn one data spread into another predicts zero movement halfway through only when the two spreads match. Using that test, it found the variables that fully determine a target and learned features without labels on simulated and real data.

Abstract

Flow-based methods have achieved significant success in various generative modeling tasks, capturing nuanced details within complex data distributions. However, few existing works have exploited this unique capability to resolve fine-grained structural details beyond generation tasks. This paper presents a flow-inspired framework for representation learning. First, we demonstrate that a rectified flow trained using independent coupling is zero everywhere at $t=0.5$ if and only if the source and target distributions are identical. We term this property the \emph{zero-flow criterion}. Second, we show that this criterion can certify conditional independence, thereby extracting \emph{sufficient information} from the data. Third, we translate this criterion into a tractable, simulation-free loss function that enables learning amortized Markov blankets in graphical models and latent representations in self-supervised learning tasks. Experiments on both simulated and real-world datasets demonstrate the effectiveness of our approach. The code reproducing our experiments can be found at: https://github.com/probabilityFLOW/zfe.

Yakun Wang, Leyang Wang, Song Liu, Taiji Suzuki
arXiv:2602.00797 · stat.ML, cs.LG · submitted Jan 31, 2026 · updated Jun 7, 2026
abstract · pdf · html · Yakun Wang and Leyang Wang contributed equally to this work; As published at ICML 2026

add comment on HN