arXiv Machine Learning By Bartolo Dazzini, Giovanni Conforti, Alain Durmus, Aram-Alexandre Pooladian

Trajectory inference via Acceleration Matching

Read the original on arXiv Machine Learning →

arXiv:2608. 03916v1 Announce Type: new Abstract: Trajectory inference is a fundamental problem in many scientific domains: given a collection of unpaired snapshots of observations at discrete time points, the goal is to generate smooth trajectories that best resemble and interpolate the data.

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 Computer Vision
Aug 24

Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

The paper introduces Difficulty-Calibrated Flow Matching, a method that adapts the noise-to-data interpolation schedule in Conditional Flow Matching based on a pilot run’s loss profile. By setting the schedule to the quantile function of this difficulty profile, the training trajectory spends more time where the velocity is hardest to learn. Experiments on CIFAR-10, MNIST, and Fashion‑MNIST show that this calibrated path achieves the best FID on CIFAR‑10 and outperforms all fixed schedules in large‑batch, few‑update settings, where compute is most limited.

By Airin Akter Tania, Md Raihan Khan
Hugging Face Trending Papers
Jul 13

Velocity Scheduled Flow Matching

Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carries an implicit choice: the sample moves at constant speed throughout the trajectory.

arXiv AI
3d ago

Efficient Multi-Modal Planning with Reward-Guided Preference Optimization for Autonomous Driving

Efficient Multi-Modal Planning with Reward-Guided Preference Optimization for Autonomous Driving proposes EMPlan, a hybrid trajectory planning method that combines sparse anchors with an offset refinement module for low-latency, high-accuracy predictions. The approach uses a two-stage training paradigm—pretraining followed by reward-guided fine-tuning—to improve safety without extra inference cost, leveraging rule-based reward signals and unpaired preference supervision. EMPlan is evaluated on the non-reactive NAVSIM benchmark, achieving a favorable balance between planning accuracy and efficiency under real-time constraints.

By Chenglin Chen, Lujia Wang, Xinhu Zheng, Jun Ma, Haoang Li