1 citations · 1 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LG2022★ 1 cited
Tight Bounds on the Hardness of Learning Simple Nonparametric Mixtures
Bryon Aragam, Wai Ming Tai
We study the problem of learning nonparametric distributions in a finite mixture, and establish tight bounds on the sample complexity for learning the component distributions in su…
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…