<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1611.05162/</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/1611.05162/feed.xml" rel="self" type="application/rss+xml" /><item><title>Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee — mentioned by 317070</title><link>https://news.ycombinator.com/item?id=15912932</link><guid isPermaLink="false">urn:hackerpapers:mention:1611.05162:15912932</guid><pubDate>Wed, 13 Dec 2017 08:41:22 GMT</pubDate><description>&lt;p&gt;Compressing is indeed a hot topic, but I do feel like this article (the one on arXiv https://arxiv.org/abs/1611.05162 ) has some major shortcomings. First off, the datasets used (spiral and MNIST) are simple and small. They can be used as illustration, but should be avoided for benchmarking. Secondly, despite it being a hot topic, the authors did not compare with other algorithms. Thirdly, they have a 2 hidden dense layer network with over a million parameters for mnist, of course you can prune 95% of those parameters. You could probably have achieved the same result by simply training with…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1611.05162/"&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>
