Information Geometry Approach to Parameter Estimation in Markov Chains

J. G. Kemeny and J. L. Snell, Finite Markov Chains

1960

Earlier work this paper cites.

J. A. Nelder and R. Mead, “A simplex method for function minimization,” The Computer Journal

1965

Earlier work this paper cites.

L. Bregman, “The relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming,” Comput. Math. Phys. USSR

1967

Earlier work this paper cites.

P. H. Peskun, “Optimum Monte-Carlo sampling using Markov chains,” Biometrika

1973

Earlier work this paper cites.

P. D. Feigin, “Conditional Exponential Families and a Representation Theorem for Asympotic Inference,” The Annals of Statistics

1981

Earlier work this paper cites.

I. L. Hudson, “Large Sample Inference for Markovian Exponential Families with Application to Branching Processes with Immigration,” Austr. J. Statist

1982

Earlier work this paper cites.

S. Natarajan, “Large deviations, hypotheses testing, and source coding for finite markov chains,” IEEE Trans. Inform. Theory

1985

Earlier work this paper cites.

M. Sorensen, “On Sequential Maximum Likelihood Estimation for Exponential Families of Stochastic Processes,” International Statistical Review

1986

Earlier work this paper cites.

B. R. Bhat, “On exponential and curved exponential families in stochastic processes,” Math. Scientist

1988

Earlier work this paper cites.

H. Ito and S. Amari, “Geometry of information sources,” Proceedings of The 11th Symposium on Information Theory and Its Applications (SITA1988), Beppu, 57-60, 1988 (In Japanese)

1988

Earlier work this paper cites.

U. Kuchler and M. Sorensen, “Exponential Families of Stochastic Processes: A Unifying Semimartingale Approach,” International Statistical Review

1989

Earlier work this paper cites.

K. Nakagawa and F. Kanaya, “On the converse theorem in statistical hypothesis testing for markov chains,” IEEE Trans. Inform. Theory

1993

Cited alongside, same era.

V. T. Stefanov, “Explicit Limit Results for Minimal Sufficient Statistics and Maximum Likelihood Estimators in Some Markov Processes: Exponential Families Approach,” The Annals of Statistics

1995

Cited alongside, same era.

A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications, 2nd ed

1998

Cited alongside, same era.

U. Kuchlera and M. Sorensen, “On exponential families of Markov processes,” Journal of Statistical Planning and Inference

1998

Cited alongside, same era.

S. Amari and H. Nagaoka, Methods of Information Geometry

2000

Cited alongside, same era.

C. Shalizi, “Maximum Likelihood Estimation for Markov Chains,” 2009 http://www.stat.cmu.edu/ cshalizi/462/lectures/06/markov-mle.pdf

2009

Later among the works it cites.

S. Amari, “ α \alpha -Divergence Is Unique, Belonging to Both f f -Divergence and Bregman Divergence Classes,” IEEE Trans. Inform. Theory

2009

Later among the works it cites.

D. Rudolf, “Explicit error bounds for lazy reversible Markov chain Monte Carlo,” J. Complexity

2009

Later among the works it cites.

A. A. R. Conn, K. Scheinberg, and L. N. Vicente, Introduction to derivative-free optimization

2009

Later among the works it cites.

D. Rudolf, “Error bounds for computing the expectation by Markov chain Monte Carlo,” Monte Carlo Methods and Applications

2010

Later among the works it cites.