Learning Graphical Models
Fast Scalable and Accurate Discovery of DAGs Using the Best Order Score Search and Grow-Shrink Trees
We introduce the best order score search (BOSS) and grow-shrink trees (GSTs) for learning directed acyclic graphs (DAGs) in this paradigm.
IPMix: Label-Preserving Data Augmentation Method for Training Robust Classifiers
Data augmentation has been proven effective for training high-accuracy convolu-tional neural network classifiers by preventing overfitting.
Distributionally Robust Skeleton Learning of Discrete Bayesian Networks Y eshu Li
The DAG structure of a Bayesian network is typically unknown in practice [Natori et al., 2017,
Sample Complexity of Goal-Conditioned Hierarchical Reinforcement Learning
HRL lead to improved sample complexity, and how much of an improvement can it provide? Theoretical work on sample-complexity bound in Machine Learning has been integral to the development of the field.
Policy Gradient for Rectangular Robust Markov Decision Processes Anonymous Author(s) Affiliation Address email
We provide a closed-form expression for the worst occupation measure.