SPARROW: Scalable Taxonomy Induction via Structure-Preserving Partitioning and Constraint-Guided Merging

• URL: http://arxiv.org/abs/2609.07307v1
• Date: Mon, 07 Sep 2026 10:23:09 GMT
• Title: SPARROW: Scalable Taxonomy Induction via Structure-Preserving Partitioning and Constraint-Guided Merging
• Abstract summary: Recent methods can induce directly from flat term lists, avoiding the need for corpora, but degrade sharply as concept sets scale up.<n>We propose SPARROW, a scalable taxonomy induction framework that combines structure-preserving spectral partitioning to retain hierarchical connectivity within each block.<n> Experiments on large-scale benchmarks show that SPARROW consistently achieves the strongest global structural quality across backbones.
• Score: 16.319023057139173
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Taxonomy induction aims to organize concept sets into coherent hierarchical structures. Recent LLM-based methods can induce taxonomies directly from flat term lists, avoiding the need for corpora, but degrade sharply as concept sets scale up. We argue that this degradation stems not only from context length limitations, but also from structural failures in hierarchical reasoning. To address this, we adopt a divide-and-merge paradigm that partitions concepts into smaller subsets, induces local taxonomies, and merges them into a global hierarchy. However, we identify two structural failure modes inherent to this paradigm: Structural Fragmentation, where partitioning weakens local hierarchical signals, and Parent Displacement, where locally plausible relations are misplaced in the global hierarchy. To address both, we propose SPARROW, a scalable taxonomy induction framework that combines structure-preserving spectral partitioning to retain hierarchical connectivity within each block, and constraint-guided incremental fusion that treats block-level relations as structural constraints rather than ground truth for global placement. Experiments on large-scale benchmarks show that SPARROW consistently achieves the strongest global structural quality across backbones. The code is available at https://github.com/rebeccazyr/SPARROW.

Related papers

• TaxCE : A Framework for Automated Taxonomy Construction and Evaluation at Scale [0.992650024444822]
  TaxCE is a fully automated framework for organizing unstructured feedback text into hierarchical taxonomy.<n>We introduce three corpus-grounded evaluation metrics, Exclusivity, Exhaustivity, and Granularity (EEG), and integrate them into a metrics-in-the-loop iterative refinement mechanism.
  arXiv  Detail & Related papers  (2026-08-31T11:25:25Z)
• Semi-Supervised Hyperbolic Hierarchical Clustering with Set-Level Structural Priors [6.266139801172993]
  Semi-supervised hierarchical clustering aims to learn a tree structure consistent with data patterns and user-provided supervision.<n>We propose a semi-supervised hyperbolic hierarchical clustering method with set-level structural priors.<n>Experiments show that the proposed method consistently improves label consistency over representative hierarchical clustering baselines.
  arXiv  Detail & Related papers  (2026-06-01T01:14:00Z)
• Online Continual Learning with Dynamic Label Hierarchies [72.33335166136045]
  We introduce a new problem setting, DHOCL, where severity evolve across granularities and each sample provides supervision at a single hierarchical level.<n>In this setting, we find two fundamental issues: (i) partial supervision under mixed granularities provides only point-wise signals over an evolving path-wise hierarchy, which constrains plasticity and undermines cross-level semantic consistency.<n>We propose HALO, which adaptively combines complementary classification heads, regularized by organized learnable hierarchical prototypes, enabling rapid adaptation, hierarchical consistency, and structured knowledge consolidation as the taxonomy evolves.
  arXiv  Detail & Related papers  (2026-05-12T08:20:23Z)
• SC-Taxo: Hierarchical Taxonomy Generation under Semantic Consistency Constraints using Large Language Models [24.295783768613344]
  A high-quality scientific taxonomy offers a structured and hierarchical representation of a research field.<n>Existing taxonomy generation approaches often suffer from structural inconsistencies and semantic misalignment across hierarchical levels.
  arXiv  Detail & Related papers  (2026-05-01T12:42:44Z)
• ASTRA: Adaptive Semantic Tree Reasoning Architecture for Complex Table Question Answering [55.55968342644846]
  Table serialization remains a critical bottleneck for Large Language Models (LLMs) in complex table question answering.<n>Existing serialization methods fail to capture explicit hierarchies and lack schema flexibility.<n>We propose ASTRA (Adaptive Semantic Tree Reasoning Architecture) including two main modules, AdaSTR and DuTR.<n> Experiments on complex table benchmarks demonstrate that our method achieves state-of-the-art (SOTA) performance.
  arXiv  Detail & Related papers  (2026-04-10T06:09:41Z)
• Orthogonal Hierarchical Decomposition for Structure-Aware Table Understanding with Large Language Models [13.58784346599112]
  We propose an Orthogonal Hierarchical Decomposition (OHD) framework that constructs structure-preserving input representations of complex tables for LLMs.<n>Building on this representation, we design a dual-pathway association protocol to symmetrically reconstruct semantic lineage of each cell.<n>We evaluate OHD framework on two complex table question answering benchmarks, AITQA and HiTab.
  arXiv  Detail & Related papers  (2026-02-02T11:22:43Z)
• Improving LLM Reasoning with Homophily-aware Structural and Semantic Text-Attributed Graph Compression [55.51959317490934]
  Large language models (LLMs) have demonstrated promising capabilities in Text-Attributed Graph (TAG) understanding.<n>We argue that graphs inherently contain rich structural and semantic information, and that their effective exploitation can unlock potential gains in LLMs reasoning performance.<n>We propose Homophily-aware Structural and Semantic Compression for LLMs (HS2C), a framework centered on exploiting graph homophily.
  arXiv  Detail & Related papers  (2026-01-13T03:35:18Z)
• 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)
• Global and Local Hierarchy-aware Contrastive Framework for Implicit Discourse Relation Recognition [8.143877598684528]
  implicit discourse relation recognition (IDRR) is a challenging task in discourse analysis. Recent methods tend to integrate the whole hierarchical information of senses into discourse relation representations. We propose a novel GlObal and Local Hierarchy-aware Contrastive Framework (GOLF), to model two kinds of hierarchies.
  arXiv  Detail & Related papers  (2022-11-25T03:19:03Z)
• Provable Hierarchy-Based Meta-Reinforcement Learning [50.17896588738377]
  We analyze HRL in the meta-RL setting, where learner learns latent hierarchical structure during meta-training for use in a downstream task. We provide "diversity conditions" which, together with a tractable optimism-based algorithm, guarantee sample-efficient recovery of this natural hierarchy. Our bounds incorporate common notions in HRL literature such as temporal and state/action abstractions, suggesting that our setting and analysis capture important features of HRL in practice.
  arXiv  Detail & Related papers  (2021-10-18T17:56:02Z)
• Unveiling the Potential of Structure-Preserving for Weakly Supervised Object Localization [71.79436685992128]
  We propose a two-stage approach, termed structure-preserving activation (SPA), towards fully leveraging the structure information incorporated in convolutional features for WSOL. In the first stage, a restricted activation module (RAM) is designed to alleviate the structure-missing issue caused by the classification network. In the second stage, we propose a post-process approach, termed self-correlation map generating (SCG) module to obtain structure-preserving localization maps.
  arXiv  Detail & Related papers  (2021-03-08T03:04:14Z)

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.