3 papers
math.OC2026
An Exact Algorithm for the Max-Min Covering Location Blocker Problem
Yun-Tian Zhang, Chen Chen, Fabio Furini +1
We introduce the Max-Min Covering Location Blocker Problem, a bilevel optimization problem in which a leader blocks a minimum-cost set of candidate locations so that the optimal co…
cs.CL2026
MORSE: Multi-Context Ordering via Reverse Scoring for Evidence-Preserving Compression
Ke Wan, Yifan Wang, Liheng Lai +1
Likelihood-based context compression can account for cross-context redundancy through sequential scoring, but this makes compression outcomes sensitive to context order. We show th…
cs.CL2026
Attention Routing Stabilizes Early: Working-Set Inference for Recurrent Language Models
Ke Wan, Chen Chen
Recurrent language models repeatedly apply shared network blocks to refine latent representations, but standard inference recomputes global attention at every recurrent step. We st…