3 citations · 5 across the 2 of their papers we have counts for
4 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…
Lookahead-Bounded Q-Learning
Ibrahim El Shar, Daniel R. Jiang
We introduce the lookahead-bounded Q-learning (LBQL) algorithm, a new, provably convergent variant of Q-learning that seeks to improve the performance of standard Q-learning in sto…
BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization
Maximilian Balandat, Brian Karrer, Daniel R. Jiang +4
Bayesian optimization provides sample-efficient global optimization for a broad range of applications, including automatic machine learning, engineering, physics, and experimental…
Feedback-Based Tree Search for Reinforcement Learning
Daniel R. Jiang, Emmanuel Ekwedike, Han Liu
Inspired by recent successes of Monte-Carlo tree search (MCTS) in a number of artificial intelligence (AI) application domains, we propose a model-based reinforcement learning (RL)…