Rethinking Prediction Horizons: Decoupling Model Queries from State Updates in Few-Step MeanFlow
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2610.26179v2 Announce Type: replace Abstract: Hierarchical world models plan over long horizons by passing predicted states from a coarse model to a lower-level controller. Choosing these state...
arXiv:2609.39934v1 Announce Type: cross Abstract: Checkpoint selection in domain generalization often relies on source-validation accuracy, yet the selected checkpoint need not provide reliable proba...
arXiv:2609.36569v1 Announce Type: cross Abstract: Checkpoint selection is a routine decision in supervised fine-tuning (SFT): training produces multiple checkpoints, but only one is retained. Yet fix...
Decision‑FLIP is a budget‑free pruning framework for Gaussian occupancy models that scores each persistent Gaussian row by how many voxel decisions change when the row is removed. It uses a guarded Otsu split on the log‑score distribution to select survivors without a target, then compiles the survivors into a smaller checkpoint, reducing bank size and latency. Across multiple model‑dataset settings, the method removes 12–79% of rows, cuts latency by 7–45%, and saves up to 8.0% of whole‑model compute while keeping semantic mIoU within 0.18 points of the original.
arXiv:2606. 30852v1 Announce Type: new Abstract: Reasoning models spend different amounts of useful computation across instances, but it remains unclear when a learned stopping rule improves over simple confidence or convergence thresholds.
arXiv:2607. 07665v1 Announce Type: new Abstract: Classifier-free guidance (CFG) is the standard way to strengthen class-conditioning in diffusion and flow-matching samplers, yet at large guidance it oversaturates and destabilizes, symptoms practitioners suppress with more steps or limited-interval schedules.