3 citations · 3 across the 1 of their papers we have counts for
5 papers
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…
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…
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…
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…
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…