<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Interpretable Models Using Uncertainty Oracles · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1906.06852/</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/1906.06852/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Interpretable Models Using Uncertainty Oracles — mentioned by abhgh</title><link>https://news.ycombinator.com/item?id=42280409</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.06852:42280409</guid><pubDate>Sat, 30 Nov 2024 08:44:12 GMT</pubDate><description>&lt;p&gt;Yes, that&amp;#x27;s the one: https://arxiv.org/pdf/1906.06852&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.06852/"&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>Learning Interpretable Models Using Uncertainty Oracles — mentioned by aspenmayer</title><link>https://news.ycombinator.com/item?id=42280379</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.06852:42280379</guid><pubDate>Sat, 30 Nov 2024 08:34:41 GMT</pubDate><description>&lt;p&gt;Is a preprint of your paper available? I looked at your blog a bit and was able to find this, which may be it? &amp;gt; Learning Interpretable Models Using Uncertainty Oracles https://arxiv.org/abs/1906.06852 https://doi.org/10.48550/arXiv.1906.06852&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.06852/"&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>Learning Interpretable Models Using Uncertainty Oracles — mentioned by abhgh</title><link>https://news.ycombinator.com/item?id=39958434</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.06852:39958434</guid><pubDate>Sun, 07 Apr 2024 05:46:31 GMT</pubDate><description>&lt;p&gt;Not for DL models, but I was exploring doing this in a specific setting (I&amp;#x27;ve posted about this earlier). For small-sized models (for some reasonable definition of size, e.g., depth of a decision tree, or # trees in a gradient boosting forest, or # non-zero coefficients in a linear model), I realized that you could make them even smaller while retaining their accuracy by selectively presenting training data to them, i.e., ignore some training data points, repeat certain others. See [1] - the x-axis shows the original model size and the y-axis shows the model size obtained by this process at…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.06852/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
