activity
20182021
most citedStructure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families

3 citations · 3 across the 1 of their papers we have counts for

collaborators
Showing stat.MLShow all

1 paper · 1 filter

stat.ML2020

A polynomial-time algorithm for learning nonparametric causal graphs

Ming Gao, Yi Ding, Bryon Aragam

We establish finite-sample guarantees for a polynomial-time algorithm for learning a nonlinear, nonparametric directed acyclic graphical (DAG) model from data. The analysis is mode…