在线追踪非线性时变系统,保持模型简洁可解释。
Online sparse Bayesian identification of nonlinear time-varying systems
- 基于贝叶斯递归更新系数分布,动态筛选关键项
- 滑动窗口统一处理新旧数据,抑制冗余项膨胀
- 适合实时系统辨识,尤其对参数漂移敏感场景
稀疏回归通过从候选词典中选取少量有效项,为非线性系统建模提供紧凑且可解释的路径。然而,大多数稀疏回归器是离线构建并作为静态预测器使用。在在线运行中,负载、材料属性、环境条件或设备状态的变化可能同时改变系数值和词典中的有效活跃结构。此外,对丰富词典的直接递归更新可能导致适应过程扩散到许多弱相关项,使原本稀疏的模型逐渐变得稠密。因此,核心问题是在在线过程中维持稀疏性,使模型能吸收流式数据的同时保持紧凑且可修订的活跃结构。本文提出一种贝叶斯递归稀疏学习(BRSL)方法,用于候选词典项的在线稀疏识别。系数分布通过贝叶斯后验递归更新,其中滑动窗口似然比信息递归纳入新样本、剔除过期样本,并统一折扣历史信息。为保持递归过程中的稀疏性,引入后验引导收缩机制,抑制支持度低的词典项,并根据后验证据修正活跃结构。后验更新在候选子空间中进行,并采用自适应信息下限以保证递归求解的良态性;同时给出有界误差关系,阐明收缩、残差信息、系数漂移及信息条件对结果的影响。所提方法在稀疏系数跟踪以及面向电厂的多输入多输出(MIMO)非线性时变系统识别基准上进行了评估。
原文摘要 · Abstract (English)
Sparse regression provides a compact and interpretable route for nonlinear system modeling by selecting a small number of active terms from a candidate dictionary. Most sparse regressors, however, are constructed offline and then used as static predictors. In online operation, changing load, material properties, ambient conditions, or equipment states may alter both the coefficient values and the effective active support within the dictionary. Moreover, a direct recursive update over a rich dictionary may spread the adaptation over many weakly relevant terms, causing an initially sparse model to become increasingly dense. The key problem is therefore to maintain a sparse regressor online, so that it can absorb streaming data while keeping a compact but revisable active structure. This paper develops a Bayesian recursive sparse learning (BRSL) method for online sparse identification over candidate dictionary terms. The coefficient distribution is updated through a Bayesian posterior recursion, where sliding-window likelihood-ratio information recursion incorporates new samples, removes expired samples, and discounts historical information in a unified update. To preserve sparsity during recursion, posterior-guided shrinkage is introduced to suppress weakly supported dictionary terms and revise the active structure according to posterior evidence. The posterior update is performed in a candidate subspace with an adaptive information floor to keep the recursive solve well posed, and a bounded-error relation is given to clarify the influence of shrinkage, residual information, coefficient drift, and information conditioning. The proposed method is evaluated on sparse coefficient tracking and a power-plant-oriented multi-input multi-output (MIMO) nonlinear time-varying identification benchmark.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。