<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Neural Networks with Few Multiplications · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1510.03009/</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/1510.03009/feed.xml" rel="self" type="application/rss+xml" /><item><title>Neural Networks with Few Multiplications — mentioned by cs702</title><link>https://news.ycombinator.com/item?id=12431108</link><guid isPermaLink="false">urn:hackerpapers:mention:1510.03009:12431108</guid><pubDate>Mon, 05 Sep 2016 16:32:17 GMT</pubDate><description>&lt;p&gt;As far as I understand this, these guys claim they can train convolutional and many other types of deep neural nets faster by pretraining each layer with a new unsupervised technique via which the layer sort of learns to compress its inputs (a local optimization problem), and then they fine tune the whole network end-to-end with supervised SGD and backpropagation as usual. They have not released code, so no one else has replicated this yet -- as far as I know. If the claim holds, the implication is that layers can quickly learn much of what they need to learn locally, that is, without…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1510.03009/"&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>Neural Networks with Few Multiplications — mentioned by secondtimeuse</title><link>https://news.ycombinator.com/item?id=10883078</link><guid isPermaLink="false">urn:hackerpapers:mention:1510.03009:10883078</guid><pubDate>Mon, 11 Jan 2016 20:14:04 GMT</pubDate><description>&lt;p&gt;Deep Neural Networks involve Convolution and Matrix Multiplication operations which have a well defined hard upper bound in terms of speed wrt number of cores, GPUs (~thousands of processors) are in thus indispensable achieving a faster performance. There are newer interesting approaches such as reducing multiplication operations which might improve inference/forward speed even further. http://arxiv.org/abs/1510.03009&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1510.03009/"&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>Neural Networks with Few Multiplications — mentioned by dharma1</title><link>https://news.ycombinator.com/item?id=10536515</link><guid isPermaLink="false">urn:hackerpapers:mention:1510.03009:10536515</guid><pubDate>Mon, 09 Nov 2015 23:11:38 GMT</pubDate><description>&lt;p&gt;did you see this? http://arxiv.org/pdf/1510.03009v1.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1510.03009/"&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>Neural Networks with Few Multiplications — HN submission</title><link>https://news.ycombinator.com/item?id=10531331</link><guid isPermaLink="false">urn:hackerpapers:submission:1510.03009:10531331</guid><pubDate>Mon, 09 Nov 2015 04:09:38 GMT</pubDate><description>&lt;p&gt;Neural Networks with Few Multiplications&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;66 points; 8 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1510.03009/"&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>Neural Networks with Few Multiplications — HN submission</title><link>https://news.ycombinator.com/item?id=10402663</link><guid isPermaLink="false">urn:hackerpapers:submission:1510.03009:10402663</guid><pubDate>Fri, 16 Oct 2015 23:35:20 GMT</pubDate><description>&lt;p&gt;Neural Networks with Few Multiplications (Bengio and Co.)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1510.03009/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
