<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Pruning on English AI Terms Dictionary</title><link>https://terms-en.ai-term-hub.com/en/tags/pruning/</link><description>Recent content in Pruning on English AI Terms Dictionary</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 18 Jul 2026 11:44:44 +0000</lastBuildDate><atom:link href="https://terms-en.ai-term-hub.com/en/tags/pruning/index.xml" rel="self" type="application/rss+xml"/><item><title>Lottery ticket hypothesis</title><link>https://terms-en.ai-term-hub.com/en/terms/lottery_ticket_hypothesis/</link><pubDate>Sat, 18 Jul 2026 10:05:43 +0000</pubDate><guid>https://terms-en.ai-term-hub.com/en/terms/lottery_ticket_hypothesis/</guid><description>&lt;h2 id="definition">Definition&lt;/h2>
&lt;p>The Lottery Ticket Hypothesis suggests that within a large, randomly initialized neural network, there exists a sparse subnetwork (the &amp;lsquo;winning ticket&amp;rsquo;) that is well-initialized for training. By pruning weights iteratively and resetting the remaining ones to their initial values, this subnetwork can converge to high accuracy independently. This concept supports model compression and efficiency, challenging the necessity of training massive models from scratch for every task.&lt;/p>
&lt;h3 id="summary">Summary&lt;/h3>
&lt;p>The theory that dense neural networks contain smaller subnetworks that, when trained in isolation from initialization, can match the accuracy of the original network.&lt;/p></description></item></channel></rss>