no code implementations • 22 Feb 2024 • Alvaro Ribot, Chandler Squires, Caroline Uhler
We study the index-only setting, where the actions and contexts are categorical variables with a finite number of possible values.
1 code implementation • NeurIPS 2023 • JiaQi Zhang, Chandler Squires, Kristjan Greenewald, Akash Srivastava, Karthikeyan Shanmugam, Caroline Uhler
Causal disentanglement aims to uncover a representation of data using latent variables that are interrelated through a causal model.
1 code implementation • 29 Nov 2022 • Chandler Squires, Anna Seigal, Salil Bhate, Caroline Uhler
A representation is identifiable if both the latent model and the transformation from latent to observed variables are unique.
1 code implementation • 10 Sep 2022 • JiaQi Zhang, Louis Cammarata, Chandler Squires, Themistoklis P. Sapsis, Caroline Uhler
Here, we develop a causal active learning strategy to identify interventions that are optimal, as measured by the discrepancy between the post-interventional mean of the distribution and a desired target mean.
no code implementations • 2 Jun 2022 • Chandler Squires, Caroline Uhler
In this review, we discuss approaches for learning causal structure from data, also called causal discovery.
1 code implementation • NeurIPS 2021 • JiaQi Zhang, Chandler Squires, Caroline Uhler
In particular, we show that our strategies may require exponentially fewer interventions than the previously considered approaches, which optimize for structure learning in the underlying causal graph.
1 code implementation • NeurIPS 2020 • Chandler Squires, Sara Magliacane, Kristjan Greenewald, Dmitriy Katz, Murat Kocaoglu, Karthikeyan Shanmugam
Most existing works focus on \textit{worst-case} or \textit{average-case} lower bounds for the number of interventions required to orient a DAG.
no code implementations • 6 Nov 2020 • Chandler Squires, Joshua Amaniampong, Caroline Uhler
We compare our method with $w = 1$ to algorithms for finding sparse elimination orderings of undirected graphs, and show that taking advantage of DAG-specific problem structure leads to a significant improvement in the discovered permutation.
4 code implementations • 1 Nov 2020 • Chandler Squires, Sara Magliacane, Kristjan Greenewald, Dmitriy Katz, Murat Kocaoglu, Karthikeyan Shanmugam
Most existing works focus on worst-case or average-case lower bounds for the number of interventions required to orient a DAG.
no code implementations • 20 Oct 2019 • Daniel Irving Bernstein, Basil Saeed, Chandler Squires, Caroline Uhler
We consider the task of learning a causal graph in the presence of latent confounders given i. i. d.~samples from the model.
no code implementations • 5 Mar 2019 • Dmitriy Katz, Karthikeyan Shanmugam, Chandler Squires, Caroline Uhler
For constant density, we show that the expected $\log$ observational MEC size asymptotically (in the number of vertices) approaches a constant.
3 code implementations • 27 Feb 2019 • Raj Agrawal, Chandler Squires, Karren Yang, Karthik Shanmugam, Caroline Uhler
Determining the causal structure of a set of variables is critical for both scientific inquiry and decision-making.
Methodology
1 code implementation • NeurIPS 2018 • Yuhao Wang, Chandler Squires, Anastasiya Belyaeva, Caroline Uhler
We consider the problem of estimating the differences between two causal directed acyclic graph (DAG) models given i. i. d.~samples from each model.
Methodology