activity
20182020
most citedD-VAE: A Variational Autoencoder for Directed Acyclic Graphs

86 citations · 97 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2020★ 3 cited

Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees

Shali Jiang, Daniel R. Jiang, Maximilian Balandat +3

Bayesian optimization is a sequential decision making framework for optimizing expensive-to-evaluate black-box functions. Computing a full lookahead policy amounts to solving a hig…

cs.LG2020★ 1 cited

Nearly Optimal Clustering Risk Bounds for Kernel K-Means

Yong Liu, Lizhong Ding, Weiping Wang

In this paper, we study the statistical properties of kernel -means and obtain a nearly optimal excess clustering risk bound, substantially improving the state-of-art bounds in…

cs.LG2019★ 3 cited

BINOCULARS for Efficient, Nonmyopic Sequential Experimental Design

Shali Jiang, Henry Chai, Javier Gonzalez +1

Finite-horizon sequential experimental design (SED) arises naturally in many contexts, including hyperparameter tuning in machine learning among more traditional settings. Computin…

cs.LG2019★ 86 cited

D-VAE: A Variational Autoencoder for Directed Acyclic Graphs

Muhan Zhang, Shali Jiang, Zhicheng Cui +2

Graph structured data are abundant in the real world. Among different graph types, directed acyclic graphs (DAGs) are of particular interest to machine learning researchers, as man…

cs.LG2018★ 4 cited

Efficient nonmyopic active search with applications in drug and materials discovery

Shali Jiang, Gustavo Malkomes, Benjamin Moseley +1

Active search is a learning paradigm for actively identifying as many members of a given class as possible. A critical target scenario is high-throughput screening for scientific d…