Sciweavers

Share
UAI
2001

Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk

9 years 9 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based on the Blahut-Arimoto algorithm for computing channel capacity in information theory. We give a statistical analysis of the algorithm, bounding the number of samples required for the stochastic algorithm to closely approximate the deterministic algorithm in each iteration. Simulations are presented for several examples from exponential families. Although we focus on applications to reference priors and minimax risk, the methods and analysis we develop are applicable to a much broader class of optimization problems and iterative algorithms.
John D. Lafferty, Larry A. Wasserman
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where UAI
Authors John D. Lafferty, Larry A. Wasserman
Comments (0)
books