Information geometry approach to parameter estimation in Markov chains
From MaRDI portal
Abstract: We consider the parameter estimation of Markov chain when the unknown transition matrix belongs to an exponential family of transition matrices. Then, we show that the sample mean of the generator of the exponential family is an asymptotically efficient estimator. Further, we also define a curved exponential family of transition matrices. Using a transition matrix version of the Pythagorean theorem, we give an asymptotically efficient estimator for a curved exponential family.
Recommendations
Cites work
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 4082703 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3085434 (Why is no real title available?)
- $\alpha$-Divergence Is Unique, Belonging to Both $f$-Divergence and Bregman Divergence Classes
- A Simplex Method for Function Minimization
- Conditional exponential families and a representation theorem for asymptotic inference
- Curvature, concentration and error estimates for Markov chain Monte Carlo
- Error bounds for computing the expectation by Markov chain Monte Carlo
- Explicit error bounds for lazy reversible Markov chain Monte Carlo
- Explicit limit results for minimal sufficient statistics and maximum likelihood estimators in some Markov processes: Exponential families approach
- Finite-length analysis on tail probability for Markov chain and application to simple hypothesis testing
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Introduction to Derivative-Free Optimization
- Large Sample Inference for Markovian Exponential Families with Application to Branching Processes with Immigration
- Large deviations, hypotheses testing, and source coding for finite Markov chains
- Markov chains and stochastic stability
- Nonasymptotic bounds on the estimation error of MCMC algorithms
- On Sequential Maximum Likelihood Estimation for Exponential Families of Stochastic Processes
- On exponential families of Markov processes
- On the Markov chain central limit theorem
- On the converse theorem in statistical hypothesis testing for Markov chains
- Optimum Monte-Carlo sampling using Markov chains
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle
- Probability and Computing
- Rigorous confidence bounds for MCMC under a geometric drift condition
- Spectral theory and limit theorems for geometrically ergodic Markov processes
Cited in
(13)- Information geometry of estimating functions in semi-parametric statistical models
- Statistical analysis of multivariate discrete-valued time series
- Mixing time estimation in reversible Markov chains from a single sample path
- Curvature and inference for maximum likelihood estimates
- Information geometry of reversible Markov chains
- Function-specific mixing times and concentration away from equilibrium
- Information geometry approach to parameter estimation in hidden Markov model
- Geometric reduction for identity testing of reversible Markov chains
- scientific article; zbMATH DE number 2216827 (Why is no real title available?)
- Local equivalence problem in hidden Markov model
- Statistical estimation of parameters for binary conditionally nonlinear autoregressive time series
- Asymptotic and non-asymptotic analysis for a hidden Markovian process with a quantum hidden system
- On the power of tests of multidimensional discrete uniformity used for statistical analysis of random number generators
This page was built for publication: Information geometry approach to parameter estimation in Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309718)
