<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Neural Architecture Search: A Survey · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1808.05377/</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/1808.05377/feed.xml" rel="self" type="application/rss+xml" /><item><title>Neural Architecture Search: A Survey — HN submission</title><link>https://news.ycombinator.com/item?id=23072163</link><guid isPermaLink="false">urn:hackerpapers:submission:1808.05377:23072163</guid><pubDate>Mon, 04 May 2020 19:20:25 GMT</pubDate><description>&lt;p&gt;Ask HN: Has anyone tried to search for new, basic machine learning operations?&lt;/p&gt;&lt;p&gt;E.g. primitive operations like convolution and pooling. From Neural Architecture Search: A Survey[0], first published in 2018: &amp;quot;Moreover, common search spaces are also based on predefined building blocks, such as different kinds of convolutions and pooling, but do not allow identifying novel building blocks on this level; going beyond this limitation might substantially increase the power of NAS.&amp;quot; I wonder now if somebody tried that since this was written or if anybody has some thoughts about the feasibility of this idea. We&amp;#x27;ve been using these methods for years. I doubt the first few…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1808.05377/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
