activity
20222026
most citedTight Bounds on the Hardness of Learning Simple Nonparametric Mixtures

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

collaborators
Showing math.STShow all

1 paper · 1 filter

math.ST2022

Optimal estimation of Gaussian DAG models

Ming Gao, Wai Ming Tai, Bryon Aragam

We study the optimal sample complexity of learning a Gaussian directed acyclic graph (DAG) from observational data. Our main results establish the minimax optimal sample complexity…