2015
DOI: 10.1016/j.ifacol.2015.12.170
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian kernel-based system identification with quantized output data

Abstract: In this paper we introduce a novel method for linear system identification with quantized output data. We model the impulse response as a zero-mean Gaussian process whose covariance (kernel) is given by the recently proposed stable spline kernel, which encodes information on regularity and exponential stability. This serves as a starting point to cast our system identification problem into a Bayesian framework. We employ Markov Chain Monte Carlo (MCMC) methods to provide an estimate of the system. In particula… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…For comparison, we also show the result with the TC kernel and the Empirical Bayes. Recall that the TC kernel is defined as (10). Fig.…”
Section: Illustrative Examplementioning
confidence: 99%
See 1 more Smart Citation
“…For comparison, we also show the result with the TC kernel and the Empirical Bayes. Recall that the TC kernel is defined as (10). Fig.…”
Section: Illustrative Examplementioning
confidence: 99%
“…While various kernels have been proposed (e.g., [5,6,7]), three most widely used kernels are the so-called Stable Spline kernel (SS) [2], the Tuned-Correlated kernel (sometimes also called the firstorder stable spline kernel) [8], and the Diagonal-Correlated (DC) kernel [8]. These three kernels have simple structures and favorable properties, and their effectiveness are shown in various works, e.g., [8,9,10,11].…”
Section: Introductionmentioning
confidence: 99%
“…Using the Expectation-Maximization (EM) method [14], we design an iterative scheme for marginal likelihood maximization, where the E-step characterizing the EM method makes use of the Gibbs sampler (see also [7]), and the M-step results in a sequence of straightforward optimization problems. Interestingly, the resulting estimation scheme can be seen as a generalization of the method proposed in [19] to the Bayesian nonparametric framework and, differently from [5] and [12], it allows tuning all the kernel hyperparameters.…”
Section: Introductionmentioning
confidence: 99%
“…Related research begins with the linear systems [1, 912]. Wang et al [1] employed the empirical measure to design asymptotically efficient algorithms to identify the finite impulse response (FIR) systems with quantised observations and discussed the time complexity and space complexity.…”
Section: Introductionmentioning
confidence: 99%
“…Wang and Zhang [11] introduced a quadratic programming‐based method for identification of FIR dynamic systems from binary/quantised data. Bottegal et al [12] studied the Bayesian kernel‐based linear system identification with quantised output data and employed Markov chain Monte Carlo methods to provide an estimate of the system.…”
Section: Introductionmentioning
confidence: 99%