用谱分解方法提升序列建模的效率与精度
Sequence Modeling with Spectral Mean Flows
- 基于算子理论将序列分布嵌入希尔伯特空间,构建谱均值流
- 在多个时序数据集上达到媲美现有方法的性能
- 适合对高效生成建模感兴趣的研究人员
序列建模中的核心问题是如何表示和学习高度非线性、概率性的状态动态。算子理论将此类动态视为包含分布均值嵌入向量的希尔伯特空间上的线性映射,提供了一个有吸引力但尚未被充分探索的视角。我们提出一种基于隐马尔可夫模型(HMM)算子理论的新序列建模方法。不直接模拟随机递推过程,而是将整个序列分布作为张量嵌入到乘积希尔伯特空间中。生成过程定义为序列空间中最大均值差异(MMD)梯度流。为克服大张量带来的挑战及采样收敛慢的问题,我们引入谱均值流,一种结合两个核心思想的可扩展算法:第一,利用线性算子的谱分解,导出序列均值嵌入的可扩展张量网络分解;第二,将MMD梯度流扩展至时变希尔伯特空间,并通过连续性方程将其与流匹配相联系,实现无需模拟的学习和更快的采样。我们在多个时间序列建模数据集上展示了具有竞争力的结果。代码见 https://github.com/jw9730/spectral-mean-flow。
原文摘要 · Abstract (English)
A key question in sequence modeling with neural networks is how to represent and learn highly nonlinear and probabilistic state dynamics. Operator theory views such dynamics as linear maps on Hilbert spaces containing mean embedding vectors of distributions, offering an appealing but currently overlooked perspective. We propose a new approach to sequence modeling based on an operator-theoretic view of a hidden Markov model (HMM). Instead of materializing stochastic recurrence, we embed the full sequence distribution as a tensor in the product Hilbert space. A generative process is then defined as maximum mean discrepancy (MMD) gradient flow in the space of sequences. To overcome challenges with large tensors and slow sampling convergence, we introduce spectral mean flows, a novel tractable algorithm integrating two core concepts. First, we propose a new neural architecture by leveraging spectral decomposition of linear operators to derive a scalable tensor network decomposition of sequence mean embeddings. Second, we extend MMD gradient flows to time-dependent Hilbert spaces and connect them to flow matching via the continuity equation, enabling simulation-free learning and faster sampling. We demonstrate competitive results on a range of time-series modeling datasets. Code is available at https://github.com/jw9730/spectral-mean-flow.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。