KTH Royal Institute of Technology(皇家理工学院);Nordita, Nordic Institute for Theoretical Physics(北欧理论物理研究所);Hasso Plattner Institute, University of Potsdam(波茨坦大学哈索 Plattner 研究院);Trinity College Dublin(都柏林三一学院);Hangzhou Institute of Technology, Xidian University(西安电子科技大学杭州研究院);The Hong Kong University of Science(香港科学大学);Mohamed bin Zayed University of Artificial Intelligence(莫莫丁·本·扎耶德人工智能大学)
Flow-based generative models can be viewed through a physics lens: sampling transports a particle from noise to data by integrating a learned velocity field, and each sample corresponds to a trajectory with its own dynamical effort. Motivated by classical mechanics, we introduce Kinetic Path Energy (KPE), an action-like, per-sample diagnostic that measures the accumulated kinetic effort along an ordinary differential equation (ODE) trajectory. Empirically, KPE exhibits two robust correspondences: {i} higher KPE predicts stronger semantic fidelity; {ii} high-KPE trajectories land in sparse representation regions. We further provide theoretical guarantees linking trajectory energy to data sparsity. Paradoxically, this correlation is non-monotonic. At sufficiently high energy, generation can degenerate into memorization. Leveraging the closed-form formula of empirical flow matching, we show that extreme energies drive trajectories toward near-copies of training examples. This yields a Goldilocks principle and motivates Kinetic Trajectory Shaping (KTS), a training-free two-phase inference strategy that boosts early motion and enforces a late-time soft landing, reducing memorization and improving generation quality across benchmark tasks.
The Generation Phases of Flow Matching: a Denoising Perspective
ENS de Lyon, CNRS, Université Claude Bernard Lyon 1, Inria, LIP, UMR 5668(里昂大学、国家科学研究中心、克莱尔伯恩大学 Lyon 1、Inria、LIP、UMR 5668);Technische Universität Berlin(柏林技术大学);Inria, ENS de Lyon, CNRS, Université Claude Bernard Lyon 1, LIP, UMR 5668(Inria、里昂大学、国家科学研究中心、克莱尔伯恩大学 Lyon 1、LIP、UMR 5668)
An Explicit Surrogate for Gaussian Mixture Flow Matching with Wasserstein Gap Bounds
Université Paris-Saclay, Inria, CIAMS(巴黎-萨克雷大学, 法国国家信息与自动化研究所, CIAMS);Department of Electrical Engineering and Computer Science, University of Quebec in Trois-Rivieres (UQTR)(魁北克大学三河城分校电气工程与计算机科学系)
Cross-View Feature Matching: Survey, Benchmarking, and Foundation-Model Perspectives
School of Automation, Southeast University(东南大学自动化学院);School of Computer Science and Technology, Tongji University(同济大学计算机科学与技术学院);Institute of Artificial Intelligence, University of Science and Technology Beijing(北京科技大学人工智能研究院);School of Robotics, Wuhan University(武汉大学机器人学院);Graduate School of Information, Production and Systems, Waseda University(早稻田大学信息生产系统研究科)
Rethinking Deep Research from the Perspective of Web Content Distribution Matching
School of Computer science and engineering, Sun Yat-sen University(计算机科学与工程学院,中山大学);CSE, The Hong Kong University of Science and Technology(计算机科学与工程系,香港科学与技术大学);Sydney AI Centre, The University of Sydney(悉尼人工智能中心,悉尼大学);Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University(数据科学与人工智能系,香港理工大学);DSA Thrust, The Hong Kong University of Science and Technology (GuangZhou)(数据科学与技术 thrust,香港科学与技术大学(广州));TMLR Group, Department of Computer Science, Hong Kong Baptist University(TMLR 组,计算机科学系,香港 Baptist 大学)