<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Factors in Finetuning Deep Model for object detection · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1601.05150/</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/1601.05150/feed.xml" rel="self" type="application/rss+xml" /><item><title>Factors in Finetuning Deep Model for object detection — mentioned by hiddencost</title><link>https://news.ycombinator.com/item?id=13569283</link><guid isPermaLink="false">urn:hackerpapers:mention:1601.05150:13569283</guid><pubDate>Sat, 04 Feb 2017 21:48:14 GMT</pubDate><description>&lt;p&gt;They&amp;#x27;re not saying &amp;quot;size of the data set in bits&amp;quot;, they&amp;#x27;re saying &amp;quot;number of items in the dataset&amp;quot;. In speech and image recognition, it&amp;#x27;s normal to have more parameters than data points. This is a bit old, although it&amp;#x27;s still a very good architecture, but: GoogLeNet [0] has around 10M parameters, and was trained on 1.2M images. In fact, the 2016 winner of a bunch of the ILSVRC challenges [1,2] was topologically basically the same as GoogLeNet. EDIT: There&amp;#x27;s a perspective on machine learning which is basically just: &amp;quot;what if your model learns a hash-map&amp;quot;. Check out Vapnik-Chervonenkis…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1601.05150/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
