REVIEW 4 cited by
Perfect Match: A Simple Method for Learning Representations For Counterfactual Inference With Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Learning representations for counterfactual inference from observational data is of high practical relevance for many domains, such as healthcare, public policy and economics. Counterfactual inference enables one to answer "What if...?" questions, such as "What would be the outcome if we gave this patient treatment $t_1$?". However, current methods for training neural networks for counterfactual inference on observational data are either overly complex, limited to settings with only two available treatments, or both. Here, we present Perfect Match (PM), a method for training neural networks for counterfactual inference that is easy to implement, compatible with any architecture, does not add computational complexity or hyperparameters, and extends to any number of treatments. PM is based on the idea of augmenting samples within a minibatch with their propensity-matched nearest neighbours. Our experiments demonstrate that PM outperforms a number of more complex state-of-the-art methods in inferring counterfactual outcomes across several benchmarks, particularly in settings with many treatments.
Forward citations
Cited by 4 Pith papers
-
Do Fair Models Reason Fairly? Counterfactual Explanation Consistency for Procedural Fairness in Credit Decisions
Outcome-fair credit models often exhibit hidden procedural bias through inconsistent reasoning across groups, which the CEC framework mitigates by enforcing consistent feature attributions via counterfactuals.
-
CanniUplift: A Holistic Framework for Mitigating Seller and Incentive Cannibalization in E-commerce Uplift Modeling
CanniUplift mitigates cross-seller substitution and non-redemption noise in e-commerce uplift modeling via a global GMV alignment loss and a redemption-based outcome decomposition, improving platform-wide incremental GMV.
-
Leveraging a Simulator for Learning Causal Representations from Post-Treatment Covariates for CATE
SimPONet jointly trains on real observational data and simulator counterfactuals to estimate CATE from post-treatment covariates, guided by a new generalization bound.
-
Orthogonal Representation Learning for Estimating Causal Quantities
Introduces OR-learners that can strictly improve estimation error of standard Neyman-orthogonal learners under the low-dimensional manifold hypothesis, while showing that balancing constraints require additional induc...
Discussion (0). Continue with ORCID to comment.