An effective implementation for kernel-based positive system identification using Gibbs sampling

Chen Qiu

doi:10.1002/asjc.3682

Return

An effective implementation for kernel-based positive system identification using Gibbs sampling

2025-04-15

PRE

Chen Qiu

郑曼 (Man Zheng) *

Jun Song

DOI：10.1002/asjc.3682

Original

Original request for help

Save

Abstract

En 中文

Recently, the kernel-based method has been applied for the positive system identification where the hyperparameter estimation is a crucial and critical part. The regularized identification problem for the positive system is first formulated. Due to the nonnegative constraint of the positive system, the Bayesian interpretation chooses the truncated Gaussian distribution as the prior of the system parameter. The hyperparameters estimation is cast as a marginal likelihood optimization. A Bayesian network for the positive system is established to construct a probabilistic framework for handling the hyperparameter estimation. Based on the derived conditional distributions, this paper develops a Markov chain Monte Carlo method to sample according to the likelihood function, where the Gibbs sampling is available to improve the sampling efficiency. The proposed sampling-based algorithm facilitates searching for hyperparameters globally. The simulation results demonstrate that the proposed algorithm provides more precise and efficient identification compared to the conventional method.

Keywords:

Bayesian network

Gibbs sampling

hyperparameter estimation

kernel-based method

positive system identification