Information geometry approach to parameter estimation in Markov chains
From MaRDI portal
Publication:309718
DOI10.1214/15-AOS1420zbMath1347.62182arXiv1401.3814MaRDI QIDQ309718
Shun Watanabe, Masahito Hayashi
Publication date: 7 September 2016
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3814
relative entropyexponential familyFisher information matrixnatural parameterasymptotic efficient estimatorexpectation parameter
Related Items (10)
Curvature and inference for maximum likelihood estimates ⋮ Geometric reduction for identity testing of reversible Markov chains ⋮ Function-specific mixing times and concentration away from equilibrium ⋮ 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 ⋮ Statistical analysis of multivariate discrete-valued time series ⋮ Information geometry of reversible Markov chains ⋮ Local equivalence problem in hidden Markov model ⋮ Information geometry approach to parameter estimation in hidden Markov model ⋮ Mixing time estimation in reversible Markov chains from a single sample path
Cites Work
- Curvature, concentration and error estimates for Markov chain Monte Carlo
- Rigorous confidence bounds for MCMC under a geometric drift condition
- Markov chains and stochastic stability
- On the Markov chain central limit theorem
- Explicit error bounds for lazy reversible Markov chain Monte Carlo
- Conditional exponential families and a representation theorem for asymptotic inference
- On exponential families of Markov processes
- Parallel distributed block coordinate descent methods based on pairwise comparison oracle
- Spectral theory and limit theorems for geometrically ergodic Markov processes
- 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
- Nonasymptotic bounds on the estimation error of MCMC algorithms
- Error bounds for computing the expectation by Markov chain Monte Carlo
- Optimum Monte-Carlo sampling using Markov chains
- Introduction to Derivative-Free Optimization
- Large deviations, hypotheses testing, and source coding for finite Markov chains
- On Sequential Maximum Likelihood Estimation for Exponential Families of Stochastic Processes
- Large Sample Inference for Markovian Exponential Families with Application to Branching Processes with Immigration
- On the converse theorem in statistical hypothesis testing for Markov chains
- $\alpha$-Divergence Is Unique, Belonging to Both $f$-Divergence and Bregman Divergence Classes
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Probability and Computing
- A Simplex Method for Function Minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Information geometry approach to parameter estimation in Markov chains
