<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Practical Bayesian Optimization of Machine Learning Algorithms · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1206.2944/</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/1206.2944/feed.xml" rel="self" type="application/rss+xml" /><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by abhgh</title><link>https://news.ycombinator.com/item?id=17508016</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:17508016</guid><pubDate>Wed, 11 Jul 2018 16:11:22 GMT</pubDate><description>&lt;p&gt;You are not doing away with the test/validation set. You are doing away with: 1. grid search - you would now only test for parameters that look promising (based on some criteria). Instead of covering the whole grid, you want to be smart about which points to try out. [1] 2. you might still do grid search but you want to preferentially allocate resources to parameter exploration based on how promising they seem. Hyperband - [2]- is an example. 3. you can do both - you can be smart about picking parameters, but for the ones you pick you can preferentially allocate resources. Ex *Bayesian…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by kirillseva</title><link>https://news.ycombinator.com/item?id=16247257</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:16247257</guid><pubDate>Sat, 27 Jan 2018 18:17:31 GMT</pubDate><description>&lt;p&gt;This is the spearmint paper, describes how bayesian search algorithms can be parallelized in practice. There was also a very gentle introduction to bayesian optimization, I think it&amp;#x27;s one of the referenced papers. Cannot seem to find it right now. https://arxiv.org/pdf/1206.2944.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by ancaster</title><link>https://news.ycombinator.com/item?id=9668877</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:9668877</guid><pubDate>Fri, 05 Jun 2015 23:41:22 GMT</pubDate><description>&lt;p&gt;I just came across this today. Code for the project is here: https://github.com/JasperSnoek/spearmint Based on the paper (preprint): http://arxiv.org/pdf/1206.2944.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — HN submission</title><link>https://news.ycombinator.com/item?id=9623530</link><guid isPermaLink="false">urn:hackerpapers:submission:1206.2944:9623530</guid><pubDate>Fri, 29 May 2015 09:18:14 GMT</pubDate><description>&lt;p&gt;PRACTICAL BAYESIAN OPTIMIZATION OF MACHINE LEARNING ALGORITHMS [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — HN submission</title><link>https://news.ycombinator.com/item?id=9420260</link><guid isPermaLink="false">urn:hackerpapers:submission:1206.2944:9420260</guid><pubDate>Wed, 22 Apr 2015 13:34:46 GMT</pubDate><description>&lt;p&gt;Practical Bayesian Optimization of Machine Learning Algorithms (2012)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by ajtulloch</title><link>https://news.ycombinator.com/item?id=6825573</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:6825573</guid><pubDate>Sun, 01 Dec 2013 01:18:49 GMT</pubDate><description>&lt;p&gt;Practical Bayesian Optimisation of Machine Learning Hyperparameters [1] was a great recent paper on this topic that looked to have very nice results in practice across a range of models. Is there any interest in implementing that algorithm in hyperopt? [1]: http://arxiv.org/pdf/1206.2944.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by ajtulloch</title><link>https://news.ycombinator.com/item?id=6772408</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:6772408</guid><pubDate>Thu, 21 Nov 2013 00:56:00 GMT</pubDate><description>&lt;p&gt;My take on this is somewhat different - my background is pure mathematics in my undergraduate degree, then applied machine learning at Facebook (ads optimization) and GS (algo trading), and currently at graduate school in ML. My take is that &amp;#x27;applying&amp;#x27; machine learning is much easier than one would think, but &amp;#x27;understanding&amp;#x27; machine learning is _much_ harder than one would think. I imagine most people start with an application - that&amp;#x27;s why they&amp;#x27;re interested in the first place. Applying an ML algorithm to a given dataset is trivial - only a few lines in R/Python with scikits-learn, etc.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by ninjin</title><link>https://news.ycombinator.com/item?id=5075817</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:5075817</guid><pubDate>Thu, 17 Jan 2013 23:03:27 GMT</pubDate><description>&lt;p&gt;I agree that the hyper-parameter selection is a huge pain, personally though, I am more familiar with the work of Snoek et al. [1] from NIPS in December last year. He even distributes a neat Python package that will perform Bayesian optimisation combined with MCMC [2] so that even people, like me, that are not yet familiar with Gaussian Processes can deploy it easily. [1]: http://arxiv.org/pdf/1206.2944v2 [2]: http://www.cs.toronto.edu/~jasper/software.html&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by doobwa</title><link>https://news.ycombinator.com/item?id=4734116</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:4734116</guid><pubDate>Fri, 02 Nov 2012 18:42:23 GMT</pubDate><description>&lt;p&gt;I agree these methods still require a fair amount of expert knowledge and intuition in order to make the various choices you mention. On the other hand, Bayesian optimization can prove useful for exploring such a space. A recent paper (http://arxiv.org/pdf/1206.2944.pdf) used Bayesian optimization with GPs to find hyperparameter settings for a deep convolutional network. The resulting hyperparameters gave state of the art performance, beating those chosen by an expert (Krizhevsky, the researcher who recently won ImageNet).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Practical Bayesian Optimization of Machine Learning Algorithms — mentioned by danger</title><link>https://news.ycombinator.com/item?id=4282370</link><guid isPermaLink="false">urn:hackerpapers:mention:1206.2944:4282370</guid><pubDate>Mon, 23 Jul 2012 18:36:13 GMT</pubDate><description>&lt;p&gt;As another commenter pointed out, the accuracy really needs to be evaluated using a validation set, not the test set--the approach described in the post is training with the testing data. In the field, we call this &amp;quot;cheating&amp;quot;. The basic idea of automatically tuning hyperparameters (the things this post discusses tuning with genetic algorithms) is cool, though, and is becoming a popular subject in machine learning research. A couple recent research papers on the topic are pretty readable: Algorithms for Hyper-Parameter Optimization: http://books.nips.cc/papers/files/nips24/NIPS2011_1385.pdf…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1206.2944/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
