arXiv 21 Nov 2025 · Statistics — Computation
arXiv:2511.17117 · PDF · DOI · OpenAlex · Extracted main text
We develop a computationally efficient framework for quasi-Bayesian inference based on linear moment conditions. The approach employs a delayed acceptance Markov chain Monte Carlo (DA-MCMC) algorithm that uses a surrogate target kernel and a proposal distribution derived from an approximate conditional posterior, thereby exploiting the structure of the quasi-likelihood. Two implementations are introduced. DA-MCMC-Exact fully incorporates prior information into the proposal distribution and maximizes per-iteration efficiency, whereas DA-MCMC-Approx omits the prior in the proposal to reduce matrix inversions, improving numerical stability and computational speed in higher dimensions. Simulation studies on heteroskedastic linear regressions show substantial gains over standard MCMC and conventional DA-MCMC baselines, measured by multivariate effective sample size per iteration and per second. The Approx variant yields the best overall throughput, while the Exact variant attains the highest per-iteration efficiency. Applications to two empirical instrumental variable regressions corroborate these findings: the Approx implementation scales to larger designs where other methods become impractical, while still delivering precise inference. Although developed for moment-based quasi-posteriors, the proposed approach also extends to risk-based quasi-Bayesian formulations when first-order conditions are linear and can be transformed analogously. Overall, the proposed algorithms provide a practical and robust tool for quasi-Bayesian analysis in statistical applications.
appendix boundary found by appendix_command · 96% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | D. T. Frazier, C. Drovandi, and R. Kohn, “Calibrated generalized Bay… (2024) Calibrated generalized Bayesian inference | 1.000 | 5 | 3 | 100% |
| 2 | M. Tanaka, “Delayed acceptance markov chain monte carlo for robust b… Delayed acceptance markov chain monte carlo for robust bayesian analysis | 0.928 | 4 | 3 | 100% |
| 3 | J. A. Christen and C. Fox, “Markov chain Monte Carlo using an approx… (2005) Markov chain Monte Carlo using an approximation | 0.811 | 4 | 2 | 100% |
| 4 | A. R. Hall, Generalized Method of Moments (2004) Oxford University Press, 2004 | 0.644 | 2 | 2 | 100% |
| 5 | L. P. Hansen, “Large sample properties of generalized method of mome… (1982) Large sample properties of generalized method of moments estimators | 0.644 | 2 | 2 | 100% |
| 6 | D. Acemoglu, S. Johnson, and J. A. Robinson, “The colonial origins o… (2001) The colonial origins of comparative development: An empirical investigation | 0.511 | 2 | 1 | 100% |
| 7 | V. Chernozhukov and H. Hong, “An MCMC approach to classical estimati… (2003) An MCMC approach to classical estimation | 0.511 | 2 | 1 | 100% |
| 8 | J.-Y. Kim, “Limited information likelihood and Bayesian analysis,” J… (2002) Limited information likelihood and Bayesian analysis | 0.511 | 2 | 1 | 100% |
| 9 | M. Vihola, “Robust adaptive Metropolis algorithm with coerced accept… (2012) Robust adaptive Metropolis algorithm with coerced acceptance rate | 0.511 | 2 | 1 | 100% |
| 10 | G. Yin, “Bayesian generalized method of moments,” Bayesian Analysis,… (2009) Bayesian generalized method of moments | 0.511 | 2 | 1 | 100% |
Showing the top 10 of 34 scored citations.