Double/Debiased Machine Learning for Treatment and Structural Parameters — TEI-tagged view

Victor Chernozhukov, Denis Chetverikov, Mert Demirer, Esther Duflo · 2018 · statistics · doi:10.1111/ectj.12097 · full text at the source · TEI xml · tagged edition · index · concepts · authors
Where this record's text came from. faceted 2026-08 by reading the locally held text (pdftext); every evidence string verified as an exact substring of that text before merging. The single method facet under-describes the paper: it proves general theorems (Section 3, with proofs in the appendix), illustrates them with simulation experiments (Figures 1 and 2), and applies DML to three empirical datasets (Pennsylvania Reemployment Bonus, 401(k) eligibility and participation, Acemoglu-Johnson-Robinson institutions and growth). I set method to mathematical-proof because the theorems are the contribution and the rest is illustration. Quotes were taken only from clean prose: the extraction renders most mathematics as noise ('(cid:98)θ0', 'hk2i'-style artefacts, spaced 'N −1/2'), and the abstract's subscripted parameters appear as plain 'θ0' and 'η0', which is how they are quoted here. Many further explicit self-relations to named prior work exist (Robinson 1988 for the partially linear model, van der Laan and Rubin 2006, Athey et al. 2016 as complementary, Fan et al. 2012 for the term 'cross-fitting'); the three recorded are the ones where the paper states its own position most unambiguously. 2026-08-13 and 2026-08-14 schema-0.3 passes: every quote verified as an exact substring of the staged text and anchored at merge time; concept terms verified present; every edge endpoint an existing node. Update, 15 September 2026: EXCEPTION, measured with the merge gate's own predicate (Paper.locate): 1 quote(s) on this record are not found as one exact string in the current staged text - content_tags.statistics[0].evidence. The sentence above does not hold for them as written. Where a row records why - the quote is grounded in another copy of the paper, joins two passages with an ellipsis, or differs from the staged text by extraction noise - that note stays on the row.
The quality of the text these quotes were cut from. symbol-font-not-extractable: 445 '(cid:NNN)' glyph-index markers remain in a staged text of 139,292 characters, where the PDF's embedded font had no ToUnicode map. THE QUOTES ON THIS RECORD ARE THE PAPER'S AND THE STAGED COPY IS THE DAMAGED ONE - which is the opposite of the usual case and is why it went unnoticed: one of its 61 live quotes is not an exact substring of this text, and it was located in it by aligning the quote's WORD SEQUENCE under exactly this damage - the words are there, the characters inside them are not. Not repaired in place: editing the staged text moves every offset after the edit and re-hashes every anchor on the record. Measured at 113aae60fefc3eb1, re-measured unchanged at 54b63482778ddf56.
Some quotes on this page contain (cid:NN). The PDF this text was extracted from encodes 29 characters in a way that names no letter, so the extractor could not say what they were. The quotes keep them because a quote is reproduced exactly or it proves nothing — the marks are the source’s, not the tagging’s.
1 quote on this page carries a character that renders as nothing. 1 such character in all: an orphan combining mark. The PDF this text came from used characters that survive extraction as code points no ordinary font draws, so the quote reads as though they were never there. That can change what a sentence says: a soft hyphen left by a line break puts a space inside a word, so document reads as docu ment; a flattened superscript turns 10⁹ into 109. The quotes are reproduced exactly as the extraction left them and have NOT been repaired — the meaning of such a code point belongs to the one PDF it came from, and guessing it would produce a clean, confident, unverifiable quote.
1 quote on this page was cut from a different copy of this article. This project holds two extractions of this paper: the plain text every other quote here is anchored in, and the publisher’s own HTML edition, which we are not licensed to republish. It is verbatim in the second and cannot be found in the first — not because the tagging is wrong, but because the extraction damaged the passage: a page number dropped into the middle of a number, a formula moved out of its sentence, a ligature where two letters belong. The record names the copy for each one. The quote is the paper’s; the extraction is not.
Other fields define these differently the same word, defined another way in another discipline
bias 38 fields · machine learning 14 fields · sample-size 5 fields · confidence-interval 2 fields · statistical-significance 2 fields · linear regression 2 fields · and 1 more →
Tags on this paper every tag the record carries, whether or not the words occur in the text below — a number is how many papers in the corpus carry that tag; a tag with no number is unique to this paper
causal inference4 machine learning33 treatment effect3 orthogonalization cross-fitting Neyman orthogonality sample splitting rate requirement identification condition regularization bias mathematical-proof27

Our tag layer for this paper

Cross-disciplinary analysis
content-tags & facets: phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text
phenomenonregularization bias in semiparametric inference with machine-learned nuisance parameters— “We revisit the classic semiparametric problem of inference on a low dimensional parameter θ0 in the presence of high-dimensional nuisance parameters η0.”
claim-typemethod— “Offering a general and simple procedure for estimating and doing inference on θ0 that is formally valid in these highly complex settings is the main contribution of this paper.”
method — evidence— “In an appendix, we define additional notation and present proofs.”
transferfrom machine learning: flexible machine-learning estimators used for the nuisance functions of a causal parameter, with Neyman-orthogonal scores and cross-fitting added so their regularization bias does not carry into the estimate— “the impact of regularization bias and overfitting on estimation of the parameter of interest θ0 can be removed by using two simple, yet critical, ingredients: (1) using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters to estimate θ0, and (2) making use of cross-fitting which provides an…transfers[0]
mechanismA TERM IS BORROWED PARTLY, FOR A PROCEDURE THE SOURCE USED DIFFERENTLY, AND THE INEXACT FIT IS STATED IN THE SAME SENTENCE: we use the term CROSS-FITTING to characterize our recommended procedure, PARTLY BORROWING THE JARGON FROM an earlier paper WHICH EMPLOYED A SLIGHTLY DIFFERENT FORM of sample-splitting. The word's provenance and its imprecision are both on the page— “We use the term “cross-fitting” to characterize our recommended procedure, partly borrowing the jargon from Fan et al. (2012) which employed a slightly different form of sample-splitting”mechanisms[0]
mechanismA TRADITIONAL ASSUMPTION IS SAID TO BREAK DOWN OUTSIDE ITS REGIME, AND THE REGIME IS NAMED: the paper departs from the classical setting BY ALLOWING the nuisance parameter to be SO HIGH-DIMENSIONAL that the traditional assumptions - SUCH AS DONSKER PROPERTIES, THAT LIMIT COMPLEXITY OF THE PARAMETER SPACE - **BREAK DOWN**. What fails is not a result but a condition, and the condition is named— “We depart from the classical setting by allowing for η0 to be so high-dimensional that the traditional assumptions, such as Donsker properties, that limit complexity of the parameter space for this object break down.”mechanisms[1]
mechanismTWO GOOD METHODS COMPOSED NAIVELY ARE SHOWN TO FAIL, AND THE WORD `NAIVELY` IS THE PAPER'S: both regularization bias and overfitting in estimating the nuisance parameter cause **A HEAVY BIAS** in estimators of the target that are obtained BY NAIVELY PLUGGING ML estimators into the estimating equations. Each piece is sound; the composition is not, and the paper names the fault in the composing rather than in either part— “However, both regularization bias and overfitting in estimating η0 cause a heavy bias in estimators of θ0 that are obtained by naively plugging ML estimators of η0 into estimating equations for θ0.”mechanisms[2]
mechanismTHE REMEDY IS PRESENTED AS TWO INGREDIENTS AND THE RESULT IS GIVEN TWO NAMES AT ONCE: the impact can be removed using TWO SIMPLE, YET CRITICAL, INGREDIENTS - orthogonal moments with REDUCED SENSITIVITY to nuisance parameters, and cross-fitting - and WE CALL THE RESULTING SET OF METHODS DOUBLE OR DEBIASED ML. One method, two adjectives, offered as alternatives rather than ranked— “can be removed by using two simple, yet critical, ingredients: (1) using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters to estimate θ0, and (2) making use of cross-fitting which provides an efficient form of data-splitting. We call the resulting set of methods double or debiased ML…mechanisms[3]
mechanismA PROPERTY IS NAMED AFTER THE PERSON WHO INTRODUCED IT, AND THE ATTRIBUTION IS GIVEN AS THE REASON FOR THE NAME: we refer to property (1.8) as NEYMAN ORTHOGONALITY and to the score as the Neyman orthogonal score function DUE TO THE FUNDAMENTAL CONTRIBUTIONS in Neyman (1959) and Neyman (1979), WHERE THIS NOTION WAS INTRODUCED. The name records a debt, not a definition - and the property it names is a numbered equation, so the term is anchored to a formula rather than a gloss— “We refer to property (1.8) as “Neyman orthogonality” and to ψ as the Neyman orthogonal score function due to the fundamental contributions in Neyman (1959) and Neyman (1979), where this notion was introduced.”mechanisms[4]
mechanismTHE FORMAL CONDITION IS GIVEN AN INTUITIVE GLOSS THAT STATES WHAT IT BUYS: **INTUITIVELY**, the orthogonality condition means the moment conditions used to identify the parameter are LOCALLY INSENSITIVE to the value of the nuisance parameter, WHICH ALLOWS ONE TO PLUG IN NOISY ESTIMATES of these parameters WITHOUT STRONGLY VIOLATING the moment condition. The gloss is not a restatement - it is the licence the condition grants— “Intuitively, the Neyman orthogonality condition means that the moment conditions used to identify θ0 are locally insensitive to the value of the nuisance parameter which allows one to plug-in noisy estimates of these parameters without strongly violating the moment condition.”mechanisms[5]
mechanismA FUNCTION IS RENAMED WITH A HEDGING PREFIX WHEN ITS SPECIAL CASE IS GENERALISED: the criterion can be the log-likelihood associated to an observation - MORE GENERALLY, WE REFER TO IT AS THE QUASI-LOG-LIKELIHOOD FUNCTION. The prefix marks that the object no longer has the property its root name asserts— “can be the loglikelihood function associated to observation W . More generally, we refer to ℓ(W ; θ, β) as the quasi-log-likelihood function.”mechanisms[6]
mechanismA CONDITION IS DECLARED NONPRIMITIVE AND ITS OWN CONDITIONS ARE DECLINED AS CASE-SPECIFIC: THE ONLY NONPRIMITIVE CONDITION HERE is the assumption on the rate of estimating the nuisance parameters - those rates are available for most used methods and are CASE-SPECIFIC, SO WE DO NOT RESTATE the conditions needed to reach them. The assumption is labelled as resting on assumptions that are not given— “The only nonprimitive condition here is the assumption on the rate of estimating the nuisance parameters. These rates of convergence are available for most often used ML methods and are case-specific, so we do not restate conditions that are needed to reach these rates.”mechanisms[7]
mechanismA BOUND THE AUTHORS THEMSELVES IMPOSE IS NAMED THE CRUDE BOUND, AND FINER CONDITIONS ARE OFFERED IN ITS PLACE: a structural feature of the examples allows us to require MUCH FINER CONDITIONS on the quality of the nuisance parameter estimators THAN THE CRUDE BOUND (3.8). The paper's own requirement carries a pejorative as its standing name, and the numbered equation is what the pejorative attaches to— “This feature allows us to require much finer conditions on the quality of the nuisance parameter estimators than the crude bound (3.8).”mechanisms[8]
mechanismA DISPENSED-WITH CONDITION IS REPLACED BY A WEAKER ONE AND THE REPLACEMENT IS THEN CRITICISED IN THE SAME PARAGRAPH: WITHOUT INVOKING DONSKER CONDITIONS, one may still show that the troublesome terms vanish **AS LONG AS** the entropy DOES NOT INCREASE WITH N TOO RAPIDLY - HOWEVER, THESE CONDITIONS ON THE GROWTH OF ENTROPY COULD RESULT IN UNNECESSARILY STRONG RESTRICTIONS ON MODEL COMPLEXITY. What was an assumption about a function class becomes a growth rate; the substitution is announced, and so is the price of the thing substituted in— “Without invoking Donsker conditions, one may still show that terms such as (1.7) vanish as long as GN ’s entropy does not increase with N too rapidly. A fairly general treatment is given in Belloni et al. (2017) who provide a set of conditions under which terms like c∗ can vanish making use of the full sample. However, these conditions on the…mechanisms[9]
builds-on Neyman orthogonality (statistics)— “using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters to estimate θ0, and (2) making use of cross-fitting which provides an efficient form of data-splitting. We call the resulting set of methods double or debiased ML (DML)”claim_relations[0]
contradicts the naive plug-in of ML estimators into estimating equations— “obtained by naively plugging ML estimators of η0 into estimating equations for θ0.”claim_relations[1]
builds-on Neyman (1959) and Neyman (1979)— “We refer to property (1.8) as “Neyman orthogonality” and to ψ as the Neyman orthogonal score function due to the fundamental contributions in Neyman (1959) and Neyman (1979), where this notion was introduced.”claim_relations[2]
builds-on Belloni et al. (2010) and Belloni et al. (2012)— “Our treatment builds upon the sample-splitting ideas employed in Belloni et al. (2010) and Belloni et al. (2012) who considered sample-splitting in a high-dimensional sparse optimal IV model to weaken the sparsity condition mentioned in the previous paragraph to s ≪ n.”claim_relations[3]
extends the classical literature on semiparametric estimation— “A major point of departure of the present work from the classical literature on semiparametric estimation is its explicit focus on high-complexity/entropy cases.”claim_relations[4]
sensethe o(N^-1/4) rate - A WORST CASE, NOT THE REQUIREMENT: the paper calls it the crude requirement that smooth problems translate to, and says in the same breath that the conditions can be refined, so the number that travels out of this paper is the loosest form of a condition the paper itself tightens— “In smooth problems, these conditions translate to the crude requirement that nuisance parameters are estimated at the o(N −1/4) rate as discussed previously in the case with linear scores. However, these conditions can be refined”senses[0]
senseNeyman orthogonality - A DERIVATIVE AT A POINT, GLOSSED AS LOCAL INSENSITIVITY: the moment condition is locally insensitive to the nuisance value, which is what licenses plugging in noisy estimates without strongly violating it; the property is evaluated at the truth and both hedges - locally, and without strongly violating - are in the sentence that explains it— “Intuitively, the Neyman orthogonality condition means that the moment conditions used to identify θ0 are locally insensitive to the value of the nuisance parameter which allows one to plug-in noisy estimates of these parameters without strongly violating the moment condition”senses[1]
sensecross-fitting - COINED IN THIS SENTENCE, WITH ITS DEFINITION ATTACHED: the name is introduced for the procedure of swapping the roles of main and auxiliary samples and averaging the resulting estimates, so unlike the eponyms in our absent-names table this word cannot come apart from its referent - the paper that named it also defined it— “We call this sample splitting procedure where we swap the roles of main and auxiliary samples to obtain multiple estimates and then average the results cross-fitting”senses[2]
controlflexibly controlling for a rich set of variables in the 401(k) example, where assignment is observational - and the elimination holds only under the paper's own identifying assumptions, which the sentence states as an aim rather than a demonstrated result — partial — rules out bias from the lack of random assignment of the treatment variable— “In this example, the treatment variable is not randomly assigned and we aim to eliminate the potential biases due to the lack of random assignment by flexibly controlling for a rich set of variables.”controls[0]
edgecross-fitting —is-a→ sample splitting— “We call this sample splitting procedure where we swap the roles of main and auxiliary samples to obtain multiple estimates and then average the results cross-fitting”concept_edges[0]
outcome (stated by the tagger, no quotation)control — partialcontrols[0]
for which uselimitation — the stated regularity conditions: THE CONDITIONS ARE NOT THE TIGHTEST POSSIBLE, BUT OFFER A SET OF SIMPLE CONDITIONS UNDER WHICH THEOREM 5.1 FOLLOWS AS A SPECIAL CASE— “The conditions are not the tightest possible, but offer a set of simple conditions under which Theorem 5.1 follows as a special case of the general theorem provided in Section 3.”limitations[0]
for which uselimitation — Assumption 5.1 as stated: THE CONDITIONS ... ARE FAIRLY SHARP THOUGH SOMEWHAT SIMPLIFIED FOR EASE OF PRESENTATION— “The conditions in Assumption 5.1 are fairly sharp though somewhat simplified for ease of presentation.”limitations[1]
for which uselimitation — any rule of thumb about cross-fitting folds: THERE DOES NOT APPEAR TO BE A GENERAL RELATIONSHIP BETWEEN THE NUMBER OF FOLDS IN CROSS-FITTING AND THE PRECISION OF THE ESTIMATE OF THE PARAMETER OF INTEREST— “While intuitive, we note that this statement does not seem to be generalizable in that there does not appear to be a general relationship between the number of folds in cross-fitting and the precision of the estimate of the parameter of interest; see the next example.”limitations[2]
for which uselimitation — the set of nuisance estimators the empirical section reports: deep learning was tried, and WE RAN INTO STABILITY AND COMPUTATIONAL ISSUES AND CHOSE NOT TO REPORT THESE RESULTS IN THE EMPIRICAL SECTION— “However, we ran into stability and computational issues and chose not to report these results in the empirical section.”limitations[3]
for which uselimitation — the o(N^-1/4) nuisance rate usually quoted from this paper: the authors state it is the crude requirement imposed if only condition (3.7) holds, and that the conditions can be refined— “If only (3.7) holds, Assumption 3.2, particularly λ′ N = o(N −1/2), imposes the (crude) rate requirement”limitations[4]
for which uselimitation — any application of the crude rate requirement: the authors note that many important structured problems - including partially linear regression models and average treatment effects under unconfoundedness - have vanishing cross-derivatives and so allow more refined requirements— “We note that many important structured problems – such as estimation of parameters in partially linear regression models, estimation of parameters in partially linear structural equation models, and estimation of average treatment effects under unconfoundedness – are such that some cross-derivatives vanish”limitations[5]
for which uselimitation — the causal interpretation of estimates from this method: the identification condition is imposed as an assumption alongside Neyman orthogonality and smoothness, so the theory delivers estimation and inference for a parameter that is already identified— “The identification condition holds; namely, the singular values of the matrix are between c0 and c1. J0 := EP [ψa(W ; η0)] Assumption 3.1 requires scores to be Neyman orthogonal or near-orthogonal and imposes mild smoothness requirements as well as the canonical identification condition”limitations[6]
for which uselimitation — the claim that this method is robust to the choice of nuisance estimator: the moment conditions are described as locally insensitive to the nuisance value, permitting noisy plug-in estimates without strongly violating the moment condition— “Intuitively, the Neyman orthogonality condition means that the moment conditions used to identify θ0 are locally insensitive to the value of the nuisance parameter which allows one to plug-in noisy estimates of these parameters without strongly violating the moment condition”limitations[7]
evidence status notemechanism — The sentence that follows the span states the consequence - the naive estimator failing to be N-to-the-minus-one-half consistent - but it is written with inline rate notation that this record's slicing guard refuses, so the clause is described here and not quoted.— “However, both regularization bias and overfitting in estimating η0 cause a heavy bias in estimators of θ0 that are obtained by naively plugging ML estimators of η0 into estimating equations for θ0.”mechanisms[2]
evidence status notemechanism — The paper makes this disclaimer TWICE, word for word, in Remark 4.1 and Remark 5.1, spelling the term “nonprimitive” in the first and “non-primitive” in the second. The span is the Remark 4.1 instance; the repetition is a property of the file, not of this quote, which is why it is recorded here.— “The only nonprimitive condition here is the assumption on the rate of estimating the nuisance parameters. These rates of convergence are available for most often used ML methods and are case-specific, so we do not restate conditions that are needed to reach these rates.”mechanisms[7]
evidence status notemechanism — The parenthesis I wanted, “imposes the (crude) rate requirement”, is embedded in display mathematics and cannot be sliced clean. The span is the same paper calling the same bound “the crude bound” in prose, three occurrences later.— “This feature allows us to require much finer conditions on the quality of the nuisance parameter estimators than the crude bound (3.8).”mechanisms[8]
noteNeyman-orthogonal moments/scores → regularization bias — PROVENANCE ROW. This is one of the two instances behind the project's 2026-08-14 ruling: with no type for it, the relation was filed as a 'limitation', where the paper's headline result reads as OUR doubt about the method. It is NO LONGER UNHOUSED - 'causes' with 'effect_direction: eliminates' expresses it, which is what an earlier note of ours added the same evening. Kept so the file records why it exists, and excluded whenever the coverage count is quoted.— “We show that the impact of regularization bias and overfitting on estimation of the parameter of interest θ0 can be removed by using two simple, yet critical, ingredients: (1) using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters”unhoused_relations[0]
replicationuntested
no type for thisNeyman-orthogonal moments/scores → regularization bias — the method REMOVES the impact of a bias that the naive estimator suffers - the paper's own central result, stated as a repair rather than a relation between two objects of study— “We show that the impact of regularization bias and overfitting on estimation of the parameter of interest θ0 can be removed by using two simple, yet critical, ingredients: (1) using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters”unhoused_relations[0]
limitationThe regularity conditions given for the treatment-effect results are simplified rather than tightest possible— “The conditions are not the tightest possible, but offer a set of simple conditions under which Theorem 5.1 follows as a special case of the general theorem provided in Section 3.”limitations[0]
limitationAssumption 5.1 is simplified for presentation rather than stated at full sharpness— “The conditions in Assumption 5.1 are fairly sharp though somewhat simplified for ease of presentation.”limitations[1]
limitationThe empirical finding that more folds gives smaller standard errors does not generalise— “While intuitive, we note that this statement does not seem to be generalizable in that there does not appear to be a general relationship between the number of folds in cross-fitting and the precision of the estimate of the parameter of interest; see the next example.”limitations[2]
limitationDeep-learning nuisance estimators were tried but hit stability and computational problems and were left unreported— “However, we ran into stability and computational issues and chose not to report these results in the empirical section.”limitations[3]
limitationThe rate condition the method is known for is a crude bound that follows only under one of the paper's conditions.— “If only (3.7) holds, Assumption 3.2, particularly λ′ N = o(N −1/2), imposes the (crude) rate requirement”limitations[4]
limitationSeveral of the paper's own headline applications admit weaker conditions than the crude one.— “We note that many important structured problems – such as estimation of parameters in partially linear regression models, estimation of parameters in partially linear structural equation models, and estimation of average treatment effects under unconfoundedness – are such that some cross-derivatives vanish”limitations[5]
limitationIdentification is assumed, not established: it is listed among the conditions the theorems require.— “The identification condition holds; namely, the singular values of the matrix are between c0 and c1. J0 := EP [ψa(W ; η0)] Assumption 3.1 requires scores to be Neyman orthogonal or near-orthogonal and imposes mild smoothness requirements as well as the canonical identification condition”limitations[6]
limitationThe insensitivity to the nuisance estimate is local and approximate, in the authors' own gloss.— “Intuitively, the Neyman orthogonality condition means that the moment conditions used to identify θ0 are locally insensitive to the value of the nuisance parameter which allows one to plug-in noisy estimates of these parameters without strongly violating the moment condition”limitations[7]
Content tags
content-observations: finding · quantity · variable · definition · key-term — grounded in the full text
findingDouble/debiased ML estimates the target parameter with Neyman-orthogonal scores that have reduced sensitivity to nuisance parameters, and with cross-fitting, an efficient form of data-splitting.— “using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters to estimate θ0, and (2) making use of cross-fitting which provides an efficient form of data-splitting. We call the resulting set of methods double or debiased ML (DML)”content_tags.findings[0]
findingNaively plugging ML estimates of the nuisance parameters into estimating equations causes a heavy bias in the target estimator, from both regularization bias and overfitting.— “both regularization bias and overfitting in estimating η0 cause a heavy bias in estimators of θ0 that are obtained by naively plugging ML estimators of η0 into estimating equations”content_tags.findings[1]
variablenuisance parameter (independent)— “the nuisance parameter will be estimated using machine”content_tags.variables[0]
definitionDML— “We call the resulting set of methods double or debiased ML (DML)”content_tags.definitions[0]
definitionNeyman-orthogonal moments— “using Neyman-orthogonal moments/scores that have reduced sensitivity with respect to nuisance parameters to estimate θ0, and (2) making use of cross-fitting which provides an efficient form of data-splitting. We call the resulting set of methods double or debiased ML (DML)”content_tags.definitions[1]
definitioncross-fitting— “making use of cross-fitting which provides an efficient form of data-splitting”content_tags.definitions[2]
key-termsnuisance, parameters, orthogonal, cross-fitting, treatment, causal, bias, estimation, machine learning
Concepts
terms this paper carries, each with the sentence it was cut from — the layer that joins one paper to another. Terms with no quote yet are on CONCEPTS.html.
conceptcross-fitting— “We call this sample splitting procedure where we swap the roles of main and auxiliary samples to obtain multiple estimates and then average the results cross-fitting”concepts[4]
conceptNeyman orthogonality— “Intuitively, the Neyman orthogonality condition means that the moment conditions used to identify θ0 are locally insensitive to the value of the nuisance parameter which allows one to plug-in noisy estimates of these parameters without strongly violating the moment condition”concepts[5]
conceptsample splitting— “We call this sample splitting procedure where we swap the roles of main and auxiliary samples to obtain multiple estimates and then average the results cross-fitting”concepts[6]
conceptrate requirement— “If only (3.7) holds, Assumption 3.2, particularly λ′ N = o(N −1/2), imposes the (crude) rate requirement”concepts[7]
conceptidentification condition— “The identification condition holds; namely, the singular values of the matrix are between c0 and c1. J0 := EP [ψa(W ; η0)] Assumption 3.1 requires scores to be Neyman orthogonal or near-orthogonal and imposes mild smoothness requirements as well as the canonical identification condition”concepts[8]
conceptregularization bias— “However, both regularization bias and overfitting in estimating η0 cause a heavy bias in estimators of θ0 that are obtained by naively plugging ML estimators of η0 into estimating equations for θ0.”concepts[9]
Statistics — cross-field join keys
field-invariant statistical terms, used in their statistical sense (gated on a number / symbol / test). A p-value or a standard deviation means the SAME thing in physics, biology, psychology and sociology — so these are the strongest cross-field join keys. Grounded verbatim.
confidence-interval CI— “Then the confidence interval obeys (cid:104) CI := l′ ̃θ0 ± Φ−1(1 − α/2)(cid:112)l′ (cid:105) (cid:98)σ2l/N (cid:12) (cid:12) (cid:12)PP (l′θ0 ∈ CI) − (1 − α) (cid:12) (cid:12) (cid:12) → 0.” [checked against the archived source, not this rendering]content_tags.statistics[0]
evidence status noteconfidence-interval — DAMAGED GLYPHS IN THIS QUOTE: (cid:104), (cid:105), (cid:112), (cid:12), (cid:98). These are raw PDF font glyph indices that leaked out in place of the characters they stand for - usually a mathematical operator. The quote is verbatim to the staged text and its anchor is sound; the STAGED TEXT is what is damaged. NOT repaired: the cid-to-character mapping is defined by the font embedded in that particular PDF, so guessing it would produce a clean and unverifiable quote. Repair needs the source PDF and is a re-staging job.content_tags.statistics[0]
not machine-vouchedconfidence-interval — quote-differs-from-our-copy - The quote IS in our copy of this paper - the passage is there, in one place - and is not an exact substring of it. THE DIFFERENCE IS IN THE QUOTE, not in the body: the quote has 'l' where our copy has 'ℓ'; the quote has '̃' where our copy has '˜'; the quote has 'l' where our copy has 'ℓ' (6 differences in all). This body carries 445 '(cid:NNN)' glyph ids, 2 detached diacritics. Nothing is repaired in place: editing either side moves every offset after it and re-hashes every anchor on the record.content_tags.statistics[0]
mean μ as written: mean of— “We are now solving an auxiliary prediction problem to estimate the conditional mean of D given X, so we are doing “double prediction” or “double machine learning”.”content_tags.statistics[2]
median— “Incorporating the Impact of Sample Splitting using Mean and Median Methods) For point estimation, we define ˜θmean 0 = 1 S S (cid:88) s=1 ˜θs 0 or ˜θmedian 0 = median{ ˜θs 0}S s=1, where the median operation is applied coordinatewise” [checked against the archived source, not this rendering]content_tags.statistics[3]
evidence status notemedian — QUOTE RECOVERED FROM THE PAPER'S OWN CHARACTERS. The recorded quote was LETTERS-ONLY IDENTICAL to this stretch of the staged text but not an exact substring of it - spaces, hyphens, ligature glyphs or mathematical operators differed, so it could never anchor. This is the file's own text between the same two letters: not produced by a rule about the damage, copied out of the file. Round-trip checked (the recovered span is letters-only equal to the original) and length-checked. The text as originally recorded is kept in evidence as extracted.content_tags.statistics[3]
regression β as written: linear regression— “applying it to provide theoretical properties of DML applied to learn the main regression parameter in a partially linear regression model, DML applied to learn the coefficient on an endogenous variable in a partially linear instrumental variables”content_tags.statistics[4]
sample-size n/Ncontent_tags.statistics[5]
standard-error SE as written: standard errorscontent_tags.statistics[6]
statistical-significance as written: statistically significantcontent_tags.statistics[7]
evidence status notestatistical-significance — QUOTE REPAIRED: the extractor split a hyphen-space and the quote was recorded faithfully with the damage in it, which made it unanchorable. The repaired string is an EXACT SUBSTRING of the staged text - that is why it was accepted, not because a rule produced it. The text as originally recorded is kept in evidence as extracted.content_tags.statistics[7]
variance σ²content_tags.statistics[8]
evidence status notevariance — DAMAGED GLYPHS IN THIS QUOTE: (cid:98). These are raw PDF font glyph indices that leaked out in place of the characters they stand for - usually a mathematical operator. The quote is verbatim to the staged text and its anchor is sound; the STAGED TEXT is what is damaged. NOT repaired: the cid-to-character mapping is defined by the font embedded in that particular PDF, so guessing it would produce a clean and unverifiable quote. Repair needs the source PDF and is a re-staging job.content_tags.statistics[8]

When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote for that row; on this page it is withheld with the article, and the article is at its publisher. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.

Tag layer © the Meta-Tagging Project, CC BY 4.0. The paper text is © its authors/publisher and is linked, not reproduced. Excerpts shown are short quotations for identification and verification. · back to index · concepts · authors · עברית
© 2026 Shir Sivroni · ORCID 0009-0000-2597-2824