Refined Inference for Asymptotically Linear Estimators with Non-Negligible Second-Order Remainders
summary
The gist
Asymptotically linear estimators in semiparametric models are usually studied through a von Mises expansion in which first-order inference is based on the influencefunction variance…
In short
The paper investigates variance estimation for asymptotically linear estimators in semiparametric models, focusing on when standard methods fail due to non-negligible second-order remainders. It derives a finite-sample variance decomposition and shows that traditional sandwich estimators miss crucial components near boundaries. It then introduces jackknife and bootstrap methods that correctly target the true variance under mild conditions.
Key concepts
- Influence Function Variance
- This is a key component in the von Mises expansion used to study asymptotically linear estimators. It represents the first-order contribution to the estimator's variance, which is what standard sandwich estimators primarily target.
- Remainder Variance
- This term captures the second-order error or remainder in the asymptotic expansion. When this term is not negligible, it causes standard first-order inference methods, like simple sandwich estimators, to be inaccurate.
- Sandwich Validity
- This refers to a condition where the standard sandwich variance estimator accurately targets the true sampling variance. The paper shows this validity depends on whether the scaled remainder variance vanishes, which is not always guaranteed in practice.
Terminology used across episodes
This episode discusses
- Refined Inference for Asymptotically Linear Estimators with Non-Negligible Second-Order Remainders · Paper Radio
- Surrogate-Assisted Targeted Learning for Nested Bridge Functionals under Administrative Censoring
The paper
Refined Inference for Asymptotically Linear Estimators with Non-Negligible Second-Order Remainders · Read on arXiv
First-order semiparametric inference typically uses the same influence-function linearization to justify both centering and sandwich variance estimation. We show that these are distinct questions. In a near-boundary regime, the second-order remainder can be nearly mean zero yet large enough to contribute O(n-1) sampling variation. When plug-in influence-function error and the cross term are negligible, the usual sandwich estimator captures only the influence-function component, and Wald intervals can undercover even when the point estimator is nearly unbiased. We derive a finite-sample variance decomposition and show that, when the cross term is asymptotically negligible, sandwich consistency is characterized by the condition nVar(Rrem) --> 0: the sandwich consistently estimates total variance in the strong-decay regime where this holds, and materially underestimates it in the near-boundary regime where nVar(Rrem) -->cR > 0. We then study two corrections. Under a leave-one-out remainder linearization condition, the jackknife consistently estimates the total variance; under a conditional Mallows-2 bootstrap condition, the pairs bootstrap does likewise. For clustered data we distinguish within-cluster dependence from first-order influence-function mismatch. Simulations for a surrogate-assisted targeted learning estimator in stepped-wedge cluster-randomized trials illustrate variance discrepancies and the limits of jackknife correction.
Transcript
Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.
Tom: We're looking at the paper: "Refined Inference for Asymptotically Linear Estimators with Non-Negligible Second-Order Remainders".
Paper summary: Tom: So we're getting into the core of this paper, "Refined Inference for Asymptotically Linear Estimators with Non-Negligible Second-Order Remainders". The main thesis is that standard asymptotic linear estimators often rely on a simple expansion, but that expansion breaks down if the second-order remainder term isn't negligible in variance <ref:2603.16833#pg1>.
Jane: They study the specific regime where this remainder actually contributes variance at order n minus one, meaning the total sampling variance is different from what you get by just using the influence function approximation <ref:2603.16833#pg2>.
Lu: What they claim is that they derive a finite-sample variance decomposition that clearly separates the influence-function variance, the remainder variance, and their covariance <ref:2603.16833#pg5>.
Meng: The point is that standard sandwich estimators only focus on the first piece—the influence function part—and they completely ignore what’s happening with the remainder variance or that cross term <ref:2603.16833#pg8>.
Lalam: They then characterize when the sandwich estimator is actually consistent for the total sampling variance by looking at when this scaled remainder variance vanishes, specifically when n times the variance of the remainder goes to zero <ref:2603.16833#pg5>.
Tom: In short, they show that in some regimes where n times the remainder variance stays larger than zero, like when it equals a constant c times R, the sandwich estimator misses a first-order contribution <ref:2603.16833#pg10>.
Jane: This is important because it tells us that what we think is our variance estimate might be systematically off by a term that grows with n in those near-boundary situations <ref:2603.16833#pg7>.
Lu: They then move on to suggesting practical tools like the jackknife and bootstrap, which they show work well under mild additional conditions to recover consistent variance inference <ref:2603.16833#pg4>.
Meng: And for clustered data, they have an analytic expression showing how the intra-cluster correlation really amplifies that gap between the sandwich and the total variance through that remainder term <ref:2603.16833#pg5>.
Lalam: The authors verify these predictions using simulations of a cross-fitted nested-bridge estimator for stepped wedge clustered randomized trials, showing how this amplification is visible <ref:2603.16833#pg5>.
Tom: It’s interesting that they use a surrogate-assisted nested bridge estimator because it cleanly shows this near-boundary regime and the cluster structure makes the effect easy to see in practice <ref:2603.16833#pg4>.
Jane: It seems like they are building up a very concrete framework for when those traditional asymptotic linearity assumptions aren't quite enough to guarantee a good variance estimate <ref:2603.16833#pg7>.
Lu: The structure of the paper is organized to build this up, introducing the general framework first, then developing that variance decomposition in sections three and four <ref:2603.16833#pg4>.
Meng: If we want to deploy these models reliably, we have to know when these estimators are actually reliable under different conditions <ref:2603.16833#pg7>.
Lalam: That’s what this paper is about—refining inference for those tricky situations where the standard tools fall short <ref:2603.16833#pg1>.
Conclusion: Tom: So wrapping up "Refined Inference for Asymptotically Linear Estimators with Non-Negligible Second-Order Remainders". The authors are showing us that the standard sandwich estimator can be misleading if the second-order remainder isn't negligible in variance, especially when n times the remainder variance is a positive constant <ref:2603.16833#pg1>.
Jane: The paper is essentially about moving beyond just first-order inference and giving us a way to account for that missing piece of variance by decomposing the total sampling variance into three distinct components <ref:2603.16833#pg5>.
Lu: They provide specific tools like the jackknife and bootstrap as reliable alternatives when those conditions aren't met, showing they achieve correct variance targets under mild additional requirements <ref:2603.16833#pg4>.
Meng: For someone shipping models, the implication is that you can’t just rely on one formula; you need to check if your data structure—like clustering—is making things worse through that remainder term [two thousand six hundred three point one six eight three
More episodes
- Daily Summary for 2026-11-19
- 2310.07973-Statistical Performance Guarantee for Subgroup Identification with Generic Machine Learning
- 2408.09155-Learning Robust Treatment Rules for Censored Data
- Daily Summary for 2026-11-19
- 2603.23397-Kinetic Langevin Splitting Schemes for Constrained Sampling
- 2606.09906-An information-geometric framework for mapping maximum potential biodiversity
- 2603.27718-Induced replication and the assessment of models
- 1307.0898-Entropy of a Zipfian Distributed Lexicon
- 2406.19974-Generalizing self-normalized importance sampling with couplings
- 2412.10213-Collaborative Optimal Design of Controlled Experiments with Subject Covariates