no code implementations • 13 Nov 2023 • Bijan Mazaheri, Spencer Gordon, Yuval Rabani, Leonard Schulman
The task of learning these structures from data is known as ``causal discovery''.
no code implementations • 12 Nov 2023 • Bijan Mazaheri, Siddharth Jain, Matthew Cook, Jehoshua Bruck
We explore what we call ``omitted label contexts,'' in which training data is limited to a subset of the possible labels.
no code implementations • 25 Sep 2023 • Spencer L. Gordon, Erik Jahn, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
We consider the problem of identifying, from statistics, a distribution of discrete random variables $X_1,\ldots, X_n$ that is a mixture of $k$ product distributions.
no code implementations • 10 May 2023 • Bijan Mazaheri, Atalanti Mastakouri, Dominik Janzing, Michaela Hardt
Statistical prediction models are often trained on data from different probability distributions than their eventual use cases.
no code implementations • 22 Dec 2021 • Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
A Bayesian Network is a directed acyclic graph (DAG) on a set of $n$ random variables (the vertices); a Bayesian Network Distribution (BND) is a probability distribution on the random variables that is Markovian on the graph.
no code implementations • 15 Jul 2021 • Bijan Mazaheri, Siddharth Jain, Jehoshua Bruck
Consider multiple experts with overlapping expertise working on a classification problem under uncertain input.
no code implementations • 29 Dec 2020 • Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman
We give an algorithm for source identification of a mixture of $k$ product distributions on $n$ bits.
1 code implementation • NeurIPS 2020 • Bijan Mazaheri, Siddharth Jain, Jehoshua Bruck
Varying domains and biased datasets can lead to differences between the training and the target distributions, known as covariate shift.
no code implementations • 16 Jul 2020 • Spencer Gordon, Bijan Mazaheri, Leonard J. Schulman, Yuval Rabani
We give an algorithm for identifying a $k$-mixture using samples of $m=2k$ iid binary random variables using a sample of size $\left(1/w_{\min}\right)^2 \cdot\left(1/\zeta\right)^{O(k)}$ and post-sampling runtime of only $O(k^{2+o(1)})$ arithmetic operations.