<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Understanding Black-box Predictions via Influence Functions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1703.04730/</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/1703.04730/feed.xml" rel="self" type="application/rss+xml" /><item><title>Understanding Black-box Predictions via Influence Functions — mentioned by gradys</title><link>https://news.ycombinator.com/item?id=35252012</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.04730:35252012</guid><pubDate>Tue, 21 Mar 2023 20:26:07 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1703.04730 &amp;gt; How can we explain the predictions of a black-box model? In this paper, we use influence functions -- a classic technique from robust statistics -- to trace a model&amp;#x27;s prediction through the learning algorithm and back to its training data, thereby identifying training points most responsible for a given prediction.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.04730/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Understanding Black-box Predictions via Influence Functions — mentioned by version_five</title><link>https://news.ycombinator.com/item?id=34671019</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.04730:34671019</guid><pubDate>Sun, 05 Feb 2023 23:31:47 GMT</pubDate><description>&lt;p&gt;Your idea is the gold standard in explaining the influence of training data. People may be interested in this paper and more modern variations: https://arxiv.org/abs/1703.04730 It attempts to do as you suggest in a tractable way, to understand which training data is most influential.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.04730/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Understanding Black-box Predictions via Influence Functions — mentioned by andy99</title><link>https://news.ycombinator.com/item?id=27862594</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.04730:27862594</guid><pubDate>Sat, 17 Jul 2021 00:17:46 GMT</pubDate><description>&lt;p&gt;Related to understanding how ML models are making their decisions is the concept of influence [1] (or broadly, instance based explanations) [2] where the training data that is most influential in a prediction (basically the analogy the model used) is highlighted. See also [3] where I provide a take on using these methods for understanding if you can trust a prediction or not, based on whether the model has an appropriate analogy to work from [1] Understanding black box predictions through influence functions, https://arxiv.org/abs/1703.04730 [2] Evaluation of Similarity-based Explanations…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.04730/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item><item><title>Understanding Black-box Predictions via Influence Functions — HN submission</title><link>https://news.ycombinator.com/item?id=13914935</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.04730:13914935</guid><pubDate>Mon, 20 Mar 2017 15:24:46 GMT</pubDate><description>&lt;p&gt;Understanding Black-Box Machine Learning Predictions via Influence Functions&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1703.04730/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
