HiFi-KPI: A Dataset for Hierarchical KPI Extraction from Earnings Filings

• URL: http://arxiv.org/abs/2502.15411v2
• Date: Mon, 24 Feb 2025 14:45:27 GMT
• Title: HiFi-KPI: A Dataset for Hierarchical KPI Extraction from Earnings Filings
• Abstract summary: We introduce the Hierarchical Financial Key Performance Indicator (HiFi-KPI) dataset.<n>Our approach organizes a 218,126-label hierarchy using a taxonomy based grouping method.<n>We additionally release HiFi-KPI Lite, a manually curated subset with four expert-mapped labels.
• Score: 42.63642722062992
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The U.S. Securities and Exchange Commission (SEC) requires that public companies file financial reports tagging numbers with the machine readable inline eXtensible Business Reporting Language (iXBRL) standard. However, the highly complex and highly granular taxonomy defined by iXBRL limits label transferability across domains. In this paper, we introduce the Hierarchical Financial Key Performance Indicator (HiFi-KPI) dataset, designed to facilitate numerical KPI extraction at specified levels of granularity from unstructured financial text. Our approach organizes a 218,126-label hierarchy using a taxonomy based grouping method, investigating which taxonomy layer provides the most meaningful structure. HiFi-KPI comprises ~1.8M paragraphs and ~5M entities, each linked to a label in the iXBRL-specific calculation and presentation taxonomies. We provide baselines using encoder-based approaches and structured extraction using Large Language Models (LLMs). To simplify LLM inference and evaluation, we additionally release HiFi-KPI Lite, a manually curated subset with four expert-mapped labels. We publicly release all artifacts.

Related papers

• Building a Custom Taxonomy of AI Skills and Tasks from the Ground Up with Job Postings [2.371391648123934]
  We use two large-scale job postings corpora to investigate key design decisions for the inclusion (or exclusion) of data points for taxonomy construction.<n>We propose TaxonomyBuilder as a blueprint for our systematic study.
  arXiv  Detail & Related papers  (2026-05-20T11:01:49Z)
• A BERT-based Hierarchical Classification Model with Applications in Chinese Commodity Classification [12.186379198760733]
  We introduce a large-scale hierarchical dataset collected from the JD e-commerce platform (www.JD.com)<n>We also propose a novel hierarchical text classification approach based on the widely used Bidirectional Representations from Transformers (BERT)<n>Our HFT-BERT model demonstrates exceptional performance in categorizing longer short texts, such as books.
  arXiv  Detail & Related papers  (2025-08-13T16:10:47Z)
• FinTagging: An LLM-ready Benchmark for Extracting and Structuring Financial Information [18.75906880569719]
  We introduce FinTagging, the first full-scope, table-aware benchmark designed to evaluate the structured information extraction and semantic alignment capabilities of large language models (LLMs)<n>Unlike prior benchmarks that oversimplify tagging as flat multi-class classification and focus solely on narrative text, FinTagging decomposes the tagging problem into two subtasks: FinNI for financial entity extraction and FinCL for taxonomy-driven concept alignment.<n>It requires models to jointly extract facts and align them with the full 10k+ US- taxonomy across both unstructured text and structured tables, enabling realistic, fine-grained evaluation
  arXiv  Detail & Related papers  (2025-05-27T02:55:53Z)
• Taxonomy Inference for Tabular Data Using Large Language Models [31.121233193993906]
  This paper presents two methods for taxonomy inference for tables: (i) EmTT which embeds columns by fine-tuning with contrastive learning encoder-alone LLMs like BERT, and (ii) GeTT which generates table entity types and their hierarchy by iterative prompting using a decoder-alone LLM like GPT-4.
  arXiv  Detail & Related papers  (2025-03-25T16:26:05Z)
• SRFUND: A Multi-Granularity Hierarchical Structure Reconstruction Benchmark in Form Understanding [55.48936731641802]
  We present the SRFUND, a hierarchically structured multi-task form understanding benchmark. SRFUND provides refined annotations on top of the original FUNSD and XFUND datasets. The dataset includes eight languages including English, Chinese, Japanese, German, French, Spanish, Italian, and Portuguese.
  arXiv  Detail & Related papers  (2024-06-13T02:35:55Z)
• TnT-LLM: Text Mining at Scale with Large Language Models [24.731544646232962]
  Large Language Models (LLMs) automate the process of end-to-end label generation and assignment with minimal human effort. We show that TnT-LLM generates more accurate and relevant label when compared against state-of-the-art baselines. We also share our practical experiences and insights on the challenges and opportunities of using LLMs for large-scale text mining in real-world applications.
  arXiv  Detail & Related papers  (2024-03-18T18:45:28Z)
• Prompt Tuned Embedding Classification for Multi-Label Industry Sector Allocation [2.024620791810963]
  This study benchmarks the performance of Prompt Tuning and baselines for multi-label text classification. It is applied to classifying companies into an investment firm's proprietary industry taxonomy. We confirm that the model's performance is consistent across both well-known and less-known companies.
  arXiv  Detail & Related papers  (2023-09-21T13:45:32Z)
• Financial Numeric Extreme Labelling: A Dataset and Benchmarking for XBRL Tagging [23.01422165679548]
  The U.S. Securities and Exchange Commission (SEC) mandates all public companies to file periodic financial statements that should contain numerals with a particular label from a taxonomy. We formulate the task of formulate the task of a label to a particular numeral span in a sentence from an extremely large label set.
  arXiv  Detail & Related papers  (2023-06-06T14:41:30Z)
• End-to-End Learning to Index and Search in Large Output Spaces [95.16066833532396]
  Extreme multi-label classification (XMC) is a popular framework for solving real-world problems. In this paper, we propose a novel method which relaxes the tree-based index to a specialized weighted graph-based index. ELIAS achieves state-of-the-art performance on several large-scale extreme classification benchmarks with millions of labels.
  arXiv  Detail & Related papers  (2022-10-16T01:34:17Z)
• Seeded Hierarchical Clustering for Expert-Crafted Taxonomies [48.10324642720299]
  We propose HierSeed, a weakly supervised algorithm for fitting unlabeled corpora. It is both data and efficient. It outperforms both unsupervised and supervised baselines for the SHC task on three real-world datasets.
  arXiv  Detail & Related papers  (2022-05-23T19:58:06Z)
• DECAF: Deep Extreme Classification with Label Features [9.768907751312396]
  Extreme multi-label classification (XML) involves tagging a data point with its most relevant subset of labels from an extremely large label set. Leading XML algorithms scale to millions of labels, but they largely ignore label meta-data such as textual descriptions of the labels. This paper develops the DECAF algorithm that addresses these challenges by learning models enriched by label metadata.
  arXiv  Detail & Related papers  (2021-08-01T05:36:05Z)
• HTCInfoMax: A Global Model for Hierarchical Text Classification via Information Maximization [75.45291796263103]
  The current state-of-the-art model HiAGM for hierarchical text classification has two limitations. It correlates each text sample with all labels in the dataset which contains irrelevant information. We propose HTCInfoMax to address these issues by introducing information which includes two modules.
  arXiv  Detail & Related papers  (2021-04-12T06:04:20Z)
• An Empirical Study on Large-Scale Multi-Label Text Classification Including Few and Zero-Shot Labels [49.036212158261215]
  Large-scale Multi-label Text Classification (LMTC) has a wide range of Natural Language Processing (NLP) applications. Current state-of-the-art LMTC models employ Label-Wise Attention Networks (LWANs) We show that hierarchical methods based on Probabilistic Label Trees (PLTs) outperform LWANs. We propose a new state-of-the-art method which combines BERT with LWANs.
  arXiv  Detail & Related papers  (2020-10-04T18:55:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.