<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Important Features Through Propagating Activation Differences · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1704.02685/</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/1704.02685/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Important Features Through Propagating Activation Differences — mentioned by therajiv</title><link>https://news.ycombinator.com/item?id=14733167</link><guid isPermaLink="false">urn:hackerpapers:mention:1704.02685:14733167</guid><pubDate>Mon, 10 Jul 2017 03:20:56 GMT</pubDate><description>&lt;p&gt;The author discusses how linear models are generally more interpretable than deep learning methods, but I&amp;#x27;d argue that&amp;#x27;s actually changing pretty quickly. Especially for large image/sequence inputs (which covers most of the applications that are getting hyped up), linear regressions don&amp;#x27;t perform very well, and often that performance difference prevents them from picking out important features. Given that fast, scalable methods for feature importance are on the rise (e.g. https://arxiv.org/abs/1704.02685, which the author mentions), you often get equally interpretable feature scores from deep…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1704.02685/"&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>
