arXiv Machine Learning

Entropy Can Flow, or It Can Guide. Be Entropy. LEDFlow: Introducing Entropy-guided Generation Order into Uniform Discrete Flow

arXiv AI
Sep 2

Flow Reasoning Models: Turning Flows Into Efficient Recurrent Reasoners

Flow Reasoning Models (FRMs) are a new framework that turns continuous flow models into efficient recurrent reasoners for structured tasks. By self‑conditioning a flow model on its own past outputs, FRMs iteratively refine solutions, allowing parallel decision making and revision. The authors introduce Fixed‑Point Forcing (FPF) to mitigate exposure bias at deeper recursion, and report near‑perfect solve rates on Sudoku‑Extreme, Zebra, and Maze‑Unique, outperforming existing masked‑diffusion and specialized baselines while using far fewer inference FLOPs.

By Alec Helbling, Andrey Bryutkin, Mauro Martino, Duen Horng Chau, Nima Dehmamy, Hendrik Strobelt
arXiv AI
Sep 28

Selective Amortization of Full-Budget Counterfactual Reasoning for Visual Token Communication

The paper introduces ACV-Gate, an adaptive framework for generative image communication that selectively evaluates candidate semantic tokens to reduce encoder computation while maintaining reconstruction quality. ACV-Gate uses a set-aware student model trained on terminal advantages and regrets to rank tokens, and a selective refinement mechanism that limits exact evaluations to a bounded candidate set, controlled by cost-based thresholds. Experiments on CIFAR-10, STL-10, and 384×384 images show that ACV-Gate improves PSNR by up to 0.636 dB at 0.20 bpp and reduces candidate evaluations to about 27.6% of the exact-full method.

By Qinglei Qi, Zhihe Liang, Fengzhan Jing, Shenao Zhu, Lei Zhang, Chenyang Zhang, Shuqing He, Jia Guo
arXiv AI
Jun 30

Flow Reasoning Models: Scaling Reasoning Through Iterative Self-Refinement

arXiv:2606. 29150v1 Announce Type: new Abstract: Discrete flow models have recently shown promising performance on few-step text generation; however, when naively applied to structured reasoning tasks such as Sudoku and Zebra puzzles, they converge confidently to incorrect answers (solving only $\sim$36% of Sudoku puzzles).

By Alec Helbling, Andrey Bryutkin, Mauro Martino, Nima Dehmamy, Hendrik Strobelt
Hugging Face Trending Papers
Jul 26

PathSelect: Sequential Token Selection for Whole Slide Pathology

Gigapixel Whole-Slide Images (WSIs) present a fundamental computational bottleneck for vision-language models (VLMs) due to extreme sequence lengths. Existing approaches predominantly rely on spatial sampling or training-free pruning, which risk diluting weak but informative signals, leading to the loss of critical diagnostic evidence due to the spatially diffuse nature of pathological cues.

arXiv Machine Learning
Aug 31

DARTS: Decoder-Aware Representation Tuning via Surgery for Model Merging

The paper introduces DARTS, a method for tuning decoder representations during model merging. It addresses representation bias in autoregressive decoders by using an entropy‑weighted L1 loss and a per‑position additive bias to correct errors that accumulate across token positions. Experiments on code generation, mathematical reasoning, and instruction following with Llama‑2‑7B show that DARTS improves performance over standard surgery while adding only 0.1% extra parameters.

By Aaryan Ajay Sharma, Sai Nishanth Padala, Seganrasan Subramanian
arXiv AI
Jun 2

Video Reasoning without Training

arXiv:2510. 17045v2 Announce Type: replace-cross Abstract: Video reasoning using Large Multimodal Models (LMMs) relies on costly reinforcement learning (RL) and verbose chain-of-thought, resulting in substantial computational overhead during both training and inference.

By Deepak Sridhar, Kartikeya Bhardwaj, Jeya Pradha Jeyaraj, Nuno Vasconcelos, Ankita Nayak, Harris Teague
arXiv AI
Aug 28

PACE: A Unified Condense-and-Extract Paradigm for Fast VLM Inference

PACE introduces a training‑free Condense‑and‑Extract framework that speeds up Vision‑Language Model inference by first adaptively downsampling visual inputs before encoding and then selectively retaining essential tokens during decoding. The Adaptive Pixel Compressor (APC) reduces encoder workload while preserving global context, and the Dynamic Dual‑Attention Extractor (DDAE) keeps task‑critical details by fusing visual and language signals. Applied to Qwen2.5‑VL‑7B, PACE maintains 93.8% of performance using only 10% of visual tokens, achieving a 3.1× speedup in time to first token.

By Junjie Liu, Shengyuan Ye, Xu Chen