Finite Sample Analysis for Structured Discrete System Identification

Research output: Contribution to journalArticlepeer-review

Abstract

We consider a discrete-time dynamical system over a discrete state-space, which evolves according to a structured Markov model called Bernoulli autoregressive (BAR) model. Our goal is to obtain sample complexity bounds for the problem of estimating the parameters of this model using an indirect maximum likelihood estimator. Our sample complexity bounds exploit the structure of the BAR model and are established using concentration inequalities for random matrices and Lipschitz functions.

Original languageEnglish (US)
Pages (from-to)6345-6352
Number of pages8
JournalIEEE Transactions on Automatic Control
Volume68
Issue number10
DOIs
StatePublished - Oct 1 2023

Keywords

  • Discrete state-space dynamical systems
  • Markov chains
  • identification
  • sample complexity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Finite Sample Analysis for Structured Discrete System Identification'. Together they form a unique fingerprint.

Cite this