<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Progressive Weight Pruning of Deep Neural Networks using ADMM · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1810.07378/</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/1810.07378/feed.xml" rel="self" type="application/rss+xml" /><item><title>Progressive Weight Pruning of Deep Neural Networks using ADMM — mentioned by janhenr</title><link>https://news.ycombinator.com/item?id=23125562</link><guid isPermaLink="false">urn:hackerpapers:mention:1810.07378:23125562</guid><pubDate>Sat, 09 May 2020 15:35:23 GMT</pubDate><description>&lt;p&gt;It is, unfortunately, not revolutionary at all. The Lottery Ticket Hypothesis won a Best Paper Award because the idea is very intuitive and elegant. However, the compression rates (9x) of this follow-up work on ImageNet are far from impressive. Take for example this paper: https://arxiv.org/abs/1810.07378 that reaches 30x compression rate on ImageNet. (Disclaimer: I know the original author and co-published a paper with him - not this one however)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1810.07378/"&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>
