<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Breaking the Memory Barrier: Near Infinite Batch Size Scaling for Contrastive Loss · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2410.17243/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2410.17243/feed.xml" rel="self" type="application/rss+xml" /><item><title>Breaking the Memory Barrier: Near Infinite Batch Size Scaling for Contrastive Loss — HN submission</title><link>https://news.ycombinator.com/item?id=41947363</link><guid isPermaLink="false">urn:hackerpapers:submission:2410.17243:41947363</guid><pubDate>Fri, 25 Oct 2024 17:19:56 GMT</pubDate><description>&lt;p&gt;Breaking Memory Barrier: Near Infinite Batch Size Scaling for Contrastive Loss&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/2410.17243/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
