Pith. sign in

REVIEW 1 cited by

HyperText: Endowing FastText with Hyperbolic Geometry

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 2010.16143 v3 pith:33AQ5AAI submitted 2020-10-30 cs.CL cs.LG

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

Natural language data exhibit tree-like hierarchical structures such as the hypernym-hyponym relations in WordNet. FastText, as the state-of-the-art text classifier based on shallow neural network in Euclidean space, may not model such hierarchies precisely with limited representation capacity. Considering that hyperbolic space is naturally suitable for modeling tree-like hierarchical data, we propose a new model named HyperText for efficient text classification by endowing FastText with hyperbolic geometry. Empirically, we show that HyperText outperforms FastText on a range of text classification tasks with much reduced parameters.

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. Full citation record

  1. Adversarial Attacks on Hyperbolic Networks

    cs.LG 2024-12 conditional novelty 5.0 of 10

    Hyperbolic versions of FGM and PGD attacks are proposed, and experiments show that Euclidean and hyperbolic ResNets have different, geometry-specific adversarial vulnerabilities.

Pith tools