REVIEW 3 cited by
DocBERT: BERT for Document Classification
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present, to our knowledge, the first application of BERT to document classification. A few characteristics of the task might lead one to think that BERT is not the most appropriate model: syntactic structures matter less for content categories, documents can often be longer than typical BERT input, and documents often have multiple labels. Nevertheless, we show that a straightforward classification model using BERT is able to achieve the state of the art across four popular datasets. To address the computational expense associated with BERT inference, we distill knowledge from BERT-large to small bidirectional LSTMs, reaching BERT-base parity on multiple datasets using 30x fewer parameters. The primary contribution of our paper is improved baselines that can provide the foundation for future work.
Forward citations
Cited by 3 Pith papers
-
Semimage: HSV-Based Semantic Image Encoding for Disentangled Text Representation
SemImage encodes each document as a 2D HSV image—hue for topic, saturation for sentiment, bright rows for topic shifts—and a ResNet classifies it, reaching near-BERT accuracy.
-
Label-semantics Aware Generative Approach for Domain-Agnostic Multilabel Classification
LAGAMC turns multi-label classification into generating label descriptions and matching them back, with large F1 gains on five datasets.
-
DocHRL: A Hierarchical Reinforcement Learning Framework for Cost-Optimised Document Classification
A hierarchical RL router selects per-document pipelines of vision, OCR, LLM, and human tools, reporting 0.973 macro F1 and 2.74 average cost on RVL-CDIP.
Discussion (0). Sign in to comment.