Alert button
Picture for Daniel R. Jiang

Daniel R. Jiang

Alert button

Weakly Coupled Deep Q-Networks

Oct 28, 2023
Ibrahim El Shar, Daniel R. Jiang

Viaarxiv icon

Faster Approximate Dynamic Programming by Freezing Slow States

Jan 03, 2023
Yijia Wang, Daniel R. Jiang

Figure 1 for Faster Approximate Dynamic Programming by Freezing Slow States
Figure 2 for Faster Approximate Dynamic Programming by Freezing Slow States
Figure 3 for Faster Approximate Dynamic Programming by Freezing Slow States
Figure 4 for Faster Approximate Dynamic Programming by Freezing Slow States
Viaarxiv icon

Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs

Nov 12, 2021
Raul Astudillo, Daniel R. Jiang, Maximilian Balandat, Eytan Bakshy, Peter I. Frazier

Figure 1 for Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs
Figure 2 for Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs
Figure 3 for Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs
Figure 4 for Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs
Viaarxiv icon

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

Jun 29, 2020
Shali Jiang, Daniel R. Jiang, Maximilian Balandat, Brian Karrer, Jacob R. Gardner, Roman Garnett

Figure 1 for Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees
Figure 2 for Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees
Figure 3 for Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees
Figure 4 for Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees
Viaarxiv icon

Lookahead-Bounded Q-Learning

Jun 28, 2020
Ibrahim El Shar, Daniel R. Jiang

Figure 1 for Lookahead-Bounded Q-Learning
Figure 2 for Lookahead-Bounded Q-Learning
Figure 3 for Lookahead-Bounded Q-Learning
Figure 4 for Lookahead-Bounded Q-Learning
Viaarxiv icon

Exploration via Sample-Efficient Subgoal Design

Oct 21, 2019
Yijia Wang, Matthias Poloczek, Daniel R. Jiang

Figure 1 for Exploration via Sample-Efficient Subgoal Design
Figure 2 for Exploration via Sample-Efficient Subgoal Design
Figure 3 for Exploration via Sample-Efficient Subgoal Design
Figure 4 for Exploration via Sample-Efficient Subgoal Design
Viaarxiv icon

BoTorch: Programmable Bayesian Optimization in PyTorch

Oct 14, 2019
Maximilian Balandat, Brian Karrer, Daniel R. Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, Eytan Bakshy

Figure 1 for BoTorch: Programmable Bayesian Optimization in PyTorch
Figure 2 for BoTorch: Programmable Bayesian Optimization in PyTorch
Figure 3 for BoTorch: Programmable Bayesian Optimization in PyTorch
Figure 4 for BoTorch: Programmable Bayesian Optimization in PyTorch
Viaarxiv icon

Feedback-Based Tree Search for Reinforcement Learning

May 15, 2018
Daniel R. Jiang, Emmanuel Ekwedike, Han Liu

Figure 1 for Feedback-Based Tree Search for Reinforcement Learning
Figure 2 for Feedback-Based Tree Search for Reinforcement Learning
Figure 3 for Feedback-Based Tree Search for Reinforcement Learning
Figure 4 for Feedback-Based Tree Search for Reinforcement Learning
Viaarxiv icon

Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures

May 09, 2017
Daniel R. Jiang, Warren B. Powell

Figure 1 for Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures
Figure 2 for Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures
Figure 3 for Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures
Figure 4 for Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures
Viaarxiv icon

Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds

Apr 20, 2017
Daniel R. Jiang, Lina Al-Kanj, Warren B. Powell

Figure 1 for Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds
Figure 2 for Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds
Figure 3 for Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds
Figure 4 for Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds
Viaarxiv icon