用核方法将非线性系统建模为无限维空间中的线性贝叶斯滤波,实现高效实时预测。
Kernel Operator-Theoretic Bayesian Filter for Nonlinear Dynamical Systems
- 基于再生核希尔伯特空间,将非线性动态映射到无限维线性空间
- 仅用少量基函数即可逼近,精度优于传统有限维柯尔莫哥洛夫分解
- 适合流式数据的在线学习,可实时更新系统模型
受柯尔莫哥洛夫算子理论兴起的启发,本文提出一种基于函数型贝叶斯视角的机器学习方法,用于未知、数据驱动的非线性动力系统的算子理论建模。该方法直接在具有通用逼近性质的无穷维线性算子空间或希尔伯特空间中进行。再生核希尔伯特空间(RKHS)理论允许通过线性嵌入将非线性动态提升至潜在的无穷维空间,其中任意非线性函数可表示为函数空间中一组线性函数或算子。这使得经典线性贝叶斯方法(如卡尔曼滤波)可直接应用于希尔伯特空间,从而在原始输入空间中获得非线性解。该核视角的柯尔莫哥洛夫算子具有两大优势:首先,希尔伯特空间可确定性构建,不依赖于非线性动态;高斯核具有通用性,能在任意紧致域上一致逼近任意连续目标函数。其次,贝叶斯滤波是一种自适应的线性最小方差算法,支持系统持续更新柯尔莫哥洛夫算子并长期追踪变化,特别适合现代数据驱动应用,如使用流式数据的实时机器学习。本文提出多种实用实现方式,以获得功能性贝叶斯滤波(FBF)的有限维近似。由于高斯核的快速衰减特性,仅需低维即可获得极佳逼近效果。实验表明,该方法能取得高精度结果,且优于有限维柯尔莫哥洛夫分解。
原文摘要 · Abstract (English)
Motivated by the surge of interest in Koopman operator theory, we propose a machine-learning alternative based on a functional Bayesian perspective for operator-theoretic modeling of unknown, data-driven, nonlinear dynamical systems. This formulation is directly done in an infinite-dimensional space of linear operators or Hilbert space with universal approximation property. The theory of reproducing kernel Hilbert space (RKHS) allows the lifting of nonlinear dynamics to a potentially infinite-dimensional space via linear embeddings, where a general nonlinear function is represented as a set of linear functions or operators in the functional space. This allows us to apply classical linear Bayesian methods such as the Kalman filter directly in the Hilbert space, yielding nonlinear solutions in the original input space. This kernel perspective on the Koopman operator offers two compelling advantages. First, the Hilbert space can be constructed deterministically, agnostic to the nonlinear dynamics. The Gaussian kernel is universal, approximating uniformly an arbitrary continuous target function over any compact domain. Second, Bayesian filter is an adaptive, linear minimum-variance algorithm, allowing the system to update the Koopman operator and continuously track the changes across an extended period of time, ideally suited for modern data-driven applications such as real-time machine learning using streaming data. In this paper, we present several practical implementations to obtain a finite-dimensional approximation of the functional Bayesian filter (FBF). Due to the rapid decay of the Gaussian kernel, excellent approximation is obtained with a small dimension. We demonstrate that this practical approach can obtain accurate results and outperform finite-dimensional Koopman decomposition.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。