Skip to content
conftrace_

bayesian optimization

732 papers

BO BAYESOPT

Papers

Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs NeurIPS 2021 Nonmyopic Multifidelity Acitve Search ICML 2021 No-regret Algorithms for Multi-task Bayesian Optimization AISTATS 2021 NPAS: A Compiler-Aware Framework of Unified Network Pruning and Architecture Search for Beyond Real-Time Mobile Acceleration CVPR 2021 Objective Bound Conditional Gaussian Process for Bayesian Optimization ICML 2021 OCTIS: Comparing and Optimizing Topic models is Simple! EACL 2021 On Information Gain and Regret Bounds in Gaussian Process Bandits AISTATS 2021 Optimal Order Simple Regret for Gaussian Process Bandits NeurIPS 2021 Optimizing Conditional Value-At-Risk of Black-Box Functions NeurIPS 2021 Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement NeurIPS 2021 Predictive Job Scheduling under Uncertain Constraints in Cloud Computing IJCAI 2021 Regret Bounds for Gaussian-Process Optimization in Large Domains NeurIPS 2021 Reinforced Few-Shot Acquisition Function Learning for Bayesian Optimization NeurIPS 2021 Risk-Averse Bayes-Adaptive Reinforcement Learning NeurIPS 2021 Risk-averse Heteroscedastic Bayesian Optimization NeurIPS 2021 Safe Bayesian Optimisation for Controller Design by Utilising the Parameter Space Approach L4DC 2021 Scalable Constrained Bayesian Optimization AISTATS 2021 Scalable Thompson Sampling using Sparse Gaussian Process Models NeurIPS 2021 Scaling Gaussian Processes with Derivative Information Using Variational Inference NeurIPS 2021 Significance of Gradient Information in Bayesian Optimization AISTATS 2021 Text AutoAugment: Learning Compositional Augmentation Policy for Text Classification EMNLP 2021 Thompson Sampling Algorithms for Cascading Bandits JMLR 2021 Top-k Ranking Bayesian Optimization AAAI 2021 Toward Optimal Solution for the Context-Attentive Bandit Problem IJCAI 2021 Trusted-maximizers entropy search for efficient Bayesian optimization UAI 2021