Search Results for author: Leonard J. Schulman

Found 7 papers, 0 papers with code

Identifiability of Product of Experts Models

no code implementations13 Oct 2023 Spencer L. Gordon, Manav Kant, Eric Ma, Leonard J. Schulman, Andrei Staicu

We show: (a) When the latents are uniformly distributed, the model is identifiable with a number of observables equal to the number of parameters (and hence best possible).

Identification of Mixtures of Discrete Product Distributions in Near-Optimal Sample and Time Complexity

no code implementations25 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.

2k Tensor Decomposition

Causal Inference Despite Limited Global Confounding via Mixture Models

no code implementations22 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.

Causal Inference

Hadamard Extensions and the Identification of Mixtures of Product Distributions

no code implementations27 Jan 2021 Spencer L. Gordon, Leonard J. Schulman

The Hadamard Extension of a matrix is the matrix consisting of all Hadamard products of subsets of its rows.

Source Identification for Mixtures of Product Distributions

no code implementations29 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.

The Sparse Hausdorff Moment Problem, with Application to Topic Models

no code implementations16 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.

2k Topic Models

Learning Arbitrary Statistical Mixtures of Discrete Distributions

no code implementations10 Apr 2015 Jian Li, Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy

We study the problem of learning from unlabeled samples very general statistical mixture models on large finite sets.

Collaborative Filtering Topic Models

Cannot find the paper you are looking for? You can Submit a new open access paper.