Sen, R., Kandasamy, K., & Shakkottai, S. (2020). Noisy Blackbox Optimization Using Multi-Fidelity Queries: A Tree Search Approach (Report No. D-STOP/2020/159). University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP). https://rosap.ntl.bts.gov/view/dot/55861
Sen, Rajat, Kirthevasan Kandasamy, and Sanjay Shakkottai. Noisy Blackbox Optimization Using Multi-Fidelity Queries: A Tree Search Approach. Report no. D-STOP/2020/159. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2020. https://rosap.ntl.bts.gov/view/dot/55861.
Sen, Rajat, et al. Noisy Blackbox Optimization Using Multi-Fidelity Queries: A Tree Search Approach. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2020, Report no. D-STOP/2020/159, ROSA P. https://rosap.ntl.bts.gov/view/dot/55861.
Details
Alternative Title:
Sensing and Communications in V2V and V2I Settings Project Title, from cover
We study the problem of black-box optimization of a noisy function in the presence of low-cost approximations or fidelities, which is motivated by problems like hyper-parameter tuning. In hyper-parameter tuning evaluating the black-box function at a point involves training a learning algorithm on a large dataset at a particular hyper-parameter and evaluating the validation error. Even a single such evaluation can be prohibitively expensive. Therefore, it is beneficial to use low cost approximations, like training the learning algorithm on a sub-sampled version of the whole data-set. These low-cost approximations/ fidelities can however provide a biased and noisy estimate of the function value. In this work, we combine structured state-space exploration through hierarchical partitioning with querying these partitions at multiple fidelities, and develop a multi-fidelities bandit based tree-search algorithm for noisy blackbox optimization. We derive simple regret guarantees for our algorithm and validate its performance on real and synthetic datasets.
Sen, R., Kandasamy, K., & Shakkottai, S. (2020). Noisy Blackbox Optimization Using Multi-Fidelity Queries: A Tree Search Approach (Report No. D-STOP/2020/159). University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP). https://rosap.ntl.bts.gov/view/dot/55861
Sen, Rajat, Kirthevasan Kandasamy, and Sanjay Shakkottai. Noisy Blackbox Optimization Using Multi-Fidelity Queries: A Tree Search Approach. Report no. D-STOP/2020/159. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2020. https://rosap.ntl.bts.gov/view/dot/55861.
Sen, Rajat, et al. Noisy Blackbox Optimization Using Multi-Fidelity Queries: A Tree Search Approach. University of Texas at Austin. Data-Supported Transportation Operations & Planning Center (D-STOP), 2020, Report no. D-STOP/2020/159, ROSA P. https://rosap.ntl.bts.gov/view/dot/55861.
ROSA P serves as an archival repository of USDOT-published products including scientific
findings, journal articles, guidelines, recommendations, or other information authored or co-authored by
USDOT or funded partners. As a repository, ROSA P retains documents in their original published format to
ensure public access to scientific information.
Links with this icon indicate that you are leaving a Bureau of Transportation
Statistics (BTS)/National Transportation Library (NTL)
Web-based service.
Thank you for visiting.
You are about to access a non-government link outside of
the U.S. Department of Transportation's National
Transportation Library.
Please note: While links to Web sites outside of DOT are
offered for your convenience, when you exit DOT Web sites,
Federal privacy policy and Section 508 of the Rehabilitation
Act (accessibility requirements) no longer apply. In
addition, DOT does not attest to the accuracy, relevance,
timeliness or completeness of information provided by linked
sites. Linking to a Web site does not constitute an
endorsement by DOT of the sponsors of the site or the
products presented on the site. For more information, please
view DOT's Web site linking policy.
To get back to the page you were previously viewing, click
your Cancel button.