mlsanityData to 14 Oct 2026

ANLS* -- A Universal Document Processing Metric for Generative Large Language Models

arXiv 2402.03848 ↗First posted 6 Feb 2024cs.CL cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

Traditionally, discriminative models have been the predominant choice for tasks like document classification and information extraction. These models make predictions that fall into a limited number of predefined classes, facilitating a binary true or false evaluation and enabling the direct calculation of metrics such as the F1 score. However, recent advancements in generative large language models (GLLMs) have prompted a shift in the field due to their enhanced zero-shot capabilities, which eliminate the need for a downstream dataset and computationally expensive fine-tuning. However, evaluating GLLMs presents a challenge as the binary true or false evaluation used for discriminative models is not applicable to the predictions made by GLLMs. This paper introduces a new metric for generative models called ANLS* for evaluating a wide variety of tasks, including information extraction and classification tasks. The ANLS* metric extends existing ANLS metrics as a drop-in-replacement and is still compatible with previously reported ANLS scores. An evaluation of 7 different datasets, and more than 20 different GLLMs together with 3 different prompting methods using the ANLS* metric is also provided, demonstrating the importance of the proposed metric. We also benchmark a novel approach to generate prompts for documents, called SFT, against other prompting techniques such as LATIN. In almost all cases, SFT outperforms other techniques and improves the state-of-the-art, sometimes by as much as 10 percentage points. Sources are available at https://github.com/deepopinion/anlsstarmetric

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 6 Feb 2024.

Builds on

22 of 30 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2023GPT-4 Technical Reportcited by 18,396
  3. 2020Scaling Laws for Neural Language Modelscited by 6,586
  4. 2014CIDEr: Consensus-based Image Description Evaluationcited by 2,046
  5. 2020DocVQA: A Dataset for VQA on Document Imagescited by 1,317
  6. 2023Just Ask for Calibration: Strategies for Eliciting Calibrated Confidence Scores from Language Models Fine-Tuned with Human Feedbackcited by 812
  7. 2019LayoutLM: Pre-training of Text and Layout for Document Image Understandingcited by 553
  8. 2022LayoutLMv3: Pre-training for Document AI with Unified Text and Image Maskingcited by 485
  9. 2020LayoutLMv2: Multi-modal Pre-training for Visually-Rich Document Understandingcited by 408
  10. 2021OCR-free Document Understanding Transformercited by 407
  11. 2019Scene Text Visual Question Answeringcited by 331
  12. 2021ICDAR2019 Competition on Scanned Receipt OCR and Information Extractioncited by 256
10 more
  1. 2023mPLUG-DocOwl: Modularized Multimodal Large Language Model for Document Understandingcited by 168
  2. 2023Document Understanding Dataset and Evaluation (DUDE)cited by 135
  3. 2023DocLLM: A layout-aware generative language model for multimodal document understandingcited by 116
  4. 2022Hierarchical multimodal transformers for Multi-Page DocVQAcited by 105
  5. 2023DocILE Benchmark for Document Information Localization and Extractioncited by 58
  6. 2021Document Collection Visual Question Answeringcited by 45
  7. 2022VRDU: A Benchmark for Visually-rich Document Understandingcited by 35
  8. 2023Layout and Task Aware Instruction Prompt for Zero-shot Document Image Question Answeringcited by 24
  9. 2021Greedy-layer Pruning: Speeding up Transformer Models for Natural Language Processingcited by 11
  10. 2022Improving the Trainability of Deep Neural Networks through Layerwise Batch-Entropy Regularizationcited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 3.

10 papers.