<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2206.01278/</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/2206.01278/feed.xml" rel="self" type="application/rss+xml" /><item><title>Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks — mentioned by nmfisher</title><link>https://news.ycombinator.com/item?id=36136488</link><guid isPermaLink="false">urn:hackerpapers:mention:2206.01278:36136488</guid><pubDate>Wed, 31 May 2023 09:57:28 GMT</pubDate><description>&lt;p&gt;Research [0] suggests that pretraining to uncover sparse subnetworks is faster when using &amp;quot;easy&amp;quot; subsets of the training data. Very small part of the overall picture but I do expect to see more research on data hashing/subsetting/ordering for training optimization in the near future. [0] https://arxiv.org/pdf/2206.01278.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2206.01278/"&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>
