Curvature-Calibrated Quasi-Bayesian Updating for Moment-Restricted Models
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.
Tom: I'm Tom.
Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.
Tom: We're looking at the paper: "Curvature-Calibrated Quasi-Bayesian Updating for Moment-Restricted Models".
Jane: Here's the gist of the paper. Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior updating The proposed curvature-calibrated quasi-Bayesian updating uses the inverse of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center Core Methodology The basic idea is to use the inverse of the local covariance, or long-run covariance, of the moment conditions as the weighting matrix and to evaluate that covariance at a center determined self-consistently by the resulting quasi-posterior Starting from a pilot quasi-posterior, CCQB alternates between estimating the covariance of the moments at the current quasi-posterior center and simulating a fixed-weight quasi-posterior using its inverse The iteration terminates when the center stabilizes, after which a final quasi-posterior is simulated using the calibrated weight Theoretical Guarantees Under local regularity conditions, the ideal CCQB calibration map is locally contractive and therefore has a unique local fixed point Its fixed point is root-N consistent, and the corresponding weighting matrix converges to C−10 The calibrated quasi-posterior satisfies a Bernstein–von Mises approximation with asymptotic covariance equal to the inverse Godambe information matrix Simulation Findings The simulation study examines three related implications of CCQB updating, including whether replacing an arbitrary weighting matrix by a covariance weight should bring the covariance represented by the quasi-posterior closer to the repeated-sampling covariance of its center The results show that calibration need not eliminate finite-sample displacement of the quasi-posterior center from the corresponding unpenalized estimator Application Results The application to longitudinal binary-response data illustrates the method with within-subject dependence and overidentified residual moments The simulation results show that calibration need not eliminate finite-sample displacement of the quasi-posterior center from the corresponding unpenalized estimator; rather, it puts the empirical criterion on a covariance-determined scale against which the prior operates Invariance Properties The application also provides a direct check of an invariance property of covariance weighting, showing that the entire ideal calibration map TN (ϑ) is invariant under such rescaling The results for the remaining parameters, reported in Table D.1 in Section D of the Supplementary Material, show the same general pattern The paper suggests that curvature calibration provides a practical way to retain prior-based quasi-Bayesian inference while placing moment-based empirical information on an appropriate local scale The final results suggest that covariance weighting can substantially improve uncertainty calibration, while typically requiring only a small number of updates to reach self-consistency References Bissiri, P.
Tom: G., Holmes, C.
Jane: C., & Walker, S.
Tom: G.
Title and authors: Tom: So, we're looking at this paper today titled "Curvature-Calibrated Quasi-Bayesian Updating for Moment-Restricted Models," and it’s about how we can do quasi-Bayesian inference even when we don't have a full likelihood function available.
Jane: Right, Tom. It tackles the idea that the weighting matrix in a quadratic moment criterion does two things: it sets the relative importance of different moments, and it also sets the information scale for updating our posterior beliefs.
Lu: Exactly. The authors propose this curvature-calibrated quasi-Bayesian updating method, which uses the inverse of the covariance—or what they call the long-run covariance—of those moment conditions evaluated right at a selfconsistent center of that quasi-posterior to set up a fixed weight for simulation.
Meng: So, instead of picking an arbitrary weighting matrix every time we run a simulation, you use this calculated value based on the moment conditions themselves? What’s the catch there?
Tom: The paper says this iteration alternates between estimating the covariance of those moments at the current quasi-posterior center and then simulating a fixed-weight version using that inverse. It avoids needing parameter-dependent weighting during every single simulation run, which is a big deal for deployment.
Jane: That makes sense. But how do they know what that "selfconsistent quasi-posterior center" even is? They have to determine it through an iterative process, right?
Lu: Yes, they start from some pilot quasi-posterior and then alternate between estimating the covariance of the moments at that center and simulating a fixed-weight version using its inverse. This iteration stops when that center stabilizes.
Meng: Stabilization sounds nice in theory, but how many iterations are we talking about before we're done? We’ve got production models running constantly.
Tom: The theoretical guarantees are pretty strong here: under local regularity conditions, the ideal calibration map is locally contractive and has a unique fixed point. This fixed point is root-N consistent, and the corresponding weighting matrix converges to C to the power of negative one.
Jane: So what does that convergence actually mean for us when we use this method instead of just picking a standard weight?
Title and authors: Lu: It means the calibrated quasi-posterior satisfies a Bernstein von Mises approximation, and its asymptotic covariance ends up being equal to the inverse Godambe information matrix. That’s the gold standard for information scale.
Meng: The simulation findings mention that replacing an arbitrary weighting matrix with this covariance weight actually brings the uncertainty represented by our quasi-posterior closer to what we get from repeated sampling at that center. That sounds like real practical improvement for us in production.
Tom: It does, and it shows that calibration doesn't even have to eliminate the finite-sample displacement of our quasi-posterior center from the unpenalized estimator; instead, it just puts the empirical criterion on a covariance-determined scale against which our prior operates.
Jane: That’s an interesting nuance. It means we don't need to perfectly align our estimated center with some ideal theoretical point to get good results. Where does this method show real power in practice?
Lu: They applied it to longitudinal binary response data, specifically when you have within-subject dependence and overidentified residual moments, showing that the method handles those structures without needing a full joint likelihood.
Meng: Longitudinal data with within-subject dependence is something we deal with all the time, and having a method that works there without needing massive likelihoods is what we’re looking for.
Tom: And they also checked an invariance property of covariance weighting, showing that the entire ideal calibration map stays invariant even when you rescale things. The results for the remaining parameters showed that same general pattern across different settings in Table D to Section D of their supplementary material.
Jane: So, if I’m a scientist looking at this for longitudinal data, what’s the main practical implication? Is it just cleaner uncertainty estimation?
Lu: It suggests that curvature calibration provides a practical way to keep prior-based quasi-Bayesian inference while placing the empirical moment information on an appropriate local scale.
Meng: I’m wondering about deployment cost. Does this iterative process really require a lot of computation compared to, say, a standard MCMC run?
Title and authors: Tom: The paper suggests that for linear instrumental-variables and heteroskedastic or serially dependent regression designs, replacing an identity weight by a covariance weight accounts for most of the improvement in covariance calibration.
Jane: That’s good news if it means we can skip those extra simulation steps without losing much accuracy. What about the convergence speed?
Lu: They show that only a small number of updates is needed asymptotically. From any initial value in the local contraction region, two ideal updates are first-order equivalent to the fixed point, and one update suffices when you start with a consistent center.
Meng: Two or one update sounds fast enough to be practical for our operational needs. But what about those other designs they tested?
Tom: They also looked at nonlinear Poisson designs and found that iteration to the selfconsistent fixed point is necessary there, which makes sense because the weighting matrix determines both magnitude and directional curvature in those cases.
Jane: It really helps connect the theory to real-world modeling challenges where we often work with moment conditions instead of full likelihoods. So, to wrap up this paper on "Curvature-Calibrated Quasi-Bayesian Updating for Moment-Restricted Models," it seems like we have a more principled way to use empirical information from moments.
Lu: The core idea is using the inverse of the covariance at a selfconsistent center as the weight, which stabilizes the procedure and makes it consistent at the standard parametric rate.
Meng: For us on the ground, it means better uncertainty calibration without needing a full likelihood function upfront. We need to see how much time this iterative process actually takes to run in our production environment.
Tom: The simulation results show that covariance weighting can substantially improve uncertainty calibration, and it typically requires only a small number of updates to reach self-consistency, which is promising for efficiency.
Jane: It’s a solid piece of work because it shows how we can retain prior inference while using moment-based empirical information on a scale that makes sense for the data's curvature.
The paper's summary: Tom: So, to recap, this paper is about taking standard Bayesian updating methods that usually need a full likelihood and making them work when you only have moment conditions—basically using some empirical data summary instead of the whole data set.
Jane: Right. The authors introduce this curvature-calibrated quasi-Bayesian updating method where the weighting matrix isn't just arbitrary; it’s determined by the inverse of the covariance of those moment conditions, calculated at a center that stays consistent during the simulation process itself.
Lu: What’s really interesting is how they handle that weighting matrix. They use this inverse covariance—or long-run covariance—as a fixed weight for their final simulations instead of changing it every time you run one step.
Meng: So you're trying to figure out a way to make the math more stable when you don't have the full likelihood function? What does that actually mean for deployment, like when I’m running models on real traffic data?
Tom: It means we don't have to worry about picking an arbitrary weighting matrix every time we run a simulation. The iteration stabilizes, and the final result is much better calibrated because it uses the information scale dictated by the moments themselves.
Jane: And they show that this calibration process actually improves uncertainty quantification. They say it brings the covariance represented by their quasi-posterior closer to what you'd get from repeated sampling at that center point.
Lu: It’s not just about making things look better; it’s about getting the information scale right. The theory guarantees that under certain conditions, this method converges to a fixed point that is consistent with the true information structure of the model—specifically, it matches the inverse Godambe information matrix asymptotically.
Meng: Matching the Godambe information matrix sounds like a lot of heavy math for something we deploy. How many steps does this iteration actually take before it settles down enough to be useful?
Tom: The simulation findings show that you don't need a huge number of updates. You can get close to self-consistency with only a small number of calibration updates, and the raw and adjusted error metrics are nearly identical after just one covariance-weight update.
Jane: So, the main idea is that this curvature calibration gives us a practical way to use moment conditions effectively by placing the empirical information on its own natural scale. It’s about making sure our prior inference is properly scaled against what the data actually tells us about its own shape.
Lu: And they showed it works for complex scenarios, like longitudinal binary response data with within-subject dependence, without needing a full joint likelihood function. That’s pretty ambitious for a moment-restricted model setup.
Meng: If it can handle those dependencies without needing a full likelihood, that makes the operational cost much lower. It means we can use these more complex structures in our production systems where we usually have to simplify everything down to just moments anyway.
Tom: Exactly. The application results show this is robust even when you have overidentified residual moments in instrumental-variable regression designs with a lot of instruments, like twelve instruments. You don't lose stability there.
Jane: It really shows that curvature calibration isn't just a theoretical exercise; it provides a concrete way to improve uncertainty calibration when you’re working with moment conditions instead of the full likelihood function.
Lu: The paper suggests that this method is powerful because it retains the prior-based quasi-Bayesian inference while grounding the empirical moment information in a locally appropriate scale. It's about using the data's own shape to inform how much weight we give to our assumptions.
Tom: So, if you’re working on models where you can’t easily get a full likelihood, this method gives you a principled way to stay grounded in reality while still leveraging your prior knowledge effectively. It’s about making sure the empirical data scales with the model's actual curvature.
Jane: And that brings us to what we need to look at next: how this works when things get even more complicated—like those nonlinear Poisson designs where you actually need that iteration to really lock in the weight.
The paper's improvements: Tom: So, to summarize the improvements, this method doesn't just give you a better weight; it actually changes how you look at the data structure itself by calibrating based on curvature rather than just scalar magnitude.
Jane: That’s right. The biggest gain is in uncertainty calibration. By using that covariance weight instead of an arbitrary one, the resulting posterior covariance matches what you would get from repeated sampling at that center point much more closely.
Lu: It addresses a problem where standard methods might be too conservative or too loose depending on the specific shape of your moment conditions, and this calibration map is locally contractive, which means it always finds that right local fixed point.
Meng: So it’s about getting a more accurate picture of the error bars without needing to run a massive simulation just to guess how much uncertainty you need for a deployment? That sounds like something I could actually use.
Tom: It is, and they show this calibration shortens those long identity-weight intervals significantly. The raw and adjusted discrepancies are nearly identical after just one covariance-weight update, which means you get most of the finite-sample correction very quickly.
Jane: And it’s not just about the uncertainty estimates; it also helps with coverage probabilities across different data designs, like those longitudinal binary response data we talked about earlier. It calibrates based on the local curvature of that empirical criterion.
Lu: The method is designed to be efficient numerically too. They showed that you don't need many iterations to reach self-consistency; one covariance-weight update often accounts for most of the finite sample correction, and only a small additional update is needed for full stability.
Meng: That rapid convergence is what matters when you’re trying to deploy something in production. I can’t afford a procedure that takes days to calibrate before I even get an estimate.
Tom: Exactly, because the initial pilot run already gives you a consistent center, so the subsequent calibration runs are just tiny adjustments. It shows that you can retain prior-based inference while efficiently putting empirical moment information on a scale that makes sense for the data's complexity.
Jane: So it’s essentially a way to make sure your prior assumptions and your empirical measurements are speaking the same language regarding the scale of uncertainty, no matter how complex the underlying structure is.
Lu: And they checked an invariance property, meaning this calibration map stays consistent even when you change how you rescale the parameters. That suggests it’s a robust structural property of using covariance weighting in this context.
Meng: So, if I’m running something on high-dimensional time series data where we have a lot of parameters to estimate, I should expect this kind of fast calibration?
Tom: Yeah, for the linear instrumental-variable and heteroskedastic regression designs they looked at with twelve instruments, the performance remained stable because the covariance weighting handles that complexity well.
Jane: It’s pretty encouraging because it moves us away from just picking a weight based on convenience and toward using the data's own internal structure to calibrate our beliefs.
Lu: The paper suggests this is a practical path forward for moment-restricted models, providing a principled way to use empirical information without needing the full likelihood function. We need to see how this translates into real-world model performance on live traffic data next.
Conclusion: Tom: So we’ve covered how this curvature calibration method uses the inverse covariance at a selfconsistent center to set weights for quasi-Bayesian updating in moment-restricted models.
Jane: That’s right, and it really shows how you can retain prior inference even when you don't have a full likelihood function available by using the data's own shape to determine the information scale.
Lu: It suggests that this curvature calibration provides a practical way to use moment-based empirical information on an appropriate local scale, which is significant for moving beyond just scalar magnitude.
Meng: I think it’s good that it converges so fast; if we can get a stable center with only one or two updates, that drastically cuts down the computational cost of calibrating these models at scale.
Tom: It does, and the results show that this calibration substantially improves uncertainty calibration, typically requiring only a small number of updates to reach self-consistency.
Jane: And it proves that you can get much better uncertainty estimates by replacing an arbitrary weighting matrix with one determined by the covariance itself, bringing the posterior closer to what you'd get from repeated sampling at that center.
Lu: It’s also robust; they showed this works for complex stuff like longitudinal binary response data with within-subject dependence without needing a full joint likelihood function.
Meng: That robustness is key. If it handles those dependencies without needing a massive likelihood, it makes the method viable for real-world problems where we usually have to simplify everything down to just moments anyway.
Tom: So, the implication is that this technique is an efficient way to ground our prior assumptions in empirical data structure, giving us reliable uncertainty estimates for moment-based models.
Jane: Exactly, and it’s a solid piece of work because it shows how we can use empirical information on a scale that makes sense for the data's curvature.
Lu: The final conclusion is that this curvature-calibrated quasi-Bayesian updating provides a principled way to retain prior-based inference while grounding the empirical moment information in a locally appropriate scale.
Meng: It’s promising because it cuts down on calibration time, so we could potentially use these methods more often in our production systems for models where likelihoods are too heavy.
Tom: I agree, and it really shows that curvature calibration can substantially improve uncertainty calibration while keeping the procedure numerically stable.
Jane: We’ve seen how this method works with longitudinal data now, but what’s next is seeing if this same principle applies to even more complex model structures we might encounter in real-world longitudinal studies.
Lu: That’s where we need to look next, because the theoretical framework for this calibration map suggests it has a unique local fixed point, which opens up a lot of possibilities for extending it.
Meng: We'll be watching that paper closely to see if we can adapt this idea to our high-dimensional time series problems where the structure gets really messy.
Tom: It’s been interesting looking at how this method handles the mechanics of weighting versus the actual statistical inference, and I think it’s a great step forward for moment-restricted modeling.
Jane: Definitely, we'll keep an eye on these results because they show a clear path toward using empirical information more effectively in Bayesian inference.
Masahiro Tanaka
Fukuoka University
stat.ME, econ.EM, math.ST, stat.TH
Submitted: 2026-08-20
Updated: 2026-11-04
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
Importance score: 81/100
The gist: Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full likelihood is unavailable…
Key concepts
- Moment Restrictions
- These are constraints placed on the model based only on specific moment conditions derived from data, rather than a complete probability distribution. They allow for quasi-Bayesian inference even when the full likelihood function is unavailable, providing a flexible framework for updating beliefs.
- Weighting Matrix
- In this context, the weighting matrix determines how much importance is given to different moment conditions during posterior updates. The proposed method uses the inverse of the covariance of these moments at a specific center to define this matrix, ensuring that the information scale is locally appropriate for accurate inference.
- Curvature Calibration
- This technique involves using the local curvature of an empirical criterion rather than just its overall magnitude. By calibrating based on this curvature, the method ensures that the weighting scheme correctly reflects the local geometry of the moment conditions, leading to better uncertainty calibration and more accurate posterior estimates.
- Self-Consistent Quasi-Posterior Center
- This is a center point determined iteratively; it is defined as the center of a quasi-posterior distribution. The core idea is that this center should be evaluated consistently with the moment conditions, allowing the method to iteratively refine both the estimate and the weighting matrix until they stabilize.
Terminology
Summary
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior updating <ref:2608. p. 0 Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. This paper proposes curvature-calibrated quasi-Bayesian (CCQB) updating for this purpose. The basic idea is to use the inverse of the local covariance, or long-run covariance, of the
moment conditions as the weighting matrix and to evaluate that covariance at a center determined
self-consistently by the resulting quasi-posterior. The calibrated
quasi-posterior satisfies a Bernstein–von Mises approximation with asymptotic covariance equal
to the inverse Godambe information matrix, and the fixed-point center has the same first-order
sampling covariance. The contraction result also shows that only a small number of calibration
updates is needed asymptotically: from any initial value in the local contraction region, two
ideal updates are first-order equivalent to the fixed point, while one update suffices when the
initial center is consistent.Where the paper says it
Where the paper says it
Where the paper says it
Calibration Mechanism
The central idea of CCQB is to use the inverse of the local covariance, or long-run covariance, of the moment conditions as the weighting matrix and evaluate that covariance at a center determined self-consistently by the resulting quasi-posterior <ref:2608.19634#pg6> The procedure alternates between estimating the covariance of the moments at the current quasi-posterior center and simulating a fixed-weight quasi-posterior using its inverse <ref:2608. p. 1 The basic idea is to use the inverse of the local covariance, or long-run covariance, of the
moment conditions as the weighting matrix and to evaluate that covariance at a center determined
self-consistently by the resulting quasi-posterior. Starting from a pilot quasi-posterior, CCQB
alternates between estimating the covariance of the moments at the current quasi-posterior center
and simulating a fixed-weight quasi-posterior using its inverse. The iteration terminates when
the center stabilizes, after which a final quasi-posterior is simulated using the calibrated weight. Thus, CCQB calibrates the full local curvature of the empirical criterion rather than only its
scalar magnitude. For a
generic fixed weighting matrix, the first-order sampling covariance of the quasi-posterior center
need not agree with the covariance represented by the quasi-posterior itself. With the covariance
weight C
−1
0
, the asymptotic covariance matrices of the corresponding root-N scaled quantities
both reduce to G⊤
0 C
−1
0 G0
−1
, the inverse of the Godambe information matrix associated with
the specified moments.Where the paper says it
Where the paper says it
Where the paper says it
Large-Sample Properties
Under local regularity conditions, Theorem 2.1 establishes that the ideal calibration map is locally contractive with a contraction modulus of order N − 1/2 The fixed point is root-N consistent, and the calibrated quasi-posterior satisfies a Bernstein–von Mises approximation with asymptotic covariance equal to the inverse Godambe information matrix The contraction modulus is Op(N − 1/2), meaning only one or two ideal updates are needed for first-order equivalence to the fixed point, depending on the quality of the initial center
Simulation and Application
The simulation study examines three implications: replacing an arbitrary weighting matrix with a covariance weight brings the covariance closer to repeated-sampling covariance Iterating to the self-consistent CCQB fixed point provides material finite-sample improvement in nonlinear Poisson designs The application to longitudinal binary-response data illustrates the method with within-subject dependence and overidentified residual moments
Empirical Findings
The simulation results show that covariance weighting substantially improves uncertainty calibration, while typically requiring only a small number of updates to reach self-consistency In the IV design, the raw identity-weight quasi-posterior severely undercovers, whereas the sandwich adjustment largely corrects this distortion For the Poisson design, iteration to the CCQB fixed point brings raw coverage much closer to the nominal level The application illustrates how the proposed procedure can be used with real data, showing that covariance weighting substantially shortens excessively long identity-weight intervals
Invariance Properties
The analysis also provides a direct check of an invariance property of covariance weighting, showing that the entire ideal calibration map is invariant under nonsingular diagonal rescaling of the last moment condition This means that after one covariance-weight update, CCQB has already removed nearly all dependence induced by arbitrary scaling of an individual moment condition The converged solution is effectively invariant under that scaling
Conclusion
The paper introduces curvature-calibrated quasi-Bayesian (CCQB) updating for inference based on moment conditions, which places moment-based empirical information on an appropriate local scale Under regularity conditions, the calibration map is locally contractive, and the resulting quasi-posterior and its center share the same first-order covariance given by the inverse Godambe information matrix The simulations show that covariance weighting can substantially improve uncertainty calibration, while typically requiring only a small number of updates to reach self-consistency This suggests that curvature calibration provides a practical way to retain prior-based quasi-Bayesian inference while placing moment-based empirical information on an appropriate local scale
References
Bissiri, P. G., Holmes, C. p. 2 Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). Consequently,
two quasi-posteriors constructed from the same moments and the same prior can represent quite
different balances between the prior and the data simply because different weighting matrices
are used. This distinction has no direct counterpart in classical point estimation by the generalized
method of moments (GMM) (Hansen, 1982). The proposed framework is related to several strands of work. A complementary strand of
the literature develops Bayesian procedures for moment-restricted models using likelihood-like
constructions based on empirical likelihood or exponential tilting, including Bayesian empirical
likelihood (Lazar, 2003), Bayesian exponentially tilted empirical likelihood (Schennach, 2005),
and the Bayesian semiparametric approach of Chib et al. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. CCQB further differs from probability-calibration methods and post-simulation sandwich
corrections. Probability calibration targets agreement between posterior credible levels and
repeated-sampling coverage probabilities (Dawid, 1982), whereas CCQB targets agreement
between local quasi-posterior curvature and the Godambe information implied by the moment
restrictions. tt@fukuoka-u. 1
arXiv:2608. Quasi-posterior draws of θ are simulated using standard
Bayesian computational methods. Below we use MCMC terminology for concreteness, although
alternatives such as slice sampling (Neal, 2003) and sequential Monte Carlo sampling (Del Moral
et al. Quasi-posterior draws of θ are simulated using standard
Bayesian computational methods. Below we use MCMC terminology for concreteness, although
alternatives such as slice sampling (Neal, 2003) and sequential Monte Carlo sampling (Del Moral
et al. Simulations show improved covariance calibration and interval coverage after a few
updates. An application to longitudinal binary-response data illustrates the method with
within-subject dependence and overidentified residual moments. A scalar adjustment,
however, cannot generally correct multidimensional discrepancies in posterior curvature (Miller,
2021; Tanaka, 2026c). More recently, Frazier et al. An application to longitudinal binary-response data illustrates the method with
within-subject dependence and overidentified residual moments. Keywords: Quasi-Bayesian inference; generalized method of moments; Godambe information; moment restrictions; quasi-posterior calibration. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Consequently,
two quasi-posteriors constructed from the same moments and the same prior can represent quite
different balances between the prior and the data simply because different weighting matrices
are used. This distinction has no direct counterpart in classical point estimation by the generalized
method of moments (GMM) (Hansen, 1982). Consequently,
two quasi-posteriors constructed from the same moments and the same prior can represent quite
different balances between the prior and the data simply because different weighting matrices
are used. This distinction has no direct counterpart in classical point estimation by the generalized
method of moments (GMM) (Hansen, 1982). In this sense, the procedure calibrates the empirical curvature before the final quasi-posterior
is formed, so that the prior is combined with a data component having an interpretable local
information scale. We establish several large-sample properties of this procedure. Accordingly, the primary evaluation criteria are covariance calibration, coverage, interval
length, and center-to-unpenalized displacement. Bias and mean squared error are not used to rank
the procedures because the proposed method is intended to calibrate quasi-posterior uncertainty
rather than to dominate alternative point estimators. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Such methods retain familiar Bayesian computational and inferential
tools such as Markov chain Monte Carlo (MCMC), while allowing empirical information to be
specified through a collection of moments rather than a full probability model. This flexibility is
particularly attractive in settings with complex dependence structures, latent variables, or other
features for which specifying and computing a full likelihood can be burdensome. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). we use a Gaussian working likelihood for the sample moments, which yields the quasi-posterior:
Π
WN (·)
(dθ | DN ) ∝ det{WN (θ)}
1/2
exp
−
N
2
m¯ N (θ)
⊤WN (θ)m¯ N (θ)
π(θ) dθ, (1)
where π(θ) denotes the prior density. Quasi-posterior draws of θ are simulated using standard
Bayesian computational methods. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). CCQB is also related to calibration methods for generalized and Gibbs posteriors. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). The simulations
also show that calibration need not eliminate finite-sample displacement of the quasi-posterior
center from the corresponding unpenalized estimator; rather, it puts the empirical criterion
on a covariance-determined scale against which the prior operates. We also illustrate CCQB
with longitudinal childhood wheeze data, where child-level moment covariances accommodate
within-child dependence without requiring a full joint likelihood and the analysis incorporates
informative priors. More generally, an arbitrary
weighting matrix can cause the covariance represented by the quasi-posterior to differ from the
repeated-sampling covariance of its center. Related work by Kleijn & van der Vaart (2012) shows
that, under model misspecification, a posterior may satisfy a Bernstein–von Mises approximation
while its local covariance fails to reproduce the repeated-sampling variability of its center. More generally, an arbitrary
weighting matrix can cause the covariance represented by the quasi-posterior to differ from the
repeated-sampling covariance of its center. Related work by Kleijn & van der Vaart (2012) shows
that, under model misspecification, a posterior may satisfy a Bernstein–von Mises approximation
while its local covariance fails to reproduce the repeated-sampling variability of its center. More generally, an arbitrary
weighting matrix can cause the covariance represented by the quasi-posterior to differ from the
repeated-sampling covariance of its center. Related work by Kleijn & van der Vaart (2012) shows
that, under model misspecification, a posterior may satisfy a Bernstein–von Mises approximation
while its local covariance fails to reproduce the repeated-sampling variability of its center. The proposed framework is related to several strands of work. A complementary strand of
the literature develops Bayesian procedures for moment-restricted models using likelihood-like
constructions based on empirical likelihood or exponential tilting, including Bayesian empirical
likelihood (Lazar, 2003), Bayesian exponentially tilted empirical likelihood (Schennach, 2005),
and the Bayesian semiparametric approach of Chib et al. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). An application to longitudinal binary-response data illustrates the method with
within-subject dependence and overidentified residual moments. Keywords: Quasi-Bayesian inference; generalized method of moments; Godambe information; moment restrictions; quasi-posterior calibration. An application to longitudinal binary-response data illustrates the method with
within-subject dependence and overidentified residual moments. Keywords: Quasi-Bayesian inference; generalized method of moments; Godambe information; moment restrictions; quasi-posterior calibration. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. CCQB is also related to calibration methods for generalized and Gibbs posteriors. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. Then the stopping criterion is defined by
η(ϑe
(s+1)
N ,ϑe
(s)
N ) =
1
J
(ϑe
(s+1)
N − ϑe
(s)
N )
⊤(Σb
ref
N )
−1
(ϑe
(s+1)
N − ϑe
(s)
N )
1/2
. When the pilot center is consistent, this criterion measures the root-mean-square change in the
calibration center in asymptotic standard-error units and is invariant under nonsingular linear
reparameterizations. Probability calibration targets agreement between posterior credible levels and
repeated-sampling coverage probabilities (Dawid, 1982), whereas CCQB targets agreement
between local quasi-posterior curvature and the Godambe information implied by the moment
restrictions. Likewise, sandwich adjustments such as Müller (2013) and Shaby (2014) modify
3 Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Quasi-posterior draws of θ are simulated using standard
Bayesian computational methods. Below we use MCMC terminology for concreteness, although
alternatives such as slice sampling (Neal, 2003) and sequential Monte Carlo sampling (Del Moral
et al. Quasi-posterior draws of θ are simulated using standard
Bayesian computational methods. Below we use MCMC terminology for concreteness, although
alternatives such as slice sampling (Neal, 2003) and sequential Monte Carlo sampling (Del Moral
et al. The proposed framework is related to several strands of work. A complementary strand of
the literature develops Bayesian procedures for moment-restricted models using likelihood-like
constructions based on empirical likelihood or exponential tilting, including Bayesian empirical
likelihood (Lazar, 2003), Bayesian exponentially tilted empirical likelihood (Schennach, 2005),
and the Bayesian semiparametric approach of Chib et al. The proposed framework is related to several strands of work. A complementary strand of
the literature develops Bayesian procedures for moment-restricted models using likelihood-like
constructions based on empirical likelihood or exponential tilting, including Bayesian empirical
likelihood (Lazar, 2003), Bayesian exponentially tilted empirical likelihood (Schennach, 2005),
and the Bayesian semiparametric approach of Chib et al. Probability calibration targets agreement between posterior credible levels and
repeated-sampling coverage probabilities (Dawid, 1982), whereas CCQB targets agreement
between local quasi-posterior curvature and the Godambe information implied by the moment
restrictions. Likewise, sandwich adjustments such as Müller (2013) and Shaby (2014) modify
3 , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. , 2019; Syring & Martin, 2019). , 2016; Miller, 2021), while several methods calibrate a scalar
learning rate to control the scale of the loss relative to the prior (Grünwald & van Ommen, 2017;
Holmes & Walker, 2017; Lyddon et al. , 2019; Syring & Martin, 2019). CCQB further differs from probability-calibration methods and post-simulation sandwich
corrections. Probability calibration targets agreement between posterior credible levels and
repeated-sampling coverage probabilities (Dawid, 1982), whereas CCQB targets agreement
between local quasi-posterior curvature and the Godambe information implied by the moment
restrictions. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). Such methods retain familiar Bayesian computational and inferential
tools such as Markov chain Monte Carlo (MCMC), while allowing empirical information to be
specified through a collection of moments rather than a full probability model. Curvature-Calibrated Quasi-Bayesian Updating for
Moment-Restricted Models
Masahiro Tanaka∗
August 21, 2026
Abstract
Moment restrictions provide a flexible basis for quasi-Bayesian inference when a full
likelihood is unavailable, but the weighting matrix in a quadratic moment criterion determines both the relative importance of the moments and the information scale of posterior
updating. We propose curvature-calibrated quasi-Bayesian updating, which uses the inverse
of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center. CCQB further differs from probability-calibration methods and post-simulation sandwich
corrections. Probability calibration targets agreement between posterior credible levels and
repeated-sampling coverage probabilities (Dawid, 1982), whereas CCQB targets agreement
between local quasi-posterior curvature and the Godambe information implied by the moment
restrictions. 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). An application to longitudinal binary-response data illustrates the method with
within-subject dependence and overidentified residual moments. Keywords: Quasi-Bayesian inference; generalized method of moments; Godambe information; moment restrictions; quasi-posterior calibration. CCQB is also related to calibration methods for generalized and Gibbs posteriors. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. CCQB is also related to calibration methods for generalized and Gibbs posteriors. Generalized
Bayesian procedures replace the negative log likelihood by a loss function (Zhang, 2006a,b;
Jiang & Tanner, 2008; Bissiri et al. The resulting fixed-point procedure alternates between
covariance estimation and simulation from a fixed-weight quasi-posterior, thereby avoiding
parameter-dependent weighting during each simulation run. Under a Bernstein–von Mises
condition for the fixed-weight quasi-posterior at the efficient population weight, we show
that the calibration map is locally contractive, that its fixed point is consistent at the standard
parametric rate, and that the Gaussian approximation continues to hold under the calibrated
data-dependent weight, with covariance given by the inverse Godambe information matrix.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
--- Page 5
The paper is 2608.19634v1 [stat. p. 0 1
arXiv:2608. 19634v1 [stat.Where the paper says it
Pruning redundant reasoning tokens
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified <ref:2608.19634#pg2> A growing literature constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived from moment conditions <ref:2608. p. 0 1 Introduction
Moment restrictions provide a useful basis for Bayesian-style inference when a complete likelihood is unavailable, difficult to evaluate, or deliberately left unspecified. A growing literature
constructs quasi-posteriors by combining a prior distribution with an empirical criterion derived
from moment conditions (Kim, 2002; Chernozhukov & Hong, 2003; Yin, 2009; Liao & Jiang,
2011; Li & Jiang, 2016). Such methods retain familiar Bayesian computational and inferential
tools such as Markov chain Monte Carlo (MCMC), while allowing empirical information to be
specified through a collection of moments rather than a full probability model. This flexibility is
particularly attractive in settings with complex dependence structures, latent variables, or other
features for which specifying and computing a full likelihood can be burdensome.Where the paper says it
Where the paper says it
How the training signal is built
The basic idea of CCQB is to use the inverse of the local covariance as a weighting matrix and evaluate that covariance at a self-consistent quasi-posterior center <ref:2608.19634#pg6> Starting from a pilot quasi-posterior, CCQB alternates between estimating the covariance of the moments at the current quasi-posterior center and simulating a fixed-weight quasi-posterior using its inverse <ref:2608. p. 1 The basic idea is to use the inverse of the local covariance, or long-run covariance, of the
moment conditions as the weighting matrix and to evaluate that covariance at a center determined
self-consistently by the resulting quasi-posterior. Starting from a pilot quasi-posterior, CCQB
alternates between estimating the covariance of the moments at the current quasi-posterior center
and simulating a fixed-weight quasi-posterior using its inverse.Where the paper says it
Where the gains come from
The calibration has a direct information-geometric interpretation, where it resolves the dependence of the covariance estimate on the unknown parameter through a fixed-point condition <ref:2608.19634#pg10> The ideal calibration map is locally contractive, and its fixed point is root-N consistent, leading to an asymptotic covariance equal to the inverse Godambe information matrix Simulations show that covariance weighting can substantially improve uncertainty calibration while typically requiring only a small number of updates to reach self-consistency
The procedure should not be viewed as a Bayesian reinterpretation of iterated GMM (Hansen et al., 1996) The overall scale of W acts as a learning rate, whereas its normalized shape determines the relative weighting of the moment conditions
The CCQB iteration is constructed by setting W(s)N = Cb N (ϑe(s)N)−1 and simulating from ΠW(s)N (dθ DN) <ref:2608.19634#pg8> The stopping criterion involves a reference covariance matrix Σb ref N,r and a standardized calibration tolerance that measures the Mahalanobis root-mean-square change in asymptotic standard-error units <ref:2608. p. 7 Then the stopping criterion is defined by
η(ϑe
(s+1)
N ,ϑe
(s)
N ) =
1
J
(ϑe
(s+1)
N − ϑe
(s)
N )
⊤(Σb
ref
N )
−1
(ϑe
(s+1)
N − ϑe
(s)
N )
1/2
. When the pilot center is consistent, this criterion measures the root-mean-square change in the
calibration center in asymptotic standard-error units and is invariant under nonsingular linear
reparameterizations.Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Curvature-calibrated quasi-Bayesian updating can be used to place moment-based empirical information on an appropriate local scale by using
the inverse of the covariance (or long-run covariance) of the moment conditions evaluated at a selfconsistent quasi-posterior center
as the weighting matrix. This avoidsparameter-dependent weighting during each simulation run.
-
The system can achieve better uncertainty calibration by replacing an arbitrary weighting matrix with a covariance weight, which is shown to bring
the covariance represented by the quasi-posterior closer to the repeated-sampling covariance of its center.
-
The system can improve coverage probabilities and reduce interval lengths across different data designs because it calibrates
the full local curvature of the empirical criterion rather than only its scalar magnitude.
-
For longitudinal binary response data with within-subject dependence, the system can accommodate this structure by using
child-level moment covariances
without requiring a full joint likelihood. -
The system can be designed to efficiently determine the required number of calibration updates, as the procedure is shown to converge rapidly, often requiring
only a small number of updates to reach self-consistency.
-
In overidentified instrumental-variable regression designs with more instruments (K=12), the system can maintain stable performance where
further iteration beyond the first covariance update offers little additional finite-sample benefit.
Abstract
Quadratic moment-based quasi-posteriors depend on a weighting matrix governing both the contributions of moment conditions and the scale of posterior uncertainty. We propose curvature-calibrated quasi-Bayesian (CCQB) updating, which iteratively evaluates the inverse of the estimated moment covariance (or long-run covariance) at the center of the resulting fixed-weight quasi-posterior. A two-part stopping rule monitors changes in the center and Monte Carlo error in estimating it. Under local regularity conditions, the ideal calibration map is contractive, and its fixed point is root-N consistent. The calibrated quasi-posterior and the sampling distribution of its center have the inverse Godambe information matrix as their root-N-scale covariance. Simulations show substantial gains over identity weighting. Further iteration has little effect in linear designs but improves calibration for some parameters in nonlinear settings, although nominal coverage is not uniformly achieved. An application to longitudinal childhood wheeze data illustrates the method under within-subject dependence.
Sources
- Calibrated Generalized Bayesian Inference
- A Theory of Bootstrap Coverage Calibration for Generalized Posterior Credible Sets
Related papers
- Learning Robust Treatment Rules for Censored Data
- Neural Estimation of Summary Statistics for Simulation-Based Inference with Non-Asymptotic Guarantees
- Spectral divide-and-conquer MCMC for long stationary time series
- Improving the Efficiency of Subgroup Analysis in Randomized Controlled Trials with TMLE
- Personalized Federated Vector Autoregression with Personalization Diversity
- Doubly Robust and Efficient Calibration of Prediction Sets for Right-Censored Time-to-Event Outcomes