default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel R. Jiang
Person information
- affiliation: University of Pittsburgh, PA, USA
- affiliation (PhD 2016): Princeton University, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Jimmy Wang, Ethan Che, Daniel R. Jiang, Hongseok Namkoong:
AExGym: Benchmarks and Environments for Adaptive Experimentation. CoRR abs/2408.04531 (2024)- [i13]Ethan Che, Daniel R. Jiang, Hongseok Namkoong, Jimmy Wang:
Mathematical Programming For Adaptive Experiments. CoRR abs/2408.04570 (2024) - [i12]Wenhao Zhan, Scott Fujimoto, Zheqing Zhu, Jason D. Lee, Daniel R. Jiang, Yonathan Efroni:
Exploiting Structure in Offline Multi-Agent RL: The Benefits of Low Interaction Rank. CoRR abs/2410.01101 (2024) - 2023
- [j6]Yijia Wang, Matthias Poloczek, Daniel R. Jiang:
Dynamic Subgoal-based Exploration via Bayesian Optimization. Trans. Mach. Learn. Res. 2023 (2023) - [c9]Chu Wang
, Yingfei Wang, Haipeng Luo, Daniel R. Jiang, Jinghai He, Zeyu Zheng:
2nd Workshop on Multi-Armed Bandits and Reinforcement Learning: Advancing Decision Making in E-Commerce and Beyond. KDD 2023: 5890 - [i11]Yijia Wang, Daniel R. Jiang:
Faster Approximate Dynamic Programming by Freezing Slow States. CoRR abs/2301.00922 (2023) - [i10]Ibrahim El Shar, Daniel R. Jiang:
Weakly Coupled Deep Q-Networks. CoRR abs/2310.18803 (2023) - 2022
- [j5]Saif Benjaafar, Daniel R. Jiang, Xiang Li, Xiaobo Li:
Dynamic Inventory Repositioning in On-Demand Rental Networks. Manag. Sci. 68(11): 7861-7878 (2022) - [c8]Han Wu, Sarah Tan, Weiwei Li, Mia Garrard, Adam Obeng, Drew Dimmery, Shaun Singh, Hanson Wang, Daniel R. Jiang, Eytan Bakshy:
Interpretable Personalized Experimentation. KDD 2022: 4173-4183 - 2021
- [c7]Daniel R. Jiang, Haipeng Luo, Chu Wang, Yingfei Wang:
Multi-Armed Bandits and Reinforcement Learning: Advancing Decision Making in E-Commerce and Beyond. KDD 2021: 4133-4134 - [c6]Raul Astudillo, Daniel R. Jiang, Maximilian Balandat, Eytan Bakshy, Peter I. Frazier:
Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs. NeurIPS 2021: 20197-20209 - [i9]Han Wu, Sarah Tan, Weiwei Li, Mia Garrard, Adam Obeng, Drew Dimmery, Shaun Singh, Hanson Wang, Daniel R. Jiang, Eytan Bakshy:
Distilling Heterogeneity: From Explanations of Heterogeneous Treatment Effect Models to Interpretable Policies. CoRR abs/2111.03267 (2021) - [i8]Raul Astudillo, Daniel R. Jiang, Maximilian Balandat, Eytan Bakshy, Peter I. Frazier:
Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs. CoRR abs/2111.06537 (2021) - 2020
- [j4]Daniel R. Jiang, Lina Al-Kanj, Warren B. Powell:
Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds. Oper. Res. 68(6): 1678-1697 (2020) - [c5]Ibrahim El Shar, Daniel R. Jiang:
Lookahead-Bounded Q-learning. ICML 2020: 8665-8675 - [c4]Shali Jiang, Daniel R. Jiang, Maximilian Balandat, Brian Karrer, Jacob R. Gardner, Roman Garnett:
Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees. NeurIPS 2020 - [c3]Maximilian Balandat, Brian Karrer, Daniel R. Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, Eytan Bakshy:
BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization. NeurIPS 2020 - [i7]Ibrahim El Shar, Daniel R. Jiang:
Lookahead-Bounded Q-Learning. CoRR abs/2006.15690 (2020) - [i6]Shali Jiang, Daniel R. Jiang, Maximilian Balandat, Brian Karrer, Jacob R. Gardner, Roman Garnett:
Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees. CoRR abs/2006.15779 (2020)
2010 – 2019
- 2019
- [i5]Maximilian Balandat, Brian Karrer, Daniel R. Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, Eytan Bakshy:
BoTorch: Programmable Bayesian Optimization in PyTorch. CoRR abs/1910.06403 (2019) - [i4]Yijia Wang, Matthias Poloczek, Daniel R. Jiang:
Exploration via Sample-Efficient Subgoal Design. CoRR abs/1910.09143 (2019) - 2018
- [j3]Daniel R. Jiang, Warren B. Powell:
Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures. Math. Oper. Res. 43(2): 554-579 (2018) - [c2]Daniel R. Jiang, Emmanuel Ekwedike, Han Liu:
Feedback-Based Tree Search for Reinforcement Learning. ICML 2018: 2289-2298 - [i3]Daniel R. Jiang, Emmanuel Ekwedike, Han Liu:
Feedback-Based Tree Search for Reinforcement Learning. CoRR abs/1805.05935 (2018) - 2017
- [i2]Daniel R. Jiang, Lina Al-Kanj, Warren B. Powell:
Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds. CoRR abs/1704.05963 (2017) - 2015
- [j2]Daniel R. Jiang, Warren B. Powell:
Optimal Hour-Ahead Bidding in the Real-Time Electricity Market with Battery Storage Using Approximate Dynamic Programming. INFORMS J. Comput. 27(3): 525-543 (2015) - [j1]Daniel R. Jiang, Warren B. Powell:
An Approximate Dynamic Programming Algorithm for Monotone Value Functions. Oper. Res. 63(6): 1489-1511 (2015) - [i1]Daniel R. Jiang, Warren B. Powell:
Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures. CoRR abs/1509.01920 (2015) - 2014
- [c1]Daniel R. Jiang, Thuy V. Pham, Warren B. Powell, Daniel F. Salas, Warren R. Scott:
A comparison of approximate dynamic programming techniques on benchmark energy storage problems: Does anything work? ADPRL 2014: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
