State Compression of Markov Processes via Empirical Low-Rank Estimation

02/08/2018
by   Anru Zhang, et al.
0

Model reduction is a central problem in analyzing complex systems and high-dimensional data. We study the state compression of finite-state Markov process from its empirical trajectories. We adopt a low-rank model which is motivated by the state aggregation of controlled systems. A spectral method is proposed for estimating the frequency and transition matrices, estimating the compressed state spaces, and recovering the state aggregation structure if there is any. We provide upper bounds for the estimation and recovery errors and matching minimax lower bounds.

READ FULL TEXT
research
04/03/2018

Estimation of Markov Chain via Rank-constrained Likelihood

This paper studies the recovery and state compression of low-rank Markov...
research
11/06/2018

State Aggregation Learning from Markov Transition Data

State aggregation is a model reduction method rooted in control theory a...
research
10/16/2016

Estimation of low rank density matrices by Pauli measurements

Density matrices are positively semi-definite Hermitian matrices with un...
research
08/14/2022

High-dimensional cointegration and Kuramoto systems

This paper presents a novel estimator for a non-standard restriction to ...
research
05/02/2019

High dimensional VAR with low rank transition

We propose a vector auto-regressive (VAR) model with a low-rank constrai...
research
01/22/2022

Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures

Structural matrix-variate observations routinely arise in diverse fields...
research
08/24/2018

Spectral thresholding for the estimation of Markov chain transition operators

We consider estimation of the transition operator P of a Markov chain an...

Please sign up or login with your details

Forgot password? Click here to reset