arXiv cs.AI· Syed Ibrahim Omer, Ginny Y. Wong, Xiangyu Zhao·· 9 天前AI 评分23
MaRK:面向状态空间模型动态算子条件化的马尔可夫自适应循环核
MaRK: Markov-adapted Recurrent Kernels for Dynamic Operator Conditioning in State Space Models
AI 导读
MaRK 是一种动态算子条件化框架,可将上下文向量直接映射为冻结 SSM 循环参数 A、B、C、D、Δ 的有界调制,从而让每个扩散时间步重塑模型的输入输出记忆核。
正文 · 原文
Abstract:State Space Models (SSMs) offer an efficient alternative to Transformers for sequence modeling, yet conditioning pre-trained SSMs for iterative generation typically operates outside the recurrent operator, through input injection or activation modulation. While such mechanisms expose the model to conditioning information, they leave the underlying temporal dynamics fixed. We introduce MaRK (Markov-adapted Recurrent Kernels), a dynamic operator-conditioning framework that maps context vectors directly into bounded modulations of a frozen SSM's recurrence ($A$), read-in ($B$), read-out ($C$), skip ($D$), and discretization ($\Delta$) parameters. Viewed through the lens of LPV-SSM systems, MaRK induces a context-indexed family of Markov parameter sequences, allowing each diffusion timestep to reshape the model's input-output memory kernel. We instantiate MaRK on a frozen 111M-parameter Hydra SSM backbone and study three adapter geometries: Hypernet, Chebyshev polynomial, and Discrete Cosine Transform kernels. Since these adapters modify the Markov parameter sequence through low-rank auxiliary maps on the frozen backbone, parameter-efficient fine-tuning arises as a structural consequence of the adaptation mechanism itself, requiring only 6.3--11M trainable auxiliary parameters to transition from a bidirectional objective to an iterative diffusion regime. The bounded recurrence parameterization further yields an analytic Affine Quadratic Stability certificate for the modulated recurrence. Through synthetic LPV recovery experiments and Markov-operator diagnostics, we show that MaRK recovers coordinate-invariant temporal operators under matched assumptions and produces distinct, stable timestep-conditioned memory profiles. Empirically, the Chebyshev variant yields the strongest performance, achieving an average validation loss of 2.55, followed by the DCT (2.59) and Hypernet (3.77) geometries.
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2610.09092 [cs.LG] |
| (or arXiv:2610.09092v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2610.09092 arXiv-issued DOI via DataCite |
|
| Journal reference: | NeurIPS 2026 |
Submission history
From: Syed Ibrahim Omer [view email]
[v1]
Tue, 6 Oct 2026 20:46:26 UTC (1,708 KB)
[v2]
Thu, 8 Oct 2026 08:16:24 UTC (1,708 KB)
来源:arXiv cs.AI · arxiv.org