23 citations · 26 across the 3 of their papers we have counts for
3 papers
stat.ML2019★ 23 cited
Learning Sparse Nonparametric DAGs
Xun Zheng, Chen Dan, Bryon Aragam +2
We develop a framework for learning sparse nonparametric directed acyclic graphs (DAGs) from data. Our approach is based on a recent algebraic characterization of DAGs that led to…
cs.DS2018★ 3 cited
Bilu-Linial stability, certified algorithms and the Independent Set problem
Haris Angelidakis, Pranjal Awasthi, Avrim Blum +2
We study the Maximum Independent Set (MIS) problem under the notion of stability introduced by Bilu and Linial (2010): a weighted instance of MIS is -stable if it has a unique o…
cs.LG2018
Sample Complexity of Nonparametric Semi-Supervised Learning
Chen Dan, Liu Leqi, Bryon Aragam +2
We study the sample complexity of semi-supervised learning (SSL) and introduce new assumptions based on the mismatch between a mixture model learned from unlabeled data and the tru…