1. Solving NP-hard problems on graphs by reinforcement learning without domain knowledge;Abe,2019
2. ABCD-strategy: Budgeted experimental design for targeted causal structure discovery;Agrawal,2019
3. LazyIter: A fast algorithm for counting Markov equivalent DAGs and designing experiments;AhmadiTeshnizi,2020
4. A characterization of Markov equivalence classes for acyclic digraphs;Andersson;The Annals of Statistics,1997
5. Learning to perform local rewriting for combinatorial optimization;Chen,2019