<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1012.2599/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1012.2599/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning — mentioned by abhgh</title><link>https://news.ycombinator.com/item?id=17588515</link><guid isPermaLink="false">urn:hackerpapers:mention:1012.2599:17588515</guid><pubDate>Sun, 22 Jul 2018 19:42:50 GMT</pubDate><description>&lt;p&gt;One of their more interesting applications is in Bayesian Optimization (BO). You&amp;#x27;d do BO optimization where evaluating the objective function is expensive. As against, lets say, where you might use gradient descent, where you navigate your space via repeated evaluation of the objective function. BO essentially starts building its own model of what the objective function looks like in relation to its parameters, and picks a few promising points to evaluate it at. Thus, it moves the burden of evaluating a costly objective multiple times to identifying these highly promising points. A BO…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1012.2599/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
