3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in counterfactual-inference-5
No benchmarks available.
Use these libraries to find counterfactual-inference-5 models and implementations
No subtasks available.
A unified algorithm is introduced to efficiently learn a broad spectrum of Kalman filters and investigates the efficacy of temporal generative models for counterfactual inference, and introduces the "Healing MNIST" dataset where long-term structure, noise and actions are applied to sequences of digits.
The experimental results indicate that the proposed framework can successfully train deep SCMs that are capable of all three levels of Pearl's ladder of causation: association, intervention, and counterfactuals, giving rise to a powerful new approach for answering causal questions in imaging applications and beyond.
This paper proposes theoretical guarantees for a representation balancing framework applied to counterfactual inference in a survival setting using a neural network capable of predicting the factual andcounterfactual survival functions (and then the CATE), in the presence of censorship, at the individual level.
A new algorithmic framework for counterfactual inference is proposed which brings together ideas from domain adaptation and representation learning and significantly outperforms the previous state-of-the-art approaches.
Perfect Match is presented, 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.
This paper proposes a method for estimating consumer preferences among discrete choices, where the consumer chooses at most one product in a category, but selects from multiple categories in parallel, and shows that the model improves over traditional modeling approaches that consider each category in isolation.
By considering the structure of the counterfactual query, one can significantly optimise the inference process, and MultiVerse, a probabilistic programming prototype engine for approximate causal reasoning, is introduced.
Adding a benchmark result helps the community track progress.