<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Going Deeper with Convolutions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1409.4842/</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/1409.4842/feed.xml" rel="self" type="application/rss+xml" /><item><title>Going Deeper with Convolutions — mentioned by jstx1</title><link>https://news.ycombinator.com/item?id=30989742</link><guid isPermaLink="false">urn:hackerpapers:mention:1409.4842:30989742</guid><pubDate>Mon, 11 Apr 2022 15:00:40 GMT</pubDate><description>&lt;p&gt;Image models too - the Inception paper from 2014 directly refers to knowyourmeme.com and the &amp;quot;we need to go deeper&amp;quot; meme from the movie Inception - https://knowyourmeme.com/memes/we-need-to-go-deeper - it&amp;#x27;s the first reference in the paper [1] and it&amp;#x27;s also why the model is called that way. [1] https://arxiv.org/pdf/1409.4842.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1409.4842/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Going Deeper with Convolutions — mentioned by chillingeffect</title><link>https://news.ycombinator.com/item?id=15648089</link><guid isPermaLink="false">urn:hackerpapers:mention:1409.4842:15648089</guid><pubDate>Tue, 07 Nov 2017 22:04:07 GMT</pubDate><description>&lt;p&gt;Are the layer names the same ones referred to in this paper? https://arxiv.org/abs/1409.4842 And how can e.g. layer3a be generated from layer conv2d0? By convolving with a linear kernel? Or by the entire Inception Module including the linear and the non-linear operations? Thank you. Outstanding work breaking it down. Here&amp;#x27;s another paper people might enjoy. The author generates an example for &amp;quot;Saxophone,&amp;quot; which includes a player... Which is fascinating, bc it implies that our usage of the word in real practice implies a player, even though the Saxophone is an instrument only. This highlights…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1409.4842/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Going Deeper with Convolutions — mentioned by andbberger</title><link>https://news.ycombinator.com/item?id=9816313</link><guid isPermaLink="false">urn:hackerpapers:mention:1409.4842:9816313</guid><pubDate>Thu, 02 Jul 2015 01:00:10 GMT</pubDate><description>&lt;p&gt;[citation needed] Sure, there&amp;#x27;s a huge amount of research happening in the field right now. But you make it sound like there&amp;#x27;s a ton of low hanging fruit, which is emphatically not true. Also, freezing the representations in the bottom layers usually doesn&amp;#x27;t lead to very good results. The representation the bottom layers learn in the standard formulation of deep feedforward networks is informed by gradient information in the output layers[1]. If you stop training the bottom layers after some time you&amp;#x27;re sacrificing representational power and in fact increasing the ultimate amount of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1409.4842/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Going Deeper with Convolutions — mentioned by avallet</title><link>https://news.ycombinator.com/item?id=9164526</link><guid isPermaLink="false">urn:hackerpapers:mention:1409.4842:9164526</guid><pubDate>Sun, 08 Mar 2015 04:25:08 GMT</pubDate><description>&lt;p&gt;Hi! Author here. The blog post and source code refer to an older algorithm than the one in the demo. Currently it is using a convolutional network for prediction not dissimilar to [1] or [2]. I&amp;#x27;m writing a paper about it, if there is interest I&amp;#x27;ll put it online :) . Thank you for the feedback on incorrectly identified characters! The algorithm is not quite perfect - 70% accuracy on a randomly chosen test set. [1]: http://arxiv.org/abs/1409.4842 [2]: http://arxiv.org/abs/1409.1556&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1409.4842/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>Going Deeper with Convolutions — HN submission</title><link>https://news.ycombinator.com/item?id=8340812</link><guid isPermaLink="false">urn:hackerpapers:submission:1409.4842:8340812</guid><pubDate>Fri, 19 Sep 2014 15:01:57 GMT</pubDate><description>&lt;p&gt;Going Deeper with Convolutions (GoogLeNet Paper)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1409.4842/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
