Higher-Order Neyman Orthogonality in Moment-Condition Models

arXiv:2605.10842 · econ.EM, math.ST, stat.TH · Submitted 2026-05-11 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Economics. The day in economics: theory, mechanisms and the evidence beneath them.

Ruth: We're looking at the paper: "Higher-Order Neyman Orthogonality in Moment-Condition Models".

Warren: Here's the gist of the paper. The paper constructs moment functions that are Neyman-orthogonal to a chosen order q in parametric moment condition models that involve nuisance parameters.

Ruth: This construction is designed to reduce sensitivity to estimation errors in these nuisance parameters, providing a unified and tractable route toward higher-order debiasing across various econometric models.

Warren: The number of additional nuisance parameters required by this construction, beyond those already present, is independent of the order of orthogonalization and can be reduced to a single scalar if desired.

Ruth: The concept of higher-order Neyman orthogonality is formalized as requiring that all derivatives of the expected estimating equation with respect to the nuisance parameter vanish up to order q at the true parameter values.

Title and authors: Ruth: So we're talking about this paper called "Higher-Order Neyman Orthogonality in Moment-Condition Models". Basically, they've built these special moment functions that are orthogonal to a chosen order q of the model. This is designed to make the final estimate less sensitive when you have those pesky nuisance parameters that you have to estimate.

Warren: Right, so it’s about reducing error from estimating those nuisance parameters. The big promise here is a unified way to get higher-order debiasing across different types of econometric models. It seems like they're solving a problem where standard first-order orthogonality just doesn't cut it for getting really good results when you have many unknowns.

Iris: I agree, the paper moves beyond just the basic Neyman orthogonality we see in things like generalized method of moments estimation, which is what we often use to find estimators like ordinary least squares or instrumental variable problems. They're aiming for something much stronger than just vanishing at the first derivative.

Ruth: Exactly. The core idea they are proposing is that you can construct these orthogonal moment functions using closed-form expressions, which means they don't just rely on approximations; they have a concrete way to build them. This construction uses multiple independent copies of your data and adds a generalized inverse of a Jacobian matrix as an extra nuisance parameter.

Warren: That sounds like it introduces more parameters, but the authors say that the number of extra nuisance parameters they need is actually independent of how high the order q is. And they even suggest that if you want to simplify things, you can reduce those extra parameters down to just a single scalar.

Iris: I read that part about it being independent of the order q, and I think that's a significant point because usually, as you demand higher-order conditions, the complexity explodes. They formalize this concept of higher-order Neyman orthogonality by requiring all derivatives of the expected estimating equation with respect to those nuisance parameters to vanish up to order q at the true parameter values.

Ruth: And that's what they do, and it’s a big step because a general construction for these higher-order orthogonal moments in models defined by moment conditions hasn't really been around much before. This is their main contribution, proposing this specific construction based on those closed-form expressions.

Warren: What’s interesting is how they handle the math to get these expressions, because they use von Mises expansions to create polynomial approximations of the target parameter using multiple independent copies of the data. They apply this technique successfully to both affine and nonlinear moment conditions, which is pretty broad.

Title and authors: Iris: The paper gives a specific formula for a second-order moment function, that's when q equals two, in equation thirty-five. It aligns with something earlier in the work called equation thirteen in the general case, giving us this second-order Neyman-orthogonal moment function. That shows they have a concrete result for at least one order of debiasing.

Ruth: And for any arbitrary order q, they use rooted trees to give closed-form expressions, which is described in equation forty-two. The coefficient for each term in that expression is given by this specific formula involving the negative sign and the automorphism group properties of those trees.

Warren: That part about using rooted trees to get these closed forms sounds like a way to structure the complexity of higher orders very systematically. So, if you want to compute something for a high order q, you're looking at summing up terms from these trees.

Iris: And under appropriate regularity conditions, the resulting estimator has this bias bound: b theta minus theta zero is of order (eta b minus eta zero plus b lambda minus lambda zero) to the power of q plus one plus n to the power of negative half. This means if you want valid inference, you only need that sum of those nuisance estimation errors to be smaller than something related to n to the negative half and q plus one.

Ruth: That bias bound is pretty strong because it tells us exactly how much more accurate our estimate is when we control the error from estimating those nuisance parameters. It implies that for valid inference, you only need that sum of nuisance errors to be smaller than something related to n to the negative half and q plus one.

Warren: From a strategy side, this means you can use this method to develop more efficient estimators by pairing it with regularization of the nuisance parameters, which should lead to lower estimation error overall. It’s not just about getting a better result; it's about getting an estimator that runs better when you have complex models.

Iris: The paper also extends this construction to nonlinear moment conditions by adding correction terms involving higher-order derivatives of the moment function g, and they provide a general formula for the q-th order orthogonal moment function in equation thirty-nine. Asymptotic theory shows that under certain assumptions, the estimator is square root n consistent and asymptotically normal.

Title and authors: Ruth: That consistency and normality result is pretty important because it means that this method doesn't just reduce bias; it also gives us the standard tools we need for making inferences about the parameter of interest, which is what we always want.

Warren: But you have to be careful about where this works. The paper mentions that the analysis involves showing a sequence of maps converges to a unique zero using the Banach fixed point theorem, and they show that this map is a contraction with modulus one half. That guarantees there's a unique solution eta* in some space B.

Iris: And they also confirm that by analyzing the derivative bounds, it turns out that the map from s to eta star is (q plus one)-times continuously differentiable because of the implicit function theorem. This confirms we can actually differentiate things around this solution.

Ruth: That differentiability is key because it lets them show how the error term scales with q, and they find that by differentiating their relationship between the moment function and its derivative, they get a bound showing that the norm of those derivatives grows at most with a power of rho to the power of j for j up to k minus one.

Warren: So it’s not just about existence; it’s about how smooth this solution eta* is, which lets them control the error terms more tightly when they're building their final estimator. They are essentially showing you that you can control the error propagation very carefully through these higher-order structures.

Iris: And then there's the part where they connect this truncated expansion with a tree sum by working in a specific algebraic ring, R sub s plus one. This involves an invertible operator and shows that the function b in that ring is equivalent to some complicated expression involving multiple steps of iteration, like a tree recursion similar to what you see for B-series coefficients of implicit Runge–Kutta methods.

Ruth: It sounds incredibly technical, but the point is they are using this algebraic structure to derive those closed forms for the orthogonal moment functions at arbitrary order q. It’s essentially a way of mapping the combinatorial complexity onto a recursive structure that's easier to handle computationally.

Warren: So, if you want to use this tool, you have to be able to compute those tree structures efficiently, where each term is indexed by a rooted tree with its own coefficient c q tau derived from automorphism group properties. That’s how you actually get the terms of the moment function.

Title and authors: Iris: And they show that extracting the coefficient of s to the power of q from this structure yields a quantity called Psi, and there's a bound on the difference between that quantity and what it would be at zero, which is related to eta - eta zero plus lambda - lambda zero raised to the power of q plus one when rho is less than epsilon.

Ruth: That final bound on the difference between those quantities is pretty neat because it explicitly links the error in your estimate back to how far your nuisance parameters are from their true values, which is what we're trying to control. It shows that if those errors are small enough, then the estimation error of your final result will be even smaller.

Warren: So, this whole paper on Higher-Order Neyman Orthogonality in Moment-Condition Models seems to give us a way to systematically construct moment functions for debiasing across many models using closed-form expressions based on combinatorial structures. It’s a lot of machinery, but it’s focused on controlling the error from nuisance parameter estimation.

Iris: The main thing is that it gives us a tool to handle the complexity of higher-order conditions by providing explicit formulas for those orthogonal moment functions in both affine and nonlinear cases, which is useful for checking models and doing inference when you have many parameters.

Ruth: So, we've covered how this construction works, the mathematical machinery behind the results, and how it leads to a bias bound that shows that higher orders of orthogonality really helps control the error from nuisance parameter estimation. We're going to wrap up with a look at what this means for practical application.

Warren: And practically speaking, it’s about building more robust estimators by combining this higher-order orthogonality with regularization techniques on those nuisance parameters to ensure the final estimation error is kept low across a wide variety of models.

Iris: To sum up, the paper provides explicit formulas for the q-th order orthogonal moment function using rooted trees and shows how this leads to a bias bound that shows that controlling nuisance parameter errors at order q really helps control the bias in your final estimator.

Ruth: And remember, this is all about making sure we're not just getting a result that looks good on paper, but that it’s robust when you have real-world estimation errors to worry about. We’re done with this paper for now.

The paper's summary: Ruth: So, to wrap up, this paper is about building special moment functions that are orthogonal to an order q of the model when you have those tricky nuisance parameters floating around.

Warren: Right, so they’ve developed a way to make your final estimate much less sensitive to how you guess those nuisance parameters. It seems like they’re aiming for a unified method for getting higher-order debiasing across different types of econometric models.

Iris: The paper formalizes this higher-order Neyman orthogonality by saying all the derivatives of the expected estimating equation with respect to those nuisance parameters have to vanish up to order q at the true parameter values. That’s the technical requirement they’re working toward.

Ruth: And their main contribution is building these orthogonal moment functions using closed-form expressions, which means they aren't just using approximations; they have a concrete way of constructing them. They use multiple independent copies of your data and add a generalized inverse of a Jacobian matrix as an extra nuisance parameter.

Warren: That’s interesting because the authors claim the number of extra nuisance parameters you need for this construction doesn't depend on how high the order q is. You can even reduce those extra parameters down to just one single scalar if you want to simplify things later on.

Iris: They use von Mises expansions to create polynomial approximations of your target parameter, and they get away with using multiple independent copies of data without introducing bias when they do that. This technique works for both affine and nonlinear moment conditions.

Ruth: For affine moment conditions specifically, they give an explicit formula for a second-order orthogonal moment function when q equals two in equation thirty-five, which matches something earlier in the work called equation thirteen in the general case. That shows they have a concrete result for at least one order of debiasing.

Warren: And for any arbitrary order q, they use rooted trees to give closed-form expressions for those orthogonal moment functions, described in equation forty-two. The coefficient for each term in that expression comes from this specific formula involving the negative sign and the automorphism group properties of those trees.

Iris: Under regular conditions, the resulting estimator has a bias bound where the error falls with the power of q plus one times n to negative half times some measure of how far your nuisance parameters are from their true values. This means for valid inference, you only need that sum of those nuisance estimation errors to be smaller than something related to n to negative half and q plus one.

Ruth: That bias bound is pretty powerful because it explicitly links the error in your final estimate back to how far your nuisance parameters are from their true values, which is what we're trying to control. It shows that if those errors are small enough, then the estimation error of your final result will be even smaller.

The paper's summary: Warren: From a strategy side, this means you can use this method to develop more efficient estimators by pairing it with regularization techniques on those nuisance parameters to ensure the final estimation error is kept low across a wide variety of models. It’s not just about getting a better result; it's about getting an estimator that runs better when you have complex models.

Iris: The paper also extends this construction to nonlinear moment conditions by adding correction terms involving higher-order derivatives of the moment function, and they provide a general formula for the q-th order orthogonal moment function in equation thirty-nine. Asymptotic theory shows that under certain assumptions, the estimator is square root n consistent and asymptotically normal.

Ruth: That consistency and normality result is pretty important because it means this method doesn't just reduce bias; it also gives us the standard tools we need for making inferences about the parameter of interest, which is what we always want.

Warren: But you have to be careful about where this works. The paper mentions that the analysis involves showing a sequence of maps converges to a unique zero using the Banach fixed point theorem, and they show that this map is a contraction with modulus one half. That guarantees there's a unique solution in some space B.

Iris: And they also confirm that by analyzing the derivative bounds, it turns out that the map from s to eta star is q plus one times continuously differentiable because of the implicit function theorem. This confirms we can actually differentiate things around this solution.

Ruth: That differentiability is key because it lets them show how the error term scales with q, and they find that by differentiating their relationship between the moment function and its derivative, they get a bound showing that the norm of those derivatives grows at most with a power of rho to the power of j for j up to k minus one.

Warren: So it’s not just about existence; it’s about how smooth this solution is, which lets them control the error terms more tightly when they're building their final estimator. They are essentially showing you that you can control the error propagation very carefully through these higher-order structures.

Iris: And then there's the part where they connect this truncated expansion with a tree sum by working in a specific algebraic ring, R sub s plus one. This involves an invertible operator and shows that the function b in that ring is equivalent to some complicated expression involving multiple steps of iteration, like a tree recursion similar to what you see for B-series coefficients of implicit Runge–Kutta methods.

The paper's summary: Ruth: It sounds incredibly technical, but the point is they are using this algebraic structure to derive those closed forms for the orthogonal moment functions at arbitrary order q. It’s essentially a way of mapping the combinatorial complexity onto a recursive structure that's easier to handle computationally.

Warren: So, if you want to use this tool, you have to be able to compute those tree structures efficiently, where each term is indexed by a rooted tree with its own coefficient c q tau derived from automorphism group properties. That’s how you actually get the terms of the moment function.

Iris: And they show that extracting the coefficient of s to the power of q from this structure yields a quantity called Psi, and there's a bound on the difference between that quantity and what it would be at zero, which is related to those nuisance parameter errors raised to the power of q plus one when rho is less than epsilon.

Ruth: That final bound on the difference between those quantities is pretty neat because it explicitly links the error in your estimate back to how far your nuisance parameters are from their true values, which is what we're trying to control. It shows that if those errors are small enough, then the estimation error of your final result will be even smaller.

Warren: So, this whole paper on Higher-Order Neyman Orthogonality in Moment-Condition Models seems to give us a way to systematically construct moment functions for debiasing across many models using closed-form expressions based on combinatorial structures. It’s a lot of machinery, but it’s focused on controlling the error from nuisance parameter estimation.

Iris: The main thing is that it gives us a tool to handle the complexity of higher-order conditions by providing explicit formulas for those orthogonal moment functions in both affine and nonlinear cases, which is useful for checking models and doing inference when you have many parameters.

Ruth: So, we've covered how this construction works, the mathematical machinery behind the results, and how it leads to a bias bound that shows that controlling nuisance parameter errors at order q really helps control the bias in your final estimator. We're going to wrap up with a look at what this means for practical application.

Warren: And practically speaking, it’s about building more robust estimators by combining this higher-order orthogonality with regularization techniques on those nuisance parameters to ensure the final estimation error is kept low across a wide variety of models.

Iris: To sum up, the paper provides explicit formulas for the q-th order orthogonal moment function using rooted trees and shows how it leads to a bias bound that shows that controlling nuisance parameter errors at order q really helps control the bias in your final estimator.

The paper's improvements: Ruth: So, moving on from what they did, the authors are suggesting some improvements to this framework for higher-order debiasing in moment condition models. They’re not just settling for this one construction; they’re looking at how we can make it even more robust and flexible.

Warren: Right, so if you look at the next steps, they're talking about incorporating correction terms into those nonlinear moment conditions using higher-order derivatives of the moment function. That’s a way to handle cases where the standard approach falls short for nonlinear models.

Iris: That’s an important part because it gives them a general formula for that q plus order orthogonal moment function in equation thirty-nine, which is useful when you're dealing with nonlinear conditions instead of just the simple affine ones. It keeps the structure going.

Ruth: And they’re pushing the idea that this construction can be extended to even more complicated settings. They are looking at how we can use this framework not just for debiasing, but also for developing more efficient estimators by combining it with regularization of those nuisance parameters.

Warren: That sounds like a practical application, where you try to keep the estimation error low by using these higher-order structures alongside ways to constrain those nuisance parameters. It moves beyond just theoretical accuracy into actually building better tools.

Iris: And they’re really focused on the identification side too, showing how this method helps when you have many parameters because it provides explicit formulas for both affine and nonlinear cases, which is good for checking models before you get to the final inference part. It makes things concrete.

Ruth: So, it seems the direction is toward making these methods more general and applicable across a wider range of econometric scenarios, not just sticking to the specific examples they used initially. They want to show that this isn't just a niche trick but a pathway for more systematic estimation in complex models.

Warren: It’s about taking this concept of higher-order orthogonality and turning it into something you can actually use day-to-day in modeling, not just something you see on an arXiv paper. The goal is to keep the overall estimation error down when everyone starts running these kinds of strategies.

Iris: The main implication here is that if we can control those nuisance parameter errors this way, we get a much tighter bound on the bias of our final estimate. That’s what makes it useful for serious inference work where you need to be precise about how much error you're accepting.

Ruth: So, they’re really trying to show that this isn't just an academic exercise in deriving fancy formulas, but a genuine way to build more reliable statistical tools when the models get messier. It’s about making sure our results hold up even when we have imperfect data or complex underlying behavior.

Warren: Yeah, so the next thing we should watch is how these improvements translate into real-world trading or policy decisions, because if the bias is this much smaller, it could change how much risk you take in a strategy.

Conclusion: Tom: So we've covered how this paper, "Higher-Order Neyman Orthogonality in Moment-Condition Models," builds those special moment functions using rooted trees to handle higher orders of estimation error in models with nuisance parameters.

Ruth: Basically, they showed that you can construct these orthogonal moments to reduce the bias of your final estimate by controlling the error from estimating those pesky nuisance parameters at order q.

Warren: It means for a quantitative trader or an economist, you can build a strategy that is more robust when your inputs aren't perfectly known, and this framework gives you the explicit formulas to do it.

Iris: I think the biggest thing is the mathematical machinery they developed to get those closed forms for arbitrary order q in both affine and nonlinear cases. It’s a rigorous way to handle complexity in econometric modeling that we haven't seen before.

Ruth: Right, so this isn't just some incremental tweak; it’s a systematic way to build better tools for inference when you have these tricky models with many unknowns floating around.

Warren: And the fact that they can reduce the extra nuisance parameters down to a single scalar if you want makes it much more practical for high-dimensional problems. It simplifies the cost of running this kind of analysis.

Iris: I just think their asymptotic theory showing square root n consistency and asymptotic normality is what really seals the deal for us; it proves that these estimators are actually reliable enough to use in practice.

Ruth: So, to summarize, this paper on Higher-Order Neyman Orthogonality in Moment-Condition Models gives us a way to systematically construct moment functions that control nuisance parameter error at high orders using closed forms from rooted trees.

Warren: It’s about building more robust estimators by combining this higher-order orthogonality with regularization techniques on those nuisance parameters to ensure the final estimation error is kept low across a wide variety of models.

Iris: I just think the main thing is that it gives us a tool to handle the complexity of higher-order conditions by providing explicit formulas for those orthogonal moment functions in both affine and nonlinear cases, which is useful for checking models and doing inference when you have many parameters.

Ruth: So, we've covered how this construction works, the mathematical machinery behind the results, and how it leads to a bias bound that shows that controlling nuisance parameter errors at order q really helps control the bias in your final estimator. We're going to wrap up with a look at what this means for practical application.

Warren: And practically speaking, it’s about building more robust estimators by combining this higher-order orthogonality with regularization techniques on those nuisance parameters to ensure the final estimation error is kept low across a wide variety of models.

Iris: To sum up, the paper provides explicit formulas for the q-th order orthogonal moment function using rooted trees and shows how it leads to a bias bound that shows that controlling nuisance parameter errors at order q really helps control the bias in your final estimator.

Ruth: And remember, this is all about making sure we're not just getting a result that looks good on paper, but that it’s robust when you have real-world estimation errors to worry about. We’re done with this paper for now.

Warren: Yeah, so the next thing we should watch is how these improvements translate into real-world trading or policy decisions, because if the bias is this much smaller, it could change how much risk you take in a strategy.

University of Chicago · Toulouse School of Economics · MIT · NBER · University College London

econ.EM, math.ST, stat.TH

Submitted: 2026-05-11

Updated: 2026-11-05

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 100/100

The gist: The paper constructs moment functions that are Neyman-orthogonal to a chosen order q in parametric moment condition models that involve nuisance parameters.

Key concepts

Higher-Order Neyman Orthogonality
This formal requirement means that all derivatives of the expected estimating equation with respect to the nuisance parameter must vanish up to order q at the true parameter values. Achieving this orthogonality helps reduce bias arising from errors in estimating these nuisance parameters.
Orthogonal Moment Function Construction
The construction involves creating moment functions based on multiple independent copies of the data and incorporating a generalized inverse of a Jacobian matrix as an extra nuisance parameter. This technique is designed to be robust against estimation errors in those nuisance parameters.
Von Mises Expansions and Rooted Trees
Von Mises expansions are used to create polynomial approximations of the target parameter using multiple data copies without introducing bias. Closed-form expressions for the orthogonal moment functions at arbitrary order q are derived using rooted trees, where coefficients depend on automorphism group properties.

Terminology

Summary

The paper constructs moment functions that are Neyman-orthogonal to a chosen order q in parametric moment condition models that involve nuisance parameters. p. 0

Where the paper says it

HIGHER-ORDER NEYMAN ORTHOGONALITY IN MOMENT-CONDITION MODELS∗ St´ephane Bonhomme‡ Koen Jochmans§ Whitney K. Newey¶ Martin Weidner‖ October 2026 Abstract We construct moment functions that are Neyman-orthogonal to a chosen order in parametric moment condition models involving nuisance parameters.

This construction is designed to reduce sensitivity to estimation errors in these nuisance parameters, providing a unified and tractable route toward higher-order debiasing across various econometric models. p. 0
Where the paper says it

These moment functions reduce sensitivity to estimation error in the nuisance parameters and, as such, offer a unified and tractable route to higher-order debiasing in a wide range of econometric models. The number of additional nuisance parameters required by our construction, beyond those already present in the original moment conditions, is independent of the order of orthogonalization and can be reduced to a single scalar if desired.

The number of additional nuisance parameters required by this construction, beyond those already present, is independent of the order of orthogonalization and can be reduced to a single scalar if desired. p. 0
Where the paper says it

These moment functions reduce sensitivity to estimation error in the nuisance parameters and, as such, offer a unified and tractable route to higher-order debiasing in a wide range of econometric models. The number of additional nuisance parameters required by our construction, beyond those already present in the original moment conditions, is independent of the order of orthogonalization and can be reduced to a single scalar if desired.

The concept of higher-order Neyman orthogonality is formalized as requiring that all derivatives of the expected estimating equation with respect to the nuisance parameter vanish up to order q at the true parameter values. p. 2

Where the paper says it

The concept of higher-order Neyman orthogonality, formalized in Mackey, Syrgkanis and Zadik (2018), is general and applies to the models we consider. The condition requires that all derivatives of the expected estimating equation with respect to the nuisance parameter, up to order q, vanish at the true parameter values.

The main contribution of this work is proposing such a construction based on closed-form expressions. p. 2
Where the paper says it

However, a general construction of higher-order orthogonal moments in models defined by moment conditions is so far lacking in the literature. The main contribution of this paper is to propose such a construction, based on closed-form expressions.

The orthogonal moment function depends on multiple independent copies of the data and incorporates a generalized inverse of a Jacobian matrix as an additional nuisance parameter. p. 2
Where the paper says it

The main contribution of this paper is to propose such a construction, based on closed-form expressions. Our orthogonal moment function depends on multiple independent copies of the data, and it features a generalized inverse of a Jacobian matrix as an additional nuisance parameter.

The methodology employs von Mises expansions to create polynomial approximations of the target parameter, utilizing multiple independent copies to estimate each component of this polynomial without introducing bias. p. 2

Where the paper says it

To provide intuition, we start by illustrating the construction in a linear grouped-data model with heterogeneous coefficients. In this setting, we outline a simple construction that combines two ingredients: a polynomial approximation of the target parameter, and the use of multiple independent copies to estimate each component of the polynomial without bias.

This approach is applied successfully to both affine and nonlinear moment conditions. p. 2
Where the paper says it

We first apply our von Mises approach to provide explicit moment functions in the case where the original moment function is affine in the nuisance parameter. This covers our heterogeneous-coefficient model, and also linear regression and instrumental-variable estimation with linear moment conditions.

For affine moment conditions in the nuisance parameter, an explicit formula for a second-order (q=2) orthogonal moment function is provided in equation (35), which aligns with equation (13) in the general case, yielding a second-order Neyman-orthogonal moment function. p. 2
Where the paper says it

The condition requires that all derivatives of the expected estimating equation with respect to the nuisance parameter, up to order q, vanish at the true parameter values. However, a general construction of higher-order orthogonal moments in models defined by moment conditions is so far lacking in the literature.

The general construction utilizes rooted trees to provide closed-form expressions for orthogonal moment functions at arbitrary order q, denoted by equation (42). p. 2

Where the paper says it

However, a general construction of higher-order orthogonal moments in models defined by moment conditions is so far lacking in the literature. The main contribution of this paper is to propose such a construction, based on closed-form expressions.

The coefficient of each term is given by the closed form formula: c q, tau:= (-1) tau/Aut(tau) q + tau - d(tau)! p. 2
Where the paper says it

However, a general construction of higher-order orthogonal moments in models defined by moment conditions is so far lacking in the literature. The main contribution of this paper is to propose such a construction, based on closed-form expressions.

.

Under appropriate regularity conditions, the resulting estimator satisfies b theta - theta 0 = O(| eta b - eta 0| + |b lambda - lambda 0|) q+1 + n-1/2, indicating that the bias from nuisance estimates is of a higher order. This implies that valid inference requires only | eta b - eta 0| + |b lambda - lambda 0| = o(n-1/2(q+1)).

The construction can be extended to nonlinear moment conditions by incorporating correction terms involving higher-order derivatives of the moment function g, with a general formula for the q-th order orthogonal moment function presented in equation (39). p. 2

Where the paper says it

The condition requires that all derivatives of the expected estimating equation with respect to the nuisance parameter, up to order q, vanish at the true parameter values. However, a general construction of higher-order orthogonal moments in models defined by moment conditions is so far lacking in the literature.

Asymptotic theory demonstrates that under certain assumptions, the estimator is sqrt N-consistent and asymptotically normal. p. 3
Where the paper says it

The simulations suggest that orthogonality, together with good (regularized) first-step estimates of the nuisance parameters, can lead to significant improvements relative to the naive plug-in approach. Additionally, in the appendix we develop asymptotic theory for the grouped data setting.

The proof involves showing that a sequence of maps converges to a unique zero using the Banach fixed point theorem, where the map is defined as in equation (68) and shown to be a contraction on B with modulus 1/2, leading to a unique zero eta*(s) in B such that | eta*(s) - eta 0| at most 2c 1 rho. The analysis of the derivative bounds confirms that s to eta*(s) is (q+1) -times continuously differentiable by the implicit function theorem. p. 7

Where the paper says it

(8) At q = 1 this is the standard Neyman orthogonality condition. The two formulations agree under enough smoothness: if (η, λ) 7→ Ψ(θ0, η, λ) is q + 1 times continuously differentiable near (η0, λ0), then (8) implies (7) by Taylor’s theorem, so the two possible formulations of q-th order orthogonality are then equivalent.

Differentiating the relationship between M(s) and delta'(s) shows that |M(j)(s)| at most c rho j for 1 at most j at most k-1, leading to bound (67).

The identification of the truncated expansion (16) with the tree sum is achieved by working in the ring R q:= R[s]/(s q+1), where As = Id eta - sE is invertible with inverse A-1s = P qj=0 s jE j. p. 2

Where the paper says it

These two ingredients underlie our general approach. The polynomial approximation is achieved through a von Mises expansion of the target parameter, initially proposed in von Mises (1947) and extended to arbitrary order in Robins, Li, Tchetgen and van der Vaart (2008).

The function b delta in (R q) eta is shown to be equivalent to F(b delta) with F(x):= -A-1s[s epsilon + P q p=2(1/p! p. 1
Where the paper says it

In such cases, going beyond first-order orthogonality can help. An example is Bonhomme, Jochmans and Weidner (2025), where it was shown how to construct such improvements for nonlinear estimators in a likelihood setting.

) G p[x times p]]. p. 7
Where the paper says it

Proposition 1. Let ψ be q-th order Neyman-orthogonal, and suppose that (η, λ) 7→ Ψ(θ0, η, λ) is q times differentiable at (η0, λ0).

Iterating F from 0 reaches b delta after q steps, described as a tree recursion similar to those determining B-series coefficients of implicitly defined stages of an implicit Runge–Kutta method. Lemma 6 provides a tree expansion for m(eta + b delta) in R q:

m(eta + b delta) = X tau' (-1) tau' Aut(tau') s(tau') V tau'(epsilon, s; eta, lambda),

where the sum is over rooted trees tau' with at most q leaves. The extraction of the coefficient of s q from m(eta + b delta)/(1-s) yields psi(q)(nu) = X tau' (-1) tau' Aut(tau') X 0 at most kv at most jv Y v in nonroot(tau') P jv at most q - l(tau') V tau', which is related to the tree expansion (73). The final bound on the difference between psi(q)(theta 0, eta, lambda) and psi(q)(theta 0, eta 0, lambda 0) is derived by applying Taylor's theorem with integral remainder and bounding derivatives up to order q+1, yielding | eta - eta 0| + | lambda - lambda 0| q+1 for rho at most epsilon, where epsilon is the radius of Lemma 5. The asymptotic variance analysis shows that sqrt N (b theta - theta 0) = -(G'omega G)-1G'omega S N + o(1), and the summands S N, i = N-1/2 P i (xi N,i - E[xi N,i]) are centered on average because P i E[xi N,i] = G'omega P i psi i(theta 0, nu 0) = 0 by (53).

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

  1. Higher-order debiasing in moment condition models can be achieved by constructing moment functions that are Neyman-orthogonal to a chosen order q, which reduces sensitivity to estimation error in nuisance parameters.

  2. The construction of these orthogonal moments uses multiple independent copies of the data and a generalized inverse of a Jacobian matrix as an additional nuisance parameter, which is independent of the order of orthogonalization and can be reduced to a single scalar if desired.

  3. AI systems can perform higher-order debiasing in econometric models by implementing constructions based on von Mises expansions to derive closed-form expressions for orthogonal moment functions at arbitrary orders q.

  4. The derived moment functions are applicable across various model settings, including affine models with heterogeneous coefficients, linear regression, and instrumental variable estimation with linear moment conditions.

  5. The method allows the reduction of the nuisance parameter dimension to a single scalar even under overidentification in certain cases, which simplifies inference for high-dimensional models.

  6. Asymptotic theory shows that the estimator satisfies b theta minus theta zero equals Op (eta b minus eta zero + b lambda minus lambda zero) q plus one plus n minus 1 over 2, meaning higher orders of orthogonality reduce bias to order T minus q plus one over 2.

  7. The framework enables the derivation of a closed-form expression for the q-th order orthogonal moment function in both affine and nonlinear cases using rooted trees indexed by specific combinatorial coefficients.

  8. AI systems can utilize these tree structures to compute the terms of an orthogonal moment function, where each term is indexed by a rooted tree with a coefficient cq,tau derived from automorphism group properties.

  9. The construction provides explicit formulas for the q-th order orthogonal moment function in cases where the moment conditions are affine in the nuisance parameter, which is useful for model verification and inference.

  10. The method allows for the development of more efficient estimators by combining higher-order Neyman orthogonality with regularization of nuisance parameters to ensure lower estimation error.

Abstract

We construct moment functions that are Neyman-orthogonal to a chosen order in moment-condition models that involve finite-dimensional nuisance parameters. These moment functions reduce sensitivity to estimation error in the nuisance parameters and, as such, offer a unified and tractable route to higher-order debiasing in a wide range of econometric models. The number of additional nuisance parameters required by our construction, beyond those already present in the original moment conditions, is independent of the order of orthogonalization and can be reduced to a single scalar if desired.

Sources

Related papers