Daniel R. Jiang

Orcid: 0000-0002-5388-8061

Affiliations:
  • University of Pittsburgh, PA, USA
  • Princeton University, NJ, USA (PhD 2016)


According to our database1, Daniel R. Jiang authored at least 24 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exploiting Structure in Offline Multi-Agent RL: The Benefits of Low Interaction Rank.
CoRR, 2024

Mathematical Programming For Adaptive Experiments.
CoRR, 2024

AExGym: Benchmarks and Environments for Adaptive Experimentation.
CoRR, 2024

2023
Dynamic Subgoal-based Exploration via Bayesian Optimization.
Trans. Mach. Learn. Res., 2023

Weakly Coupled Deep Q-Networks.
CoRR, 2023

Faster Approximate Dynamic Programming by Freezing Slow States.
CoRR, 2023

2nd Workshop on Multi-Armed Bandits and Reinforcement Learning: Advancing Decision Making in E-Commerce and Beyond.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
Dynamic Inventory Repositioning in On-Demand Rental Networks.
Manag. Sci., 2022

Interpretable Personalized Experimentation.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

2021
Distilling Heterogeneity: From Explanations of Heterogeneous Treatment Effect Models to Interpretable Policies.
CoRR, 2021

Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Multi-Armed Bandits and Reinforcement Learning: Advancing Decision Making in E-Commerce and Beyond.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

2020
Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds.
Oper. Res., 2020

BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Lookahead-Bounded Q-learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Exploration via Sample-Efficient Subgoal Design.
CoRR, 2019

BoTorch: Programmable Bayesian Optimization in PyTorch.
CoRR, 2019

2018
Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures.
Math. Oper. Res., 2018

Feedback-Based Tree Search for Reinforcement Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds.
CoRR, 2017

2015
An Approximate Dynamic Programming Algorithm for Monotone Value Functions.
Oper. Res., 2015

Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming.
INFORMS J. Comput., 2015

2014
A comparison of approximate dynamic programming techniques on benchmark energy storage problems: Does anything work?
Proceedings of the 2014 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, 2014


  Loading...