<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Feature Learning in Infinite-Width Neural Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2011.14522/</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/2011.14522/feed.xml" rel="self" type="application/rss+xml" /><item><title>Feature Learning in Infinite-Width Neural Networks — mentioned by medlyyy</title><link>https://news.ycombinator.com/item?id=26355830</link><guid isPermaLink="false">urn:hackerpapers:mention:2011.14522:26355830</guid><pubDate>Fri, 05 Mar 2021 11:55:54 GMT</pubDate><description>&lt;p&gt;Why exactly is it a problem that powerful models can memorise training data with random labels, if they generalise well on non-memorisation problems? I also think that a lot of progress is being made seemingly in parallel on this &amp;quot;understanding NN [generalisation]&amp;quot; topic, and the different threads don&amp;#x27;t necessarily seem to be aware of each other. This article seems to have failed to mention most of this recent progress. Possibly this is an artifact of the time it takes to produce and publish a completed article, but it presents a picture that we are more clueless than we actually are. The…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2011.14522/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Feature Learning in Infinite-Width Neural Networks — HN submission</title><link>https://news.ycombinator.com/item?id=26079984</link><guid isPermaLink="false">urn:hackerpapers:submission:2011.14522:26079984</guid><pubDate>Tue, 09 Feb 2021 17:13:50 GMT</pubDate><description>&lt;p&gt;Wide Neural Networks Are Feature Learners, Not Kernel Machines&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/2011.14522/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Feature Learning in Infinite-Width Neural Networks — HN submission</title><link>https://news.ycombinator.com/item?id=25332023</link><guid isPermaLink="false">urn:hackerpapers:submission:2011.14522:25332023</guid><pubDate>Mon, 07 Dec 2020 13:44:04 GMT</pubDate><description>&lt;p&gt;Wide Neural Networks Are Feature Learners, Not Kernel Machines&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2011.14522/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Feature Learning in Infinite-Width Neural Networks — mentioned by edwardjhu</title><link>https://news.ycombinator.com/item?id=25327449</link><guid isPermaLink="false">urn:hackerpapers:mention:2011.14522:25327449</guid><pubDate>Sun, 06 Dec 2020 22:53:55 GMT</pubDate><description>&lt;p&gt;The claim here is a bit misleading, as already pointed out by other comments, since the kernel is an evolving one that is essentially learned after seeing the data. Contrary to many related works that compare wide neural networks to kernel methods, our recent work shows that one can study a feature learning infinite-width limit with realistic learning rate. https://arxiv.org/abs/2011.14522 We identified what separates the kernel regime (e.g., NTK) and the feature learning regime. In the infinite-width limit, OP&amp;#x27;s work could belong to either regime depending on the parametrization, i.e. the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2011.14522/"&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>
