arXiv Machine Learning By Zichen Zhong, Haoliang Sun, Yukun Zhao, Yongshun Gong, Yilong Yin

Riemannian MeanFlow for One-Step Generation on Manifolds

Read the original on arXiv Machine Learning →

arXiv:2603. 10718v3 Announce Type: replace Abstract: Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE.

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 Machine Learning.

arXiv AI
Jun 9

Riemannian-Manifold Steering: Geometry-Aware Generative Autoencoders for Label-Free Steering

arXiv:2605. 24942v2 Announce Type: replace-cross Abstract: Steering a language model - intervening on its internal activations to change downstream behaviour - has recently expanded beyond linear interpolation to nonlinear methods such as angular and kernelized steering, which define intervention transformations without learning an explicit geometry over paths in activation space.

By Narmeen Oozeer, Shivam Raval, Philip Quirke, Manikandan Ravikiran, Jeff Phillips, Shriyash Upadhyay, Amirali Abdullah
arXiv Computer Vision
Sep 22

Classifier-Free Guidance in Flow Matching: Non-Autonomous Potentials, Overshoot, and Posterior-Mean Control

The paper studies classifier‑free guidance (CFG) in Flow Matching, showing that strong guidance can distort the generated distribution by shifting the mean and concentrating trajectories. By interpreting Flow Matching as a time‑varying gradient flow, the authors explain how CFG reshapes the underlying potential and propose a training‑free method, Posterior‑Mean‑Capped CFG (PMC‑CFG), that adaptively limits guidance to the strongest feasible level. Experiments on synthetic and large‑scale image‑generation tasks demonstrate that PMC‑CFG reduces distortion and concentration while improving the alignment–diversity trade‑off, especially when nominal guidance is large.

By Jishen Peng, Zheng Ma
arXiv AI
Sep 2

Training-Free Refinement of Flow Matching with Divergence-based Sampling

The paper introduces Flow Divergence Sampler (FDS), a training‑free method that refines intermediate states in flow‑matching models by using the divergence of the marginal velocity field to detect and correct misguidance toward low‑density regions. FDS operates during inference, requires no additional training, and can be applied as a plug‑and‑play module with standard solvers and existing flow backbones. Experiments show that FDS consistently improves fidelity in tasks such as text‑to‑image synthesis and inverse problems.

By Yeonwoo Cha, Jaehoon Yoo, Semin Kim, Yunseo Park, Jinhyeon Kwon, Seunghoon Hong