COREY: Entropy-Guided Runtime Chunk Scheduling for Selective Scan Kernels
Abstract
Mamba selective state space models (SSMs) provide linear-time sequence modeling but remain sensitive to selective-scan chunk scheduling. We present COREY, a \emph{concept-and-feasibility} runtime scheduler that maps fixed-bin activation entropy to chunk size. We evaluate COREY in three tiers: a prototype cost model, real-checkpoint kernel timing, and routed end-to-end ablations on modern GPUs. At the kernel level, a calibrated rule, , recovers the locally optimal chunk and matches a one-time static oracle, yielding lower latency than an unoptimized baseline on a consumer GPU and -- lower latency on a data-center accelerator. Routing this choice into a patched live scan kernel closes the engineering loop without improving end-to-end speed: in unified routed ablations, the best static chunk outperforms all entropy-guided and proxy schedulers. Sampled-histogram COREY adds overhead; a guarded fallback to Static-512 reduces this to ; and a lightweight sequence-length-keyed table further reduces it to . However, both remain slower than the static oracle because they retain scheduling cost. On an 80-prompt LongBench subset, passive and routed inference are exactly output-equivalent, with greedy-token agreement and zero metric deltas. A mixed-regime study shows that a single sequence-length rule matches the per-regime chunk oracle for balanced serving. COREY is therefore validated as a quality-preserving scheduling prototype, but current entropy statistics are not a robust throughput win over static chunk tuning on measured SSM checkpoint workloads. SourceCode: https://github.com/mabo1215/COREY_Transformer/.
Cite
@article{arxiv.2604.10597,
title = {COREY: Entropy-Guided Runtime Chunk Scheduling for Selective Scan Kernels},
author = {Bo Ma and Jinsong Wu and Weiqi Yan},
journal= {arXiv preprint arXiv:2604.10597},
year = {2026}
}