<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2102.02888/</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/2102.02888/feed.xml" rel="self" type="application/rss+xml" /><item><title>1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=34847931</link><guid isPermaLink="false">urn:hackerpapers:mention:2102.02888:34847931</guid><pubDate>Sat, 18 Feb 2023 16:08:51 GMT</pubDate><description>&lt;p&gt;&amp;gt; I don&amp;#x27;t really see this as any less clever than if someone had written the algorithm by hand. And you can invent this by hand. I was talking to Shawn Presser literally days before about his experiments in cutting down Adam to low-precision, where he had repeatedly cut it down, eventually to 1-bit, and found it was still working on small-scale Transformers - ie. close to this LION. (He didn&amp;#x27;t invent it exactly, but was like an `abs()` away or something: https://twitter.com/theshawwn/status/1625681629074137088 ) So that&amp;#x27;s how you could have invented this yourself: follow the logic of &amp;#x27;1-bit…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2102.02888/"&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>
