Pith. sign in

REVIEW 4 major objections 6 minor 1 cited by

Hybrid Meta-learners for Estimating Heterogeneous Treatment Effects

T0 review · 4 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Pith's one-line read Indirect and direct meta-learners are endpoints of one regularization spectrum, and a tunable hybrid—the H-learner—estimates CATE with lower risk than either endpoint.

desk verdict Sensible interpolation idea with a clean closed form and decent experiments, but the theory proves a scalar combination result that does not connect to the actual λ-parametrized H-learner. read the letter →

arxiv 2506.13680 v2 pith:DUSAX5CK submitted 2025-06-16 cs.LG stat.ME

classification cs.LGstat.ME
keywords heterogeneoustreatmenteffectsCATEestimationmeta-learnersregularizationbias-variancetradeoffpseudo-outcomesinductivebiasneuralnetworks
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Estimating how a treatment's effect varies across people usually forces a choice between two strategies: fit separate outcome models and subtract them, or construct a pseudo-outcome and fit the effect function directly. Each strategy wins in some settings and loses in others, and in practice the data-generating process is unknown. This paper claims the choice is unnecessary: a single loss that interpolates between the two—the H-learner—trains two intermediate functions whose difference approximates the treatment effect, deliberately allowing each function to fit its outcome imperfectly. The paper shows that this improves the bias–variance tradeoff in estimating the effect, and that a tuning parameter $\lambda$ lets the estimator settle at the best compromise, which empirically lies strictly between the two extremes on standard benchmarks.

What carries the argument

The load-bearing object is the H-learner objective, a single loss combining an indirect term (factual outcome fit for $f_0$ and $f_1$) and a direct term (the squared gap between $f_1-f_0$ and a Stage-1 pseudo-outcome), blended by the scalar $\lambda$. The paper's key identity is the closed-form solution of Theorem 5.1 in the linear setting, $\hat{\theta}_H = (I-W)\hat{\theta}_{\text{ind}} + W\hat{\theta}_{\text{dir}}$ with $W = \lambda A[(1-\lambda)I+\lambda A]^{-1}$ and $A = (G_1^{-1}+G_0^{-1})G$: a matrix-weighted average of the indirect and direct least-squares estimators whose per-direction weights $\lambda\mu_i/((1-\lambda)+\lambda\mu_i)$ depend on the eigenvalues $\mu_i$ of $A$ and grow with both $\lambda$ and the ill-conditioning of the smaller treatment arm. That geometry is what makes the regularization adaptive. The argument is carried by the bias–variance decomposition of Theorem 5.3, which reduces the choice between two learners to a convex combination problem with a provably interior optimum under the two sufficient conditions of Corollaries 5.4 and 5.5; in practice $\lambda$ is selected by minimizing a validation proxy for PEHE in which outcome models are retrained on the validation split precisely so that the score is not biased toward the direct endpoint.

What would settle it

On each of the 77 ACIC 2016 DGPs, compute the $\lambda$ chosen by the paper's validation proxy and the $\lambda$ that actually minimizes test PEHE; if under strong confounding or severe imbalance the two diverge sharply—or if the interior-$\lambda$ hybrid fails to beat both its $\lambda=0$ and $\lambda=1$ endpoints on those DGPs—the central claim that balancing the two regularizations improves CATE estimation would be refuted for precisely the settings where the paper reports significance.

Watch

Extended reading notes

Core claim

The central claim is that indirect and direct meta-learners are endpoints of one regularization spectrum, not competing paradigms. The H-learner minimizes $(1-\lambda)\sum_i \ell(Y_i, f_{T_i}(X_i)) + \lambda\sum_i ((f_1(X_i)-f_0(X_i)) - Y_{\phi,i})^2$, so $\lambda=0$ recovers the indirect learner, $\lambda=1$ the direct learner, and intermediate values ask two intermediate functions $f_0, f_1$ to predict the potential outcomes while their difference tracks a pseudo-outcome guess of the CATE. Intentionally accepting suboptimal fits to the outcomes is the point: it buys lower variance in the difference without the independent-regularization bias that plagues indirect learners. In the linear model the estimator has the closed form $\hat{\theta}_H = (I-W)\hat{\theta}_{\text{ind}} + W\hat{\theta}_{\text{dir}}$ with $W = \lambda A[(1-\lambda)I + \lambda A]^{-1}$ and $A = (G_1^{-1}+G_0^{-1})G$, so the blend is direction-wise and shifts toward the direct estimate as treatment imbalance or poor overlap ill-conditions the group Gram matrices. Under cross-fitting the MSE decomposes as $(1-\omega)^2\text{MSE}_{\text{ind}} + \omega^2\text{MSE}_{\text{dir}} + 2\omega(1-\omega)b_{\text{ind}}^\top b_{\text{dir}}$, which yields an interior optimal $\omega$ whenever the two estimators' biases point in opposite directions or the direct learner's variance is large enough; the paper reports H-learner PEHE below both endpoints on IHDP and ACIC 2016, with the optimal $\lambda$ strictly inside $(0,1)$.

Load-bearing premise

The reported advantage rests on the rule that selects $\lambda$: it assumes a proxy PEHE score built from outcome models retrained on the validation set tracks the true test PEHE, a check performed for one synthetic setup but not across the full benchmark range, and if that proxy misleads, the hybrid's gains over its two endpoints can disappear.

Editorial extensions

If this is right

  • A practitioner no longer has to guess whether the outcome functions or the effect function are the simpler target; the same architecture with one extra hyperparameter interpolates between the two regimes and lets the data pick the blend.
  • Under poor overlap, heavy confounding, or an imbalanced treatment arm, the estimator automatically shifts weight toward direct regularization—exactly where indirect learners are most fragile—because the relevant eigenvalues of $A$ grow as the smaller group's Gram matrix becomes ill-conditioned.
  • When the CATE is simpler than the potential outcomes the hybrid effectively behaves as a direct learner, and when the CATE is as complex as the outcomes it behaves as an indirect learner, tracking the regime in which each family is known to win.
  • In the linear setting, if the two learners' biases point in opposite directions, or the indirect learner has larger bias while the direct learner's variance is sufficiently large, the hybrid is guaranteed strictly lower MSE than either endpoint, so the benefit is a theorem rather than only a tuning trick.
  • On the IHDP and ACIC 2016 benchmarks the hybrid reports the lowest PEHE among all compared meta-learners and regularization baselines, with the X-learner pseudo-outcome variant best and statistically significant.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The principle that two functions should be regularized jointly toward their difference, not individually toward their targets, likely transfers beyond causal inference to any difference-estimation problem—digital-twin comparisons, pre/post difference models, or two-model ensemble disagreement—wherever the components are noisy but their gap is the object of interest.
  • Because the linear analysis shows the optimal blend is direction-wise in feature space, a natural extension the authors do not pursue is per-feature or per-direction $\lambda$; the eigenvalue argument suggests the gain would be largest when ill-conditioning concentrates in particular covariate directions.
  • The validation proxy for PEHE is the fragile link; swapping in doubly-robust or influence-function-based model-selection scores—approaches the paper cites for related purposes—is a concrete, testable way to make $\lambda$ selection reliable away from synthetic setups.
  • The reported experiments are neural-network-only; since the loss is model-agnostic, a cheap check is to apply the hybrid objective to gradient-boosted trees or kernel ridge regression, where indirect learners have traditionally dominated.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper introduces the H-learner, a two-stage estimator that interpolates between indirect meta-learners (fit and regularize potential-outcome models, then subtract) and direct meta-learners (regress a pseudo-outcome on covariates). The H-learner minimizes (1−λ) times the two factual-outcome losses plus λ times the squared difference between (f1−f0) and a pseudo-outcome Yφ, with λ tuned on validation data. In the linear case the estimator is θ_H = (I−W)θ_ind + Wθ_dir with W = λA[(1−λ)I+λA]^{-1}. The paper gives a bias–variance decomposition along the scalar path W=ωI and claims sufficient conditions for improvement over both endpoints, then validates the method on semi-synthetic IHDP variants and ACIC 2016 benchmarks, reporting PEHE gains over TARNet, X-learner, DR-learner, and structural regularizers.

Significance. If established, the H-learner would be a practical way to interpolate between two meta-learning paradigms with complementary failure modes, and the experimental design is a strength: the paper ships code, uses standard benchmarks, and the semi-synthetic setups for feature sharing, imbalance, and confounding isolate the claimed inductive-bias trade-offs. The linear closed form of Theorem 5.1 is a clean and useful identity. However, the central theoretical result is not currently proven: the argument only shows that some matrix-weighted combination can improve on the endpoints, not that the one-parameter family W(λ) actually reaches the improvement, and the theory's cross-fitting assumption is contradicted by the implementation. The empirical evidence is suggestive but does not by itself close these gaps.

major comments (4)
  1. [§5.2 (Theorem 5.3 and following paragraph)] The sentence 'Since min_W MSE_H(W) ≤ min_ω MSE_H(ωI), any improvement achieved along this scalar path provides a sufficient condition' does not support the claim that the H-learner improves. The H-learner cannot optimize over arbitrary matrix weights W; Theorem 5.1 restricts it to the curve W(λ)=λA[(1−λ)I+λA]^{-1}. The optimal scalar weight ω*I obtained in Theorem 5.3 is attainable only if A is a scalar multiple of the identity, which is not assumed and generally fails under imbalance or confounding. Therefore Corollaries 5.4 and 5.5 do not establish existence of a λ with MSE_H(λ) < min(MSE_ind, MSE_dir), and the central contribution 2 is unsupported. Please analyze the risk along the actual curve W(λ), or add explicit conditions under which that curve contains a beneficial weight.
  2. [Assumption 5.2 vs. Appendix A.2] Assumption 5.2 assumes cross-fitting so that Cov(θ_ind, θ_dir)=0, and Theorem 5.3 then sets D=b_ind^T b_dir. Appendix A.2 states that both stages are trained on the full dataset D and sample splitting is omitted. The evaluated procedure therefore has a nonzero covariance term tr(Σ_ind,dir) in the MSE expansion of Appendix B.2.2, and the corollaries' conditions do not apply to it. This is a direct mismatch between the theory and the experiments; either the implementation should be changed to cross-fit, or the theory should carry the covariance term through the conditions.
  3. [Appendix A.3 (Table 3)] The empirical claim that the H-learner consistently outperforms both baselines depends on the validation-based selection of λ described in Appendix A.3. That procedure is validated against the oracle λ* only for the single synthetic Setup A (Table 3); no evidence is provided that the proxy loss tracks test PEHE across the IHDP, ACIC 2016, or the other semi-synthetic setups. Because the theoretical guarantee in Section 5 is currently incomplete, the empirical results are the main support for the paper's claims, and this support should include a broader check of the λ-selection mechanism or an explicit statement of its limitations.
  4. [Appendix B.2.1 vs. §5.2] Appendix B.2.1 assumes isotropic covariates, Σ_X = cI_d, to equate parameter-space MSE with CATE prediction error, but Section 5.2 states Theorem 5.3 and Corollaries 5.4–5.5 without this caveat. On the datasets used in Section 6 the covariates are not isotropic, and the analysis is not applied to whitened features, so the Euclidean-norm comparisons in Theorem 5.3 are not prediction-risk comparisons without the isotropy assumption or a Σ_X-weighted norm. The theorem statements need to carry this assumption explicitly.
minor comments (6)
  1. [Appendix B.2.2] The sentence introducing eind and edir repeats the phrase 'denote the estimation errors of the indirect and direct estimators'; delete the duplicate.
  2. [Appendix B.2.3] In the proof of Corollary 5.5, 'Varpˆθindq“trpΣdirq' should attribute trp(Σ_dir) to the direct estimator, i.e., 'Varpˆθdirq“trpΣdirq'.
  3. [Figure 3] Figure 3's legend contains a truncated label ('H-learner ( )'); restore it so the plotted curve is identifiable.
  4. [Appendix B.2.1] The notation Σ_X := E[XX^T] uses X for both the n×d data matrix and a random covariate vector; use a lower-case x for the covariate distribution.
  5. [Figure 4] The x-axis label in Figure 4 (Setup C) reads 'Degree of Confounding (1 )' and appears to be missing the α symbol; please correct.
  6. [§6.2 (Figure 5)] The text near Figure 5 should state whether the 'best-performing λ' is the validation-selected λ or an oracle λ chosen on test PEHE; the figure appears to use the latter.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: H-learner derivation is self-contained; the scalar-path theory gap is a proof gap, not a circular reduction.

full rationale

No circularity found. The H-learner is defined by the loss in Eq. (7), a convex combination of an indirect PO-fitting loss and a direct pseudo-outcome loss; the closed-form OLS solution in Theorem 5.1 is derived algebraically from that loss, not assumed. The bias-variance analysis in Theorem 5.3 and Corollaries 5.4-5.5 is a standard MSE decomposition of a convex combination of two estimators, with conditions under which such a combination beats both endpoints; it does not take the conclusion as an input. The lambda selection procedure in Appendix A.3 trains validation-set outcome models and uses a proxy PEHE loss to select a hyperparameter, which is standard model selection rather than a fitted parameter renamed as a prediction, and Table 3 explicitly compares the validation-selected lambda with the oracle optimum. The only self-citation by a co-author (Alaa and Van Der Schaar, 2019, cited in Appendix A.3) is a non-load-bearing pointer to prior validation heuristics, not the basis of the central claim. The skeptic's objection that the scalar-path analysis W = omega*I does not cover the actual lambda-parametrized matrix curve W(lambda) identifies a genuine logical gap between Theorem 5.3 and the claim about the H-learner itself, but that is a proof gap or correctness issue, not circularity: the paper never assumes what it is trying to prove, and its empirical claims are evaluated against external benchmarks (IHDP and ACIC 2016) with independent baselines. The derivation chain is therefore self-contained, and no step reduces to its own inputs by construction.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical entities, particles, or forces. The main axioms are standard causal inference assumptions plus two simplifications used only in the theoretical analysis (isotropic covariates and cross-fitting independence). The single free parameter is lambda, the interpolation weight, which is tuned via validation.

free parameters (1)
  • lambda = tuned on validation set; observed optimal values 0.49 to 0.67 in Table 3
    The interpolation weight between indirect and direct objectives in the H-learner loss (Eq. 7) is chosen by minimizing a proxy validation loss; it is not fixed a priori.
assumptions (4)
  • domain assumption CATE identifiability conditions: consistency, unconfoundedness (Y(0), Y(1)) ⊥ T | X, and positivity 0 < π(x) < 1
    Stated in Section 1 as the conditions under which τ(x) is identifiable from observational data.
  • domain assumption Isotropy of covariates: Σ_X = E[XX'] = c I_d
    Used in Appendix B.2.1 to equate parameter-space MSE with CATE prediction error up to a constant; this is a strong distributional assumption not satisfied by the benchmark datasets.
  • domain assumption Cross-fitting independence of indirect and direct estimators: Cov(θ_ind, θ_dir) = 0
    Assumption 5.2 used in Theorem 5.3 and Corollaries 5.4 to 5.5. The implementation, however, trains both stages on the full dataset, violating this assumption.
  • standard math Pseudo-outcome property: E[Y_phi | X] = CATE for IPW and DR learners when the propensity score is known
    Used in Section 2.2 to characterize direct meta-learners; for the X-learner the property holds only approximately.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Hybrid Meta-learners for Estimating Heterogeneous Treatment Effects." pith.science (2026). https://pith.science/paper/DUSAX5CK

@misc{pith2026250613680,
  author       = {Pith},
  title        = {Pith review of: Hybrid Meta-learners for Estimating Heterogeneous Treatment Effects},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DUSAX5CK}},
  note         = {Machine review of arXiv:2506.13680}
}
read the original abstract

Estimating conditional average treatment effects (CATE) from observational data involves modeling decisions that differ from supervised learning, particularly concerning how to regularize model complexity. Previous approaches can be grouped into two primary "meta-learner" paradigms that impose distinct inductive biases. Indirect meta-learners first fit and regularize separate potential outcome (PO) models and then estimate CATE by taking their difference, whereas direct meta-learners construct and directly regularize estimators for the CATE function itself. Neither approach consistently outperforms the other across all scenarios: indirect learners perform well when the PO functions are simple, while direct learners outperform when the CATE is simpler than individual PO functions. In this paper, we introduce the Hybrid Learner (H-learner), a novel regularization strategy that interpolates between the direct and indirect regularizations depending on the dataset at hand. The H-learner achieves this by learning intermediate functions whose difference closely approximates the CATE without necessarily requiring accurate individual approximations of the POs themselves. We demonstrate that intentionally allowing suboptimal fits to the POs improves the bias-variance tradeoff in estimating CATE. Experiments conducted on semi-synthetic and real-world benchmark datasets illustrate that the H-learner consistently operates at the Pareto frontier, effectively combining the strengths of both direct and indirect meta-learners.

Figures

Figures reproduced from arXiv: 2506.13680 by the authors.

Figure 1
Figure 1. Impact of inductive biases on CATE estimation. (a) When CATE is simpler than POs, indirect learners introduce spurious heterogeneity due to independent regularization. (b) When CATE is as complex as POs, indirect learners perform better by accurately modeling each outcome surface. To understand how regularization affects learning of CATE, consider the following illustrative example, with variants of this example app… view at source ↗
Figure 2
Figure 2. Pictorial depiction of the H-learner. Formally, the H-learner loss function balances both POs prediction and treatment effect estimation, and is given by: min f0,f1 řn i“1 p1 ´ λq ℓpYi , fTi pXiqq looooooomooooooon Indirect component ℓI ` λ ` pf1pXiq ´ f0pXiqq ´ Yφ,i˘2 looooooooooooooooomooooooooooooooooon Direct component ℓD , (7) where 0 ď λ ď 1, and we obtain the final CATE estimator as ˆτ pxq “ ˆf1pxq ´ ˆf0pxq. … view at source ↗
Figure 3
Figure 3. MSE and bias-variance decomposition of H [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: PEHE results for three semi-synthetic scenarios. In all setups, we observe performance trade-offs [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: Performance of H-learner across different [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]
Figure 6
Figure 6. Figure 6: Radar chart of ACIC performance by DGP characteristics. PEHE is min–max normalized so that higher values indicate better performance, with 1 de￾noting the best. Only the top method per class is shown. H-learner performs best across all settings. setNet, a neural networ…
Figure 7
Figure 7. Figure 7: PEHE results for three semi-synthetic scenarios. The H-learner is more robust across these settings and [PITH_FULL_IMAGE:figures/full_fig_p015_7.png]
Figure 8
Figure 8. Figure 8: Performance of the H-learner across different [PITH_FULL_IMAGE:figures/full_fig_p016_8.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MMOOC: A Comprehensive Benchmark for Out-of-Context Evaluation in Multimodal Large Language Models

    cs.CV 2026-07 conditional novelty 6.0 of 10

    MMOOC, a 41K-pair benchmark, shows current multimodal LLMs struggle to both refuse truly out-of-context questions and correctly answer questions that remain answerable despite misleading or shifted context.

Reference graph

Works this paper leans on

26 extracted references · 12 canonical work pages · cited by 1 Pith paper

  1. [1]

    Estimation and inference of heterogeneous treatment effects using random forests

    Stefan Wager and Susan Athey. Estimation and inference of heterogeneous treatment effects using random forests. Journal of the American Statistical Association, 113 0 (523): 0 1228--1242, 2018

  2. [2]

    Estimating individual treatment effect: generalization bounds and algorithms

    Uri Shalit, Fredrik D Johansson, and David Sontag. Estimating individual treatment effect: generalization bounds and algorithms. In International conference on machine learning, pages 3076--3085. PMLR, 2017

  3. [3]

    Learning representations for counterfactual inference

    Fredrik Johansson, Uri Shalit, and David Sontag. Learning representations for counterfactual inference. In International conference on machine learning, pages 3020--3029. PMLR, 2016

  4. [4]

    Towards optimal doubly robust estimation of heterogeneous causal effects

    Edward H Kennedy. Towards optimal doubly robust estimation of heterogeneous causal effects. arXiv preprint arXiv:2004.14497, 2020

  5. [5]

    o ren R K \

    S \"o ren R K \"u nzel, Jasjeet S Sekhon, Peter J Bickel, and Bin Yu. Metalearners for estimating heterogeneous treatment effects using machine learning. Proceedings of the national academy of sciences, 116 0 (10): 0 4156--4165, 2019

  6. [6]

    Bayesian inference of individualized treatment effects using multi-task gaussian processes

    Ahmed M Alaa and Mihaela Van Der Schaar. Bayesian inference of individualized treatment effects using multi-task gaussian processes. Advances in neural information processing systems, 30, 2017

  7. [7]

    Adapting neural networks for the estimation of treatment effects

    Claudia Shi, David Blei, and Victor Veitch. Adapting neural networks for the estimation of treatment effects. Advances in neural information processing systems, 32, 2019 a

  8. [8]

    On the application of probability theory to agricultural experiments

    Jerzy S Neyman. On the application of probability theory to agricultural experiments. essay on principles. section 9.(tlanslated and edited by dm dabrowska and tp speed, statistical science (1990), 5, 465-480). Annals of Agricultural Sciences, 10: 0 1--51, 1923

Show all 26 references
  1. [9]

    Estimating causal effects of treatments in randomized and nonrandomized studies

    Donald B Rubin. Estimating causal effects of treatments in randomized and nonrandomized studies. Journal of educational Psychology, 66 0 (5): 0 688, 1974

  2. [10]

    On inductive biases for heterogeneous treatment effect estimation

    Alicia Curth and Mihaela van der Schaar. On inductive biases for heterogeneous treatment effect estimation. Advances in Neural Information Processing Systems, 34: 0 15883--15894, 2021

  3. [11]

    Regularization and confounding in linear regression for treatment effect estimation

    P Richard Hahn, Carlos M Carvalho, David Puelz, and Jingyu He. Regularization and confounding in linear regression for treatment effect estimation. 2018

  4. [12]

    Bayesian regression tree models for causal inference: Regularization, confounding, and heterogeneous effects (with discussion)

    P Richard Hahn, Jared S Murray, and Carlos M Carvalho. Bayesian regression tree models for causal inference: Regularization, confounding, and heterogeneous effects (with discussion). Bayesian Analysis, 15 0 (3): 0 965--1056, 2020

  5. [13]

    Recursive partitioning for heterogeneous causal effects

    Susan Athey and Guido Imbens. Recursive partitioning for heterogeneous causal effects. Proceedings of the National Academy of Sciences, 113 0 (27): 0 7353--7360, 2016

  6. [14]

    Bayesian nonparametric modeling for causal inference

    Jennifer L Hill. Bayesian nonparametric modeling for causal inference. Journal of Computational and Graphical Statistics, 20 0 (1): 0 217--240, 2011

  7. [15]

    Nonparametric tests for treatment effect heterogeneity

    Richard K Crump, V Joseph Hotz, Guido W Imbens, and Oscar A Mitnik. Nonparametric tests for treatment effect heterogeneity. The Review of Economics and Statistics, 90 0 (3): 0 389--405, 2008

  8. [16]

    Biomarker: predictive or prognostic? Journal of clinical oncology: official journal of the American Society of Clinical Oncology, 33 0 (33): 0 3968--3971, 2015

    Karla V Ballman. Biomarker: predictive or prognostic? Journal of clinical oncology: official journal of the American Society of Clinical Oncology, 33 0 (33): 0 3968--3971, 2015

  9. [17]

    A generalization of sampling without replacement from a finite universe

    Daniel G Horvitz and Donovan J Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association, 47 0 (260): 0 663--685, 1952

  10. [18]

    Nonparametric estimation of heterogeneous treatment effects: From theory to learning algorithms

    Alicia Curth and Mihaela Van der Schaar. Nonparametric estimation of heterogeneous treatment effects: From theory to learning algorithms. In International Conference on Artificial Intelligence and Statistics, pages 1810--1818. PMLR, 2021

  11. [19]

    Comparison of meta-learners for estimating multi-valued treatment heterogeneous effects

    Naoufal Acharki, Ramiro Lugo, Antoine Bertoncello, and Josselin Garnier. Comparison of meta-learners for estimating multi-valued treatment heterogeneous effects. In International conference on machine learning, pages 91--132. PMLR, 2023

  12. [20]

    Estimating treatment effect heterogeneity in randomized program evaluation

    Kosuke Imai and Marc Ratkovic. Estimating treatment effect heterogeneity in randomized program evaluation. The Annals of Applied Statistics, pages 443--470, 2013

  13. [21]

    Blei, and Victor Veitch

    Claudia Shi, David M. Blei, and Victor Veitch. Adapting neural networks for the estimation of treatment effects, 2019 b . URL https://arxiv.org/abs/1906.02120

  14. [22]

    Robust recursive partitioning for heterogeneous treatment effects with uncertainty quantification, 2020

    Hyun-Suk Lee, Yao Zhang, William Zame, Cong Shen, Jang-Won Lee, and Mihaela van der Schaar. Robust recursive partitioning for heterogeneous treatment effects with uncertainty quantification, 2020. URL https://arxiv.org/abs/2006.07917

  15. [23]

    Npci: Non-parametrics for causal inference

    Vincent Dorie. Npci: Non-parametrics for causal inference. URL: https://github. com/vdorie/npci, 11: 0 23, 2016

  16. [24]

    Automated versus do-it-yourself methods for causal inference: Lessons learned from a data analysis competition

    Vincent Dorie, Jennifer Hill, Uri Shalit, Marc Scott, and Dan Cervone. Automated versus do-it-yourself methods for causal inference: Lessons learned from a data analysis competition. Statistical Science, 2019

  17. [25]

    Empirical analysis of model selection for heterogeneous causal effect estimation

    Divyat Mahajan, Ioannis Mitliagkas, Brady Neal, and Vasilis Syrgkanis. Empirical analysis of model selection for heterogeneous causal effect estimation. arXiv preprint arXiv:2211.01939, 2022

  18. [26]

    Validating causal inference models via influence functions

    Ahmed Alaa and Mihaela Van Der Schaar. Validating causal inference models via influence functions. In International Conference on Machine Learning, pages 191--201. PMLR, 2019

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.