<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Revisiting Transformer-based Models for Long Document Classification · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2204.06683/</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/2204.06683/feed.xml" rel="self" type="application/rss+xml" /><item><title>Revisiting Transformer-based Models for Long Document Classification — mentioned by bpiche</title><link>https://news.ycombinator.com/item?id=31057880</link><guid isPermaLink="false">urn:hackerpapers:mention:2204.06683:31057880</guid><pubDate>Sun, 17 Apr 2022 02:18:41 GMT</pubDate><description>&lt;p&gt;Your first suggestion seems like the way to go, I read a couple of papers this morning which seemed to confirm that it is a solid strategy. The first one claims that the Longformer architecture is tenable for truly long documents with some minor parameter optimization [0]. The Amazon/MSFT paper claims that just looking at the first part of the doc is superior to most other more complex solutions, like Longformer/Big Bird or hierarchical classification [1]. But here&amp;#x27;s what&amp;#x27;s really cool, they concluded that if you still use only 512 tokens, but you don&amp;#x27;t just look at the first ones, you look…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2204.06683/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
