no code implementations • 12 Feb 2024 • Felix Leopoldo Rios, Alex Markham, Liam Solus
Scalable learning is achieved through a combination of an order-based Markov chain Monte-Carlo search and a novel, context-specific sparsity assumption that is analogous to those typically invoked for directed acyclic graphical models.
no code implementations • 31 May 2023 • Alex Markham, MingYu Liu, Bryon Aragam, Liam Solus
Factor analysis (FA) is a statistical tool for studying how observed variables with some mutual dependences can be expressed as functions of mutually independent unobserved factors, and it is widely applied throughout the psychological, biological, and physical sciences.
no code implementations • 29 Mar 2023 • Organizers Of QueerInAI, :, Anaelia Ovalle, Arjun Subramonian, Ashwin Singh, Claas Voelcker, Danica J. Sutherland, Davide Locatelli, Eva Breznik, Filip Klubička, Hang Yuan, Hetvi J, huan zhang, Jaidev Shriram, Kruno Lehman, Luca Soldaini, Maarten Sap, Marc Peter Deisenroth, Maria Leonor Pacheco, Maria Ryskina, Martin Mundt, Milind Agarwal, Nyx McLean, Pan Xu, A Pranav, Raj Korpan, Ruchira Ray, Sarah Mathew, Sarthak Arora, ST John, Tanvi Anand, Vishakha Agrawal, William Agnew, Yanan Long, Zijie J. Wang, Zeerak Talat, Avijit Ghosh, Nathaniel Dennler, Michael Noseworthy, Sharvani Jha, Emi Baylor, Aditya Joshi, Natalia Y. Bilenko, Andrew McNamara, Raphael Gontijo-Lopes, Alex Markham, Evyn Dǒng, Jackie Kay, Manu Saraswat, Nikhil Vytla, Luke Stark
We present Queer in AI as a case study for community-led participatory design in AI.
no code implementations • 3 Oct 2022 • Danai Deligeorgaki, Alex Markham, Pratik Misra, Liam Solus
We consider the problem of estimating the marginal independence structure of a Bayesian network from observational data, learning an undirected graph we call the unconditional dependence graph.
no code implementations • 1 Mar 2022 • Alex Markham, Danai Deligeorgaki, Pratik Misra, Liam Solus
We consider the problem of characterizing Bayesian networks up to unconditional equivalence, i. e., when directed acyclic graphs (DAGs) have the same set of unconditional $d$-separation statements.
no code implementations • 7 Jun 2021 • Alex Markham, Richeek Das, Moritz Grosse-Wentrup
Even stronger, we prove that the kernel space is isometric to the space of causal ancestral graphs, so that distance between samples in the kernel space is guaranteed to correspond to distance between their generating causal structures.
no code implementations • NeurIPS 2021 • Alex Markham, Moritz Grosse-Wentrup
We consider the problem of causal structure learning in the setting of heterogeneous populations, i. e., populations in which a single causal structure does not adequately represent all population members, as is common in biological and social sciences.
no code implementations • 19 Oct 2019 • Alex Markham, Moritz Grosse-Wentrup
We consider the task of causal structure learning over measurement dependence inducing latent (MeDIL) causal models.