Pith. sign in

REVIEW 1 cited by

Language Models as Hierarchy Encoders

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

arxiv 2401.11374 v4 pith:N2GEKZXJ submitted 2024-01-21 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords embeddingencodershierarchyhitshyperboliclanguagebaselineshierarchies
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Interpreting hierarchical structures latent in language is a key limitation of current language models (LMs). While previous research has implicitly leveraged these hierarchies to enhance LMs, approaches for their explicit encoding are yet to be explored. To address this, we introduce a novel approach to re-train transformer encoder-based LMs as Hierarchy Transformer encoders (HiTs), harnessing the expansive nature of hyperbolic space. Our method situates the output embedding space of pre-trained LMs within a Poincar\'e ball with a curvature that adapts to the embedding dimension, followed by training on hyperbolic clustering and centripetal losses. These losses are designed to effectively cluster related entities (input as texts) and organise them hierarchically. We evaluate HiTs against pre-trained LMs, standard fine-tuned LMs, and several hyperbolic embedding baselines, focusing on their capabilities in simulating transitive inference, predicting subsumptions, and transferring knowledge across hierarchies. The results demonstrate that HiTs consistently outperform all baselines in these tasks, underscoring the effectiveness and transferability of our re-trained hierarchy encoders.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 2 citations worldwide. Full citation record

  1. Leveraging LLM Agents for Automated Optimization Modeling for SASP Problems: A Graph-RAG based Approach

    cs.AI 2025-01 reject novelty 4.0 of 10

    A multi-agent LLM system with graph-based retrieval scores higher than prompt-only baselines on ten SASP modeling tasks, though the evaluation may be biased because the library contains the answers.

Pith tools