<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Better plain ViT baselines for ImageNet-1k · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2205.01580/</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/2205.01580/feed.xml" rel="self" type="application/rss+xml" /><item><title>Better plain ViT baselines for ImageNet-1k — mentioned by EnricoShippole</title><link>https://news.ycombinator.com/item?id=32046482</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.01580:32046482</guid><pubDate>Sun, 10 Jul 2022 17:02:23 GMT</pubDate><description>&lt;p&gt;An open-source implementation of the Better plain ViT baselines for ImageNet-1k research paper in Google&amp;#x27;s JAX and Flax. An update from some of the same authors of the original paper proposes simplifications to ViT that allows it to train faster and better. Among these simplifications include 2d sinusoidal positional embedding, global average pooling (no CLS token), no dropout, batch sizes of 1024 rather than 4096, and use of RandAugment and MixUp augmentations. They also show that a simple linear at the end is not significantly worse than the original MLP head. Simple ViT Research Paper…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.01580/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
