arXiv AI

Directional Attention Guidance for Diffusion Models via Sparse Hopfield Retrieval

arXiv Machine Learning
Sep 24

Attention Routing Stabilizes Early: Working-Set Inference for Recurrent Language Models

The paper investigates how attention dynamics evolve across recurrent depth in language models, finding that attention support stabilizes early while hidden states and outputs take longer. It proposes WISE, a training‑free method that uses full attention in early steps and then reuses the discovered sparse working set for later steps, preserving performance on multi‑hop QA tasks. Experiments show that WISE maintains quality up to 2K context, offers measurable speedups, and highlights the importance of recurrent discovery of attention support.

By Ke Wan, Chen Chen
arXiv AI
Jul 29

PreDiff-LM: Pretrained Discrete Masked Diffusion Language Modeling with Hybrid Attention

arXiv:2607. 25157v1 Announce Type: new Abstract: Discrete masked diffusion language models support bidirectional generation and infilling, but adapting pretrained autoregressive (AR) transformers requires reconciling causal pretraining with bidirectional denoising.

By Zhengtao Yao, Runhao Li, Xupeng Chen, Jiayi Cheng, Chenqian Le, Michael Yue, Jesson Wang, Siheng Wang, Guang Yang, Haoyan Xu, Chenhao Wei, Zhengqing Yuan, Youran Shen, Yanfang Ye, Junhao Dong
arXiv Computer Vision
Sep 4

ToPO: Token-Conditioned Preference Routing for Attention-Based Latent Diffusion Models

ToPO (Token-Oriented Preference Optimization) is a method for attention-based latent diffusion models that constructs a per‑minibatch, detached, separable spatial‑temporal route using branchwise squared‑residual contrast from a frozen reference denoiser. It employs preferred‑branch cross‑attention with content tokens to modulate spatial factors and adds an auxiliary pixel‑midpoint ordering term, all without local labels or a learned reward model. In experiments with shared update schedules, ToPO outperforms Diffusion‑DPO on five SD‑1.5 metrics and on HPSv2, ImageReward, and CLIP for SDXL, and achieves higher raw win shares in a blind SDXL A/B study.

By Juntao Xu, Shihong Li, Hoi Fan Au, Ning Zhu
arXiv Machine Learning
Sep 3

CRISP: Cliff-awaRe Input-adaptive Sparse Prefilling with Structural-Mass-Motivated Routing

CRISP (Cliff-awaRe Input-adaptive Sparse Prefilling) is a new method for long-context LLM inference that replaces costly quadratic attention prefilling with a dynamic, input-adaptive sparse routing scheme. It introduces a structural proxy, C_struct, to directly read routing decisions from the proxy attention map, eliminating the need for pooled matrix multiplication and KL divergence. Additionally, CRISP addresses the post-softmax mass cliff by using a sink-aware threshold based on the noise floor, theoretically reducing background noise accumulation to O(n). Empirical results on InfiniteBench, RULER, and LongBench show that CRISP outperforms existing sparse methods and can match or exceed exact dense attention, achieving up to a 5.30× speedup at 512k tokens and significant gains on retrieval-heavy tasks.

By Huu Huy Nguyen, Chien Van Nguyen, Franck Dernoncourt, Ryan A. Rossi, Linh Ngo Van, Jieyang Chen, Thien Huu Nguyen