An effective implementation for kernel-based positive system identification using Gibbs sampling
From MaRDI portal
Cites work
- A new kernel-based approach for linear system identification
- A new kernel-based approach to hybrid system identification
- A new kernel-based approach to system identification with quantized output data
- Bayesian positive system identification: truncated Gaussian prior and hyperparameter estimation
- Discrete-time control for switched positive systems with application to mitigating viral escape
- scientific article; zbMATH DE number 44386 (Why is no real title available?)
- scientific article; zbMATH DE number 1516499 (Why is no real title available?)
- Input design for Bayesian frequency response identification via convex programming
- Kernel methods in system identification, machine learning and function estimation: a survey
- Mathematical models in epidemiology
- On embeddings and inverse embeddings of input design for regularized system identification
- On kernel design for regularized LTI system identification
- On kernel design for regularized non-causal system identification
- On the convergence properties of the EM algorithm
- On the estimation of transfer functions, regularizations and Gaussian processes-revisited
- On the reduced conditions for positive consensus of second-order multi-agent systems
- Probability rate optimization of positive Markov jump linear systems via DC programming
- Regularized system identification. Learning dynamic models from data
- Stability of the convex linear combination of positive linear systems
- Stabilization of discrete-time LTI positive systems
- The quest for the right kernel in Bayesian impulse response identification: the use of OBFs
This page was built for publication: An effective implementation for kernel-based positive system identification using Gibbs sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7301974)