research
∙
06/20/2022
Identifiability of deep generative models under mixture priors without auxiliary information
We prove identifiability of a broad class of deep latent variable models...
share
research
∙
10/10/2021
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families
Greedy algorithms have long been a workhorse for learning graphical mode...
research
∙
06/29/2021
Learning latent causal graphs via mixture oracles
We study the problem of reconstructing a causal graphical model from dat...
research
∙
03/09/2021
Improved upper bounds for the rigidity of Kronecker products
The rigidity of a matrix A for target rank r is the minimum number of en...
research
∙
11/18/2020