Pages that link to "Item:Q2435233"
From MaRDI portal
The following pages link to Nonasymptotic bounds on the estimation error of MCMC algorithms (Q2435233):
Displayed 14 items.
- Information geometry approach to parameter estimation in Markov chains (Q309718) (← links)
- Markov chain Monte Carlo estimation of quantiles (Q485905) (← links)
- Convergence complexity analysis of Albert and Chib's algorithm for Bayesian probit regression (Q2313288) (← links)
- A weighted discrepancy bound of quasi-Monte Carlo importance sampling (Q2322580) (← links)
- Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings (Q2325397) (← links)
- Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms (Q2341639) (← links)
- Error bounds of MCMC for functions with unbounded stationary variance (Q2344860) (← links)
- Exponential concentration inequalities for additive functionals of Markov chains (Q2786488) (← links)
- Hit-and-Run for Numerical Integration (Q2926241) (← links)
- Orlicz Integrability of Additive Functionals of Harris Ergodic Markov Chains (Q2954049) (← links)
- Rare Event Simulation Using Reversible Shaking Transformations (Q3447461) (← links)
- Computation of Expectations by Markov Chain Monte Carlo Methods (Q5256571) (← links)
- Exponential inequalities for unbounded functions of geometrically ergodic Markov chains: applications to quantitative error bounds for regenerative Metropolis algorithms (Q5276180) (← links)
- Nonasymptotic Bounds on the Mean Square Error for MCMC Estimates via Renewal Techniques (Q5326129) (← links)