arXiv AI By Yansen Han, Shengyi Liao, Yuanxing Zhang, Pengfei Wan, Tao Lin

Manifold Drift in Flow Preference Optimization: A Root Cause of Reward Hacking

Read the original on arXiv AI →

arXiv:2608. 20011v1 Announce Type: new Abstract: Preference optimization is a standard alignment method for generative models, yet extending it to continuous-time dynamics remains non-trivial.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Oct 2

PMosFM: Preconditioned Manifold Matching for One-Step Physics-Constrained Generation

PMosFM introduces a preconditioned manifold matching framework that enables one‑step physics‑constrained generation by encoding constraints in a manifold decoder. The method learns transport in intrinsic coordinates, eliminating the need for residual losses or trajectory unrolling, and employs a geometric preconditioner and covariance transform to improve conditioning. Experiments demonstrate reduced training and sampling time compared to multi‑step baselines while maintaining comparable physical and distributional fidelity.

By Zhangyong Liang, Haibin Ling
arXiv Machine Learning
Jun 10

Exploring the Design Space of Reward Backpropagation for Flow Matching

arXiv:2606. 11075v1 Announce Type: new Abstract: Aligning text-to-image flow matching models with human preferences via direct reward backpropagation is sample-efficient but hampered by two well-known pathologies: activations cannot be stored across the full sampling trajectory at modern model scale, and chained Jacobian products across steps inflate the reward gradient as it travels back to early indices.

By Ruoyu Wang, Boye Niu, Xiangxin Zhou, Yushi Huang, Tongliang Liu, Chi Zhang
arXiv AI
Oct 1

Fenchel Tilting: Weighted Correction for Efficient Finetuning of Generative Models

Fenchel Tilt Flow Control (FTFC) is a new method for fine‑tuning pretrained generative models to arbitrary preference functions. It decouples utility optimization from model fitting by first learning reward and density‑ratio weights on pretrained samples, then freezing these weights to adjust a diffusion or flow model in a single importance‑weighted stage. The approach supports general f‑divergence penalties, achieves exact duality for concave utilities, and demonstrates up to 20× efficiency gains while outperforming baselines on image and molecule generation tasks.

By Maksim Bobrin, Maksim Zhdanov, Dmitry Dylov