arXiv:2607. 19802v1 Announce Type: cross Abstract: Sequential recommendation (SR) models capture continuously observed behavior, but a returning user may have no interactions for months or years.
By Jiandong Ding, Tianying Liu, Fuyuan Liu, Huijie Qin, Tiandeng Wu
arXiv:2603. 22016v3 Announce Type: replace-cross Abstract: Large Reasoning Models (LRMs) often reach a correct solution before their long Chain-of-Thought trace ends, yet continue with redundant verification, repeated attempts, or unnecessary exploration that wastes computation and can even overturn the correct answer.
By Xinyan Wang, Xiaogeng Liu, Ming Pei, Chaowei Xiao
SequenceO1 is an end‑to‑end framework that enables ultra‑long (up to 100K interactions) sequence modeling for recommendation systems. It compresses raw user histories into a fixed‑size sketch using Sketch Attention and then models short‑term and long‑term interests with Target‑to‑History Cross Attention. The system incorporates low‑rank caching, batching, pipeline lift, and a FlashSA kernel to keep training and inference efficient, achieving consistent offline and online performance gains when deployed at full traffic on Douyin.
By Lin Guan, Jia-Qi Yang, Zhishan Zhao, Jiaqi Huang, Hangyu Wang, Longbin Li, Beichuan Zhang, Haonan Jiang, Jinan Ni, Xiangyu Fan, Xiaowen Li, Ziyao Ren, Yuhang Qi, Xiaolong Zhu, Xuanyuan Luo, Qiwei Chen, Yi Cheng, Lele Yu
The paper presents a strictly causal streaming video anomaly detector that updates a fixed‑size state in constant time per frame, eliminating the need for clip buffering or lookahead. Its core is a diagonal linear state‑space recurrence with a decay gate, trained via self‑supervised next‑embedding prediction on a frozen visual backbone. The authors derive a closed‑form link between the recurrence’s decay spectrum and detection delay, validate on UCSD Ped2 and CUHK Avenue, and report real‑time latency on Apple M3 Pro hardware (≈0.75 ms per frame).
By Yogesh Kumar
SparseGDN is a hardware‑aware framework that makes Gated Delta Networks (GDNs) more efficient for long‑context sequence modeling. It combines structured intra‑chunk approximation with an input‑dependent recurrent‑event selector, producing outputs for every token while reducing dense computation. The GPU implementation updates only selected events and reconstructs token outputs from compact state snapshots, cutting computation and memory traffic.
By Jiedong Zhuang, Peng Zhao, Jialin Tang, Haoji Hu
The paper introduces CHASE, a cache‑hole‑adapted skip‑exit mechanism for looped state‑space language models, specifically Looped Mamba and Looped Hybrid Mamba‑Transformer. It shows that looping these architectures improves performance on controlled reasoning tasks and remains competitive in pre‑training benchmarks while using fewer distinct parameters. The cache‑hole adaptation allows selective skipping of recurrent steps during inference, maintaining perplexity close to full computation and achieving significant speedups.
By Zhenxuan Yu, Takeshi Kojima, Yutaka Matsuo, Yusuke Iwasawa