System Identification Via Sparse Multiple Kernel-Based Regularization Using Sequential Convex Optimization Techniques

Tianshi Chen

doi:10.1109/TAC.2014.2351851

System Identification Via Sparse Multiple Kernel-Based Regularization Using Sequential Convex Optimization Techniques

2014-11-01

136

PRE

AI

DOI：10.1109/TAC.2014.2351851

Original

Original request for help

Save

Abstract

En 中文

Model estimation and structure detection with short data records are two issues that receive increasing interests in System Identification. In this paper, a multiple kernel-based regularization method is proposed to handle those issues. Multiple kernels are conic combinations of fixed kernels suitable for impulse response estimation, and equip the kernel-based regularization method with three features. First, multiple kernels can better capture complicated dynamics than single kernels. Second, the estimation of their weights by maximizing the marginal likelihood favors sparse optimal weights, which enables this method to tackle various structure detection problems, e. g., the sparse dynamic network identification and the segmentation of linear systems. Third, the marginal likelihood maximization problem is a difference of convex programming problem. It is thus possible to find a locally optimal solution efficiently by using a majorization minimization algorithm and an interior point method where the cost of a single interior-point iteration grows linearly in the number of fixed kernels. Monte Carlo simulations show that the locally optimal solutions lead to good performance for randomly generated starting points.

Keywords:

System identification

regularization

kernel

convex optimization

sparsity

structure detection

System Identification Via Sparse Multiple Kernel-Based Regularization Using Sequential Convex Optimization Techniques

Abstract

AI Summary

Journal

Organization