Pith. sign in

REVIEW 5 minor 100 references

The Spectral Structure of Latent Treatment Effects

T0 review · 0 major / 5 minor · reviewed 2026-07-14 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Latent treatment effects under unobserved confounding are the eigenvalues of one compressed proxy operator.

desk verdict Clean spectral re-foundation of SPO: the latent effects are eigenvalues of one compressed difference operator, with full proofs and better finite-sample behavior than the scalar recursion. read the letter →

arxiv 2607.10926 v1 pith:VVXTSAWP submitted 2026-07-12 cs.LG stat.ML

Hamza Virk , Bijan Mazaheri , Yihren Wu This is my paper
classification cs.LGstat.ML
keywords heterogeneoustreatmenteffectsproximalcausalinferencelatentconfoundingobservableoperatorsspectralmethodssyntheticpotentialoutcomesmixtureof
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

When treatment effects vary across unobserved groups and only proxies are observed, earlier work recovered the mixture of those effects by building a long chain of scalar moments and extracting roots from a Hankel pencil. This paper shows that those moments are simply bilinear projections of a single, finite-dimensional operator that can be formed directly from observable second- and third-order moments. After the shared signal subspace of the proxies is extracted, the difference of the two arm-specific quotient operators is similar to the diagonal matrix of latent treatment effects; its eigenvalues are exactly those effects, and its left eigenvectors recover the feature matrix and the mixture weights. The construction works with more proxy coordinates than latent classes, replaces recursive high-order inversion by a single spectral decomposition, and comes with high-probability first-order error bounds. A sympathetic reader cares because the same causal target is recovered more stably and under weaker dimensional restrictions than the scalar recursion.

What carries the argument

The compressed difference operator ΔQ̃ = Q̃₁ − Q̃₀. After the shared row space of the stacked cross-moment matrix is extracted by truncated SVD, each arm yields a k × k quotient Q̃_t; their difference is similar to diag(τ(u)), so spectral analysis on this single matrix recovers the entire mixture of treatment effects.

What would settle it

Generate synthetic data from the exact proxy mixture model with known distinct π values, run the compressed spectral estimator, and check whether the recovered eigenvalues match the planted effects to within the predicted n^{-1/2} rate; systematic failure under full rank and positivity would refute the claim.

Watch

Extended reading notes

Core claim

Under the same population factorizations used by Synthetic Potential Outcomes, there exists an exact compressed observable operator: after projection onto the shared k-dimensional proxy signal subspace, the difference of the two treatment-arm quotient operators is similar to the diagonal of latent treatment effects. Its eigenvalues are precisely the latent effects; its lifted left eigenvectors, after anchor normalization, recover the target-proxy feature matrix and thence the latent mixture proportions. Every scalar SPO moment is a bilinear functional of a power of this operator.

Load-bearing premise

The unobserved confounder must be a finite discrete set of known size in which every class appears under both treatments and the class-specific treatment effects are all different from one another.

Editorial extensions

If this is right

  • Overcomplete proxy systems (more coordinates than latent classes) can be used directly without forced square truncation.
  • High-order scalar inversion and Hankel root-finding are replaced by a single finite-dimensional eigendecomposition.
  • First-order high-probability bounds become available simultaneously for the effects, the feature rows, and the simplex-projected mixture weights.
  • Latent causal homogeneity is equivalent to the compressed difference operator being a scalar matrix, giving an exact operator test for effect constancy.
  • The same operator generates the entire synthetic-moment hierarchy, so every polynomial functional of the treatment-effect law is recovered from one object.

Reading between the lines

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

  • The same subspace-compression idea may extend to continuous latent confounders via compact integral operators or RKHS analogues, as the discussion already hints.
  • Because the operator is environment-invariant when the potential-outcome diagonals are shared, multi-environment data could be pooled for a single spectral estimate without re-deriving moments.
  • The complex-bifurcation diagnostic already present in the paper could serve as a practical rank-selection or model-check statistic: large imaginary parts flag that the sample is outside the separated-eigenvalue regime.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 5 minor

Summary. The paper studies identification of a mixture of treatment effects (MTE) under a discrete latent confounder with proxy variables. Under the same conditional-independence and full-rank factorization assumptions used by Mazaheri et al. (2025) for Synthetic Potential Outcomes, it constructs ambient and compressed quotient operators from observable second- and third-order moment matrices. After projection onto the shared k-dimensional proxy signal subspace, the difference of the two arm-specific compressed operators is similar to the diagonal of latent treatment effects; its eigenvalues are exactly the latent effects, and its lifted left eigenvectors (after anchor normalization by X1=1) recover the target-proxy feature matrix B and the mixture weights p. The scalar SPO moment sequence is recovered as bilinear functionals of powers of this operator. The construction accepts overcomplete proxies, and the paper supplies geometric rank/positivity characterizations, high-probability n^{-1/2} perturbation bounds for eigenvalues, lifted rows, and simplex-projected weights, and synthetic experiments showing improved stability relative to the recursive scalar baseline.

Significance. If the results hold, the paper supplies a clean operator-theoretic foundation for latent MTE identification in the discrete-proxy setting. The central similarity (Theorem 5.2) is an exact algebraic consequence of the stated factorizations and shared-subspace compression; the operator-moment equivalence (Theorem 5.4) unifies the prior recursive construction; and the finite-sample bounds (Theorems 7.1–7.2) are first-order and use standard matrix-perturbation tools. The ability to handle overcomplete proxies without square inversion, together with the geometric diagnostics for rank and positivity, is a genuine practical and conceptual advance over the scalar Hankel-pencil route. Strengths include fully written appendix proofs, an explicit algorithm, and synthetic experiments that match the predicted rate and demonstrate clear gains over the baseline.

minor comments (5)
  1. The complex-bifurcation diagnostic (Remark 3) is useful but could be stated more operationally: e.g., a concrete threshold on the imaginary part relative to the estimated eigengap, or a short note on how often residual imaginary parts appear in the reported experiments.
  2. Figure 4 and Table 1 report median absolute eigenvalue error; adding interquartile ranges or a brief note on trial-to-trial variability would make the stability claim easier to assess at a glance.
  3. Assumption 3 (spectral separation) is used for simple-eigenvalue pairing and eigenvector recovery; a short remark on the multiple-eigenvalue case (already alluded to in Remark 1 for zero effects) would clarify what is still identified when some τ(u) coincide.
  4. Notation for the compressed operators (˜Qt vs. Δ˜Q) is consistent but dense; a one-line glossary or a small table of the main population objects would help readers navigating Sections 5–7.
  5. The related-work discussion of spectral OOMs and tensor methods is appropriate; a sentence distinguishing the present asymmetric causal quotient from simultaneous diagonalization of symmetric tensors would further locate the contribution.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: spectral identification is an algebraic consequence of stated proxy factorizations, not a fit or self-citation loop.

full rationale

The paper’s load-bearing chain is: Assumption 1 (proxy conditional independencies) plus law of total expectation yield the factorizations M_ZX|t = A_t D_U|t B^T and M_ZXY|t = A_t D_U|t D_Y|t B^T; full column rank (Assumption 2) and positivity give ambient quotients Q_t = (B^T)^† D_Y|t B^T (Theorem 5.1); shared row-space compression then produces ˜Q_t = R^{-1} D_Y|t R and Δ˜Q = R^{-1} D_τ R (Theorem 5.2), so eigenvalues are exactly the latent effects and left eigenvectors recover B after the X_1=1 anchor (Proposition 5.3). Every step is proved from these hypotheses via pseudo-inverse identities and subspace geometry (Appendix B, Lemmas B.1–B.2); no parameter is fitted to force the spectrum to match a target, and the operator-moment equivalence (Theorem 5.4) shows prior SPO scalar moments are bilinear functionals of powers of the same operator rather than an independent premise. Citation of Mazaheri–Squires–Uhler ’25 is historical/comparative (same author set) and is not used as a uniqueness theorem that forbids alternatives or that supplies the similarity identity. Finite-sample bounds are standard perturbation consequences of the population operator, not circular predictions. The derivation is therefore self-contained against its stated assumptions; score 0.

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

Identification rests on standard causal proxy independencies, a finite discrete latent class model of known size k, full-column-rank proxy feature matrices, strict positivity, and spectral separation of the treatment effects. No free parameters are fitted to force the spectral claim; k may be chosen by a separate rank procedure but is treated as known for the main theorems. The compressed operator itself is a derived object, not an invented physical entity.

free parameters (1)
  • latent dimension k
    Treated as known for population identification and finite-sample bounds; when unknown it is selected by a separate rank procedure on the stacked moment matrix whose error is not absorbed into the main rates.
assumptions (4)
  • domain assumption Proxy conditional independencies Z ⊥ (X,Y)|(T,U) and X ⊥ (Y,T)|U together with latent ignorability Y(t) ⊥ T|U (Assumption 1)
    These are the standard proximal-causal factorization assumptions that produce the low-rank moment factorizations M_ZX|t = A_t D_U|t B^T and M_ZXY|t = A_t D_U|t D_Y|t B^T.
  • domain assumption Proxy richness: A_0, A_1, B have full column rank k and d_x, d_z ≥ k (Assumption 2)
    Guarantees that the stacked moment matrix has exact rank k and that the compressed operators are well-defined and similar to the latent diagonals.
  • domain assumption Strict latent positivity: P(T=t|U=u)>0 for all u,t, and spectral separation of the τ(u) (Assumption 3 and positivity hypotheses)
    Positivity equates the treated and control row spaces with the row space of B; separation makes eigenvalues simple so left eigenvectors recover rows of R up to scale.
  • standard math Bounded almost-sure norms of the moment matrices and positive treatment probability π (Assumption 4)
    Standard concentration hypotheses that convert matrix Bernstein and Wedin bounds into the stated n^{-1/2} rates.
invented entities (1)
  • compressed difference operator ΔQ̃ independent evidence
    purpose: Finite-dimensional observable operator whose spectrum equals the latent treatment effects and whose powers generate all SPO moments
    Constructed directly from observable second- and third-order moments after SVD projection; not a new physical object but the central algebraic device of the paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Spectral Structure of Latent Treatment Effects." pith.science (2026). https://pith.science/paper/VVXTSAWP

@misc{pith2026260710926,
  author       = {Pith},
  title        = {Pith review of: The Spectral Structure of Latent Treatment Effects},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VVXTSAWP}},
  note         = {Machine review of arXiv:2607.10926}
}
read the original abstract

Identifying heterogeneous treatment effects under unobserved confounding is central in observational causal inference. In proxy models with a discrete latent confounder, prior Synthetic Potential Outcomes (SPO) [Mazaheri-Squires-Uhler '25] recover the mixture of treatment effects through recursively constructed scalar moments. We show that this sequence is one projection of a more fundamental object. Under the same population factorization assumptions, there is an exact compressed observable operator: after projecting onto the shared proxy signal subspace, the difference of two treatment-arm quotient operators is similar to the diagonal matrix of latent treatment effects. Its eigenvalues are the latent effects; its lifted left eigenvectors, after anchor normalization, recover the target-proxy feature matrix and then the latent mixture proportions. Every scalar SPO moment is a bilinear functional of a power of this operator. The resulting estimator handles overcomplete proxy systems, replaces high-order scalar inversion with finite-dimensional spectral analysis, and admits high-probability first-order perturbation bounds for treatment effects, feature rows, and simplex-projected mixture weights.

Figures

Figures reproduced from arXiv: 2607.10926 by the authors.

Figure 1
Figure 1. Causal triptych for the latent proxy mixture model. (a) depicts the proxy causal structure: [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Distributional view of latent treatment effects. (a) The observed arm-specific outcome [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Visual representation of the proxy matrix factorization [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: Left: Median absolute eigenvalue error of the compressed spectral estimator across latent dimensions k ∈ {2, . . . , 6} and sample sizes N ∈ {103 , . . . , 2.5×104}. Center: Corresponding errors for the base SPO moment-chain baseline. Errors are larger and less stable,…
Figure 5
Figure 5. Figure 5: Naive ATE estimates across 300 trials for the three-class mixture with true effects [PITH_FULL_IMAGE:figures/full_fig_p017_5.png]
Figure 6
Figure 6. Figure 6: Base SPO eigenvalue estimates across 300 trials. Although the scalar moment construction [PITH_FULL_IMAGE:figures/full_fig_p018_6.png]
Figure 7
Figure 7. Figure 7: Compressed spectral estimator eigenvalue estimates across 300 trials. The empirical [PITH_FULL_IMAGE:figures/full_fig_p018_7.png]
Figure 8
Figure 8. Figure 8: Row-space compression underlying Lemma B.2. Left: The rows of M lie in the signal subspace R(M⊤) = R(Vk), so projecting onto Vk preserves the population row space. Right: Compression is exact because M = MVkV⊤ k ; equivalently, M and MVk have the same nonzero singular …
Figure 9
Figure 9. Figure 9: Counterfactual pairing through the common similarity basis. [PITH_FULL_IMAGE:figures/full_fig_p037_9.png]
Figure 10
Figure 10. Figure 10: Three-way heatmap comparison on the (k, N) grid of Section 8.1, with all panels on a shared logarithmic color scale. Left: Spectral SPO. Center: base SPO truncated to the first k proxy coordinates. Right: base SPO applied to the full d = k + 3 moment matrices without …
Figure 11
Figure 11. Figure 11: Convergence at k = 3 and dz = dx = k + 3. The spectral estimator follows the predicted O(n −1/2 ) rate; base SPO truncated to the first k coordinates is noisy and roughly flat at much higher error; base SPO without truncation is higher still and non-monotone. 4 3 2 1 …
Figure 12
Figure 12. Figure 12: Base SPO without truncation, eigenvalue estimates across 300 trials with [PITH_FULL_IMAGE:figures/full_fig_p050_12.png]
Figure 13
Figure 13. Figure 13: Base SPO eigenvalue estimates across 300 trials. [PITH_FULL_IMAGE:figures/full_fig_p051_13.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

100 extracted references · 3 canonical work pages

  1. [1]

    IEEE Transactions on Electronic Computers , number=

    A theory of adaptive pattern classifiers , author=. IEEE Transactions on Electronic Computers , number=. 1967 , publisher=

    1967

  2. [2]

    2026 , eprint=

    Comparing Two Proxy Methods for Causal Identification , author=. 2026 , eprint=

    2026

  3. [3]

    2025 , eprint=

    Spectral Representation for Causal Estimation with Hidden Confounders , author=. 2025 , eprint=

    2025

  4. [4]

    Biometrika , volume =

    Identifying Causal Effects with Proxy Variables of an Unmeasured Confounder , author =. Biometrika , volume =. 2018 , publisher =

    2018

  5. [5]

    BMC Medical Research Methodology , volume =

    Evaluating Sensitivity to Classification Uncertainty in Latent Subgroup Effect Analyses , author =. BMC Medical Research Methodology , volume =. 2022 , publisher =

    2022

  6. [6]

    2026 , eprint =

    Estimating Aleatoric Uncertainty in the Causal Treatment Effect , author =. 2026 , eprint =. doi:10.48550/arXiv.2602.08461 , url =

    work page doi:10.48550/arxiv.2602.08461 2026

  7. [7]

    2023 , eprint =

    Causal Discovery under Latent Class Confounding , author =. 2023 , eprint =. doi:10.48550/arXiv.2311.07454 , url =

    arXiv doi:10.48550/arxiv.2311.07454 2023

  8. [8]

    Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , series =

    Density Ratio-based Proxy Causal Learning Without Density Ratios , author =. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , series =. 2025 , publisher =

    2025

Show all 100 references
  1. [9]

    Journal of Educational and Behavioral Statistics , volume =

    Estimating Heterogeneous Treatment Effects Within Latent Class Multilevel Models: A Bayesian Approach , author =. Journal of Educational and Behavioral Statistics , volume =. 2023 , publisher =. doi:10.3102/10769986221115446 , url =

    2023 doi

  2. [10]

    Current Epidemiology Reports , volume =

    A Selective Review of Negative Control Methods in Epidemiology , author =. Current Epidemiology Reports , volume =. 2020 , publisher =

    2020

  3. [11]

    Journal of the American Statistical Association , volume =

    Kendrick Qijun Li, Xu Shi, Wang Miao and Eric Tchetgen Tchetgen , title =. Journal of the American Statistical Association , volume =. 2024 , publisher =. doi:10.1080/01621459.2023.2220935 , URL =

    2024 doi

  4. [12]

    The Annals of Statistics , volume =

    Identifiability of Parameters in Latent Structure Models with Many Observed Variables , author =. The Annals of Statistics , volume =. 2009 , publisher =

    2009

  5. [13]

    Journal of the Royal Statistical Society: Series B (Methodological) , volume=

    The interpretation of interaction in contingency tables , author=. Journal of the Royal Statistical Society: Series B (Methodological) , volume=. 1951 , publisher=

    1951

  6. [14]

    Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages =

    Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications , author =. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages =. 2019 , publisher =

    2019

  7. [15]

    SIAM Journal on Computing , volume=

    Learning mixtures of product distributions over discrete domains , author=. SIAM Journal on Computing , volume=. 2008 , publisher=

    2008

  8. [16]

    FEBS letters , volume=

    Chromatin accessibility and guide sequence secondary structure affect CRISPR-Cas9 gene editing efficiency , author=. FEBS letters , volume=. 2017 , publisher=

    2017

  9. [17]

    Journal of Machine Learning Research , volume =

    Tensor Decompositions for Learning Latent Variable Models , author =. Journal of Machine Learning Research , volume =. 2014 , url =

    2014

  10. [18]

    Proceedings of the national academy of sciences , volume=

    Metalearners for estimating heterogeneous treatment effects using machine learning , author=. Proceedings of the national academy of sciences , volume=. 2019 , publisher=

    2019

  11. [19]

    Journal of the American Statistical Association , volume =

    Estimation and Inference of Heterogeneous Treatment Effects Using Random Forests , author =. Journal of the American Statistical Association , volume =. 2018 , publisher =

    2018

  12. [20]

    Advances in Multilevel Modeling for Educational Research: Addressing Practical Issues Found in Real-World Applications , pages =

    Mixture Modeling Methods for Causal Inference with Multilevel Data , author =. Advances in Multilevel Modeling for Educational Research: Addressing Practical Issues Found in Real-World Applications , pages =. 2015 , publisher =

    2015

  13. [21]

    Quantitative Psychology Research: The 79th Annual Meeting of the Psychometric Society, Madison, Wisconsin, 2014 , pages=

    Multilevel propensity score methods for estimating causal effects: A latent class modeling strategy , author=. Quantitative Psychology Research: The 79th Annual Meeting of the Psychometric Society, Madison, Wisconsin, 2014 , pages=. 2015 , organization=

    2014

  14. [22]

    Journal of Educational and Behavioral Statistics , volume=

    Hybridizing machine learning methods and finite mixture models for estimating heterogeneous treatment effects in latent classes , author=. Journal of Educational and Behavioral Statistics , volume=. 2021 , publisher=

    2021

  15. [23]

    Probabilistic and Causal Inference: The Works of Judea Pearl , pages =

    Detecting Latent Heterogeneity , author =. Probabilistic and Causal Inference: The Works of Judea Pearl , pages =. 2022 , publisher =

    2022

  16. [24]

    Biometrika , volume =

    Quasi-Oracle Estimation of Heterogeneous Treatment Effects , author =. Biometrika , volume =. 2021 , publisher =. doi:10.1093/biomet/asaa076 , url =

    2021 doi

  17. [25]

    2015 , publisher=

    Causal inference in statistics, social, and biomedical sciences , author=. 2015 , publisher=

    2015

  18. [26]

    Foundations and Trends

    An introduction to matrix concentration inequalities , author=. Foundations and Trends. 2015 , publisher=

    2015

  19. [27]

    Journal of the American Statistical Association , volume =

    The Blessings of Multiple Causes , author =. Journal of the American Statistical Association , volume =. 2019 , publisher =

    2019

  20. [28]

    Journal of the American Statistical Association , volume =

    Comment on ``Blessings of Multiple Causes'' , author =. Journal of the American Statistical Association , volume =. 2019 , publisher =

    2019

  21. [29]

    IEEE Transactions on Information Theory , volume=

    Hadamard extensions and the identification of mixtures of product distributions , author=. IEEE Transactions on Information Theory , volume=. 2022 , publisher=

    2022

  22. [30]

    Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=

    Learning mixtures of gaussians in high dimensions , author=. Proceedings of the forty-seventh annual ACM symposium on Theory of computing , pages=

  23. [31]

    Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=

    Learning mixtures of spherical gaussians: moment methods and spectral decompositions , author=. Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=

  24. [32]

    Proceedings of Thirty Seventh Conference on Learning Theory , pages =

    Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity , author =. Proceedings of Thirty Seventh Conference on Learning Theory , pages =. 2024 , volume =

    2024

  25. [33]

    Proceedings of the 5th Conference on Innovations in Theoretical Computer Science , pages =

    Learning Mixtures of Arbitrary Distributions over Large Discrete Domains , author =. Proceedings of the 5th Conference on Innovations in Theoretical Computer Science , pages =. 2014 , publisher =

    2014

  26. [34]

    2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=

    Settling the polynomial learnability of mixtures of gaussians , author=. 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=. 2010 , organization=

    2010

  27. [35]

    arXiv preprint arXiv:2001.06555 , year =

    Counterexamples to ``The Blessings of Multiple Causes'' by Wang and Blei , author =. arXiv preprint arXiv:2001.06555 , year =

    2001 arXiv

  28. [36]

    Science , volume=

    Protein structure relationships revealed by mutational analysis , author=. Science , volume=. 1964 , publisher=

    1964

  29. [37]

    2009 , publisher=

    Probabilistic graphical models: principles and techniques , author=. 2009 , publisher=

    2009

  30. [38]

    1996 , publisher=

    Graphical models , author=. 1996 , publisher=

    1996

  31. [39]

    IEEE Transactions on Acoustics, Speech, and Signal Processing , volume=

    Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise , author=. IEEE Transactions on Acoustics, Speech, and Signal Processing , volume=. 1990 , publisher=

    1990

  32. [40]

    Research in Computational Molecular Biology: 23rd Annual International Conference, RECOMB 2019, Washington, DC, USA, May 5-8, 2019, Proceedings 23 , pages=

    How many subpopulations is too many? Exponential lower bounds for inferring population histories , author=. Research in Computational Molecular Biology: 23rd Annual International Conference, RECOMB 2019, Washington, DC, USA, May 5-8, 2019, Proceedings 23 , pages=. 2019 , organization=

    2019

  33. [41]

    Proceedings of the 38th International Conference on Machine Learning , pages =

    MSA Transformer , author =. Proceedings of the 38th International Conference on Machine Learning , pages =. 2021 , editor =

    2021

  34. [42]

    2013 , publisher=

    Matrix computations , author=. 2013 , publisher=

    2013

  35. [43]

    Biometrika , volume=

    The central role of the propensity score in observational studies for causal effects , author=. Biometrika , volume=. 1983 , publisher=

    1983

  36. [44]

    Journal Polytechnique ou Bulletin du Travail fait a l'Ecole Centrale des Travaux Publics , year=

    Essai experimental et analytique: sur les lois de la dilatabilite des fluides elastique et sur celles de la force expansive de la vapeur de l'eau et de la vapeur de l'alkool, a differentes temperatures , author=. Journal Polytechnique ou Bulletin du Travail fait a l'Ecole Cent...

  37. [45]

    arXiv preprint arXiv:2212.11279 , year=

    Annotated History of Modern AI and Deep Learning , author=. arXiv preprint arXiv:2212.11279 , year=

  38. [46]

    Nature , volume=

    A global reference for human genetic variation , author=. Nature , volume=. 2015 , publisher=

    2015

  39. [47]

    Contemporary Oncology/Wsp

    Review The Cancer Genome Atlas (TCGA): an immeasurable source of knowledge , author=. Contemporary Oncology/Wsp. 2015 , publisher=

    2015

  40. [48]

    bioRxiv , pages =

    Short Tandem Repeats Information in TCGA is Statistically Biased by Amplification , author =. bioRxiv , pages =. 2019 , publisher =

    2019

  41. [49]

    Plos one , volume=

    Glioblastoma signature in the DNA of blood-derived cells , author=. Plos one , volume=. 2021 , publisher=

    2021

  42. [50]

    2017 , publisher=

    Elements of causal inference: foundations and learning algorithms , author=. 2017 , publisher=

    2017

  43. [51]

    2009 , publisher=

    Causality , author=. 2009 , publisher=

    2009

  44. [52]

    The scientific world journal , volume=

    A review of data fusion techniques , author=. The scientific world journal , volume=. 2013 , publisher=

    2013

  45. [53]

    Proceedings of the National Academy of Sciences , volume=

    Causal inference and the data-fusion problem , author=. Proceedings of the National Academy of Sciences , volume=. 2016 , publisher=

    2016

  46. [54]

    2023 , eprint=

    Causal Information Splitting: Engineering Proxy Features for Robustness to Distribution Shifts , author=. 2023 , eprint=

    2023

  47. [55]

    Proceedings of Thirty Fourth Conference on Learning Theory , pages =

    Source Identification for Mixtures of Product Distributions , author =. Proceedings of Thirty Fourth Conference on Learning Theory , pages =. 2021 , volume =

    2021

  48. [56]

    Proceedings of the Second Conference on Causal Learning and Reasoning , pages =

    Causal Inference Despite Limited Global Confounding via Mixture Models , author =. Proceedings of the Second Conference on Causal Learning and Reasoning , pages =. 2023 , volume =

    2023

  49. [57]

    Mathematical Social Sciences , volume=

    Induced binary probabilities and the linear ordering polytope: A status report , author=. Mathematical Social Sciences , volume=. 1992 , publisher=

    1992

  50. [58]

    The American Mathematical Monthly , volume=

    The paradox of nontransitive dice , author=. The American Mathematical Monthly , volume=. 1994 , publisher=

    1994

  51. [59]

    arXiv preprint arXiv:2007.08101 , year=

    The sparse Hausdorff moment problem, with application to topic models , author=. arXiv preprint arXiv:2007.08101 , year=

    2007 arXiv

  52. [60]

    arXiv preprint arXiv:2107.07054 , year=

    Expert Graphs: Synthesizing New Expertise via Collaboration , author=. arXiv preprint arXiv:2107.07054 , year=

    arXiv

  53. [61]

    Combining Binary Classifiers Leads to Nontransitive Paradoxes , author=

  54. [62]

    arXiv preprint arXiv:2006.07691 , year=

    Synthetic interventions , author=. arXiv preprint arXiv:2006.07691 , year=

    2006 arXiv

  55. [63]

    Proceedings of the First Conference on Causal Learning and Reasoning , pages =

    Causal Imputation via Synthetic Interventions , author =. Proceedings of the First Conference on Causal Learning and Reasoning , pages =. 2022 , volume =

    2022

  56. [64]

    Proceedings of Thirty Sixth Conference on Learning Theory , pages =

    Causal Matrix Completion , author =. Proceedings of Thirty Sixth Conference on Learning Theory , pages =. 2023 , volume =

    2023

  57. [65]

    Journal of the American statistical Association , volume=

    Synthetic control methods for comparative case studies: Estimating the effect of California’s tobacco control program , author=. Journal of the American statistical Association , volume=. 2010 , publisher=

    2010

  58. [66]

    Journal of Economic Literature , year =

    Abadie, Alberto , title =. Journal of Economic Literature , year =

  59. [67]

    Epidemiology , volume=

    Negative controls: a tool for detecting confounding and bias in observational studies , author=. Epidemiology , volume=. 2010 , publisher=

    2010

  60. [68]

    Statistical Theory and Related Fields , volume =

    A Confounding Bridge Approach for Double Negative Control Inference on Causal Effects , author =. Statistical Theory and Related Fields , volume =. 2024 , publisher =

    2024

  61. [69]

    arXiv preprint arXiv:2009.10982 , year =

    An Introduction to Proximal Causal Learning , author =. arXiv preprint arXiv:2009.10982 , year =. doi:10.48550/arXiv.2009.10982 , url =

    2009 doi arXiv

  62. [70]

    Proceedings of the 38th International Conference on Machine Learning , pages =

    Proximal Causal Learning with Kernels: Two-Stage Estimation and Moment Restriction , author =. Proceedings of the 38th International Conference on Machine Learning , pages =. 2021 , volume =

    2021

  63. [71]

    Advances in Neural Information Processing Systems , volume =

    Kernel Instrumental Variable Regression , author =. Advances in Neural Information Processing Systems , volume =. 2019 , url =

    2019

  64. [72]

    Political Analysis , volume=

    Estimation of heterogeneous treatment effects from randomized experiments, with application to the optimal planning of the get-out-the-vote campaign , author=. Political Analysis , volume=. 2011 , publisher=

    2011

  65. [73]

    Observational Studies , volume =

    CausalToolbox---Estimator Stability for Heterogeneous Treatment Effects , author =. Observational Studies , volume =. 2019 , publisher =

    2019

  66. [74]

    Statistics in Medicine , volume =

    Comparing Methods for Estimation of Heterogeneous Treatment Effects Using Observational Data from Health Care Databases , author =. Statistics in Medicine , volume =. 2018 , publisher =

    2018

  67. [75]

    Sociological Methodology , volume =

    Estimating Heterogeneous Treatment Effects with Observational Data , author =. Sociological Methodology , volume =. 2012 , publisher =

    2012

  68. [76]

    Statistics in medicine , volume=

    Estimating heterogeneous treatment effects for latent subgroups in observational studies , author=. Statistics in medicine , volume=. 2019 , publisher=

    2019

  69. [77]

    Bayesian Analysis , year =

    Shahn, Zach and Madigan, David , title =. Bayesian Analysis , year =. doi:10.1214/16-BA1022 , url =

    doi

  70. [78]

    Prevention Science , volume=

    For whom does it work? Subgroup differences in the effects of a school-based universal prevention program , author=. Prevention Science , volume=. 2013 , publisher=

    2013

  71. [79]

    BMC medical research methodology , volume=

    From concepts, theory, and evidence of heterogeneity of treatment effects to methodological approaches: a primer , author=. BMC medical research methodology , volume=. 2012 , publisher=

    2012

  72. [80]

    Journal of Machine Learning Research , year =

    Jean Kossaifi and Yannis Panagakis and Anima Anandkumar and Maja Pantic , title =. Journal of Machine Learning Research , year =

  73. [81]

    Linear algebra and its applications , volume=

    Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , author=. Linear algebra and its applications , volume=. 1977 , publisher=

    1977

  74. [82]

    Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =

    Synthetic Potential Outcomes and Causal Mixture Identifiability , author =. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =. 2025 , volume =

    2025

  75. [83]

    1855 , url =

    Snow, John , title =. 1855 , url =

  76. [84]

    Philosophical Transactions of the Royal Society of London, Series A , volume =

    Pearson, Karl , title =. Philosophical Transactions of the Royal Society of London, Series A , volume =

  77. [85]

    Statistical Science , volume =

    Spława-Neyman, Jerzy , title =. Statistical Science , volume =. 1990 , doi =

    1990

  78. [86]

    , title =

    Rubin, Donald B. , title =. Journal of Educational Psychology , volume =

  79. [87]

    Econometrica , volume =

    Haavelmo, Trygve , title =. Econometrica , volume =. 1944 , note =

    1944

  80. [88]

    Mathematical Proceedings of the Cambridge Philosophical Society , volume =

    A Generalized Inverse for Matrices , author =. Mathematical Proceedings of the Cambridge Philosophical Society , volume =. 1955 , publisher =. doi:10.1017/S0305004100030401 , url =

    1955 doi

  81. [89]

    2003 , doi =

    Generalized Inverses: Theory and Applications , author =. 2003 , doi =

    2003

  82. [90]

    2012 , isbn =

    Matrix Analysis , author =. 2012 , isbn =. doi:10.1017/CBO9781139020411 , url =

    2012 doi

  83. [91]

    BIT Numerical Mathematics , volume =

    Perturbation Bounds in Connection with Singular Value Decomposition , author =. BIT Numerical Mathematics , volume =. 1972 , doi =

    1972

  84. [92]

    Foundations of Computational Mathematics , volume =

    User-Friendly Tail Bounds for Sums of Random Matrices , author =. Foundations of Computational Mathematics , volume =. 2012 , doi =

    2012

  85. [93]

    Numerische Mathematik , volume =

    Norms and Exclusion Theorems , author =. Numerische Mathematik , volume =. 1960 , doi =

    1960

  86. [94]

    1995 , note =

    Perturbation Theory for Linear Operators , author =. 1995 , note =. doi:10.1007/978-3-642-66282-9 , url =

    1995 doi

  87. [95]

    1990 , isbn =

    Matrix Perturbation Theory , author =. 1990 , isbn =

    1990

  88. [96]

    III , author =

    The Rotation of Eigenvectors by a Perturbation. III , author =. SIAM Journal on Numerical Analysis , volume =. 1970 , doi =

    1970

  89. [97]

    Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =

    Spectral Representation for Causal Estimation with Hidden Confounders , author =. Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =. 2025 , volume =

    2025

  90. [98]

    Biometrika , volume =

    Measurement Bias and Effect Restoration in Causal Inference , author =. Biometrika , volume =. 2014 , doi =

    2014

  91. [99]

    Econometrica , volume =

    Nonparametric Instrumental Regression , author =. Econometrica , volume =. 2011 , doi =

    2011

  92. [100]

    Neural Computation , volume =

    Observable Operator Models for Discrete Stochastic Time Series , author =. Neural Computation , volume =. 2000 , doi =

    2000

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.