Pith. sign in

REVIEW 1 cited by

HiNet: Hierarchical Classification with Neural Network

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 1705.11105 v2 pith:RBD4R7NN submitted 2017-05-31 cs.LG

classification cs.LG
keywords hierarchicallabelsflattenarchitecturemodelneuralonlytrain
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Traditionally, classifying large hierarchical labels with more than 10000 distinct traces can only be achieved with flatten labels. Although flatten labels is feasible, it misses the hierarchical information in the labels. Hierarchical models like HSVM by \cite{vural2004hierarchical} becomes impossible to train because of the sheer number of SVMs in the whole architecture. We developed a hierarchical architecture based on neural networks that is simple to train. Also, we derived an inference algorithm that can efficiently infer the MAP (maximum a posteriori) trace guaranteed by our theorems. Furthermore, the complexity of the model is only $O(n^2)$ compared to $O(n^h)$ in a flatten model, where $h$ is the height of the hierarchy.

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. Harnessing Superclasses for Learning from Hierarchical Databases

    cs.CV 2024-11 conditional novelty 6.0 of 10

    A balanced weighted hierarchical loss is introduced that is a proper scoring rule, and it is shown to reduce hierarchical distance without sacrificing standard accuracy in low-data image classification.

Pith tools