On the rate of convergence of a classifier based on a Transformer encoder

G\"ozde G\"ul Sahin; Iryna Gurevych; Michael Kohler

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2111.14574 v1 pith:2B5R6QW7 submitted 2021-11-29 math.ST cs.LGstat.TH

On the rate of convergence of a classifier based on a Transformer encoder

Iryna Gurevych , Michael Kohler , G\"ozde G\"ul Sahin This is my paper

classification math.ST cs.LGstat.TH

keywords classifiertransformerprobabilityanalyzedclassifiersconvergenceencodermisclassification

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

Pattern recognition based on a high-dimensional predictor is considered. A classifier is defined which is based on a Transformer encoder. The rate of convergence of the misclassification probability of the classifier towards the optimal misclassification probability is analyzed. It is shown that this classifier is able to circumvent the curse of dimensionality provided the aposteriori probability satisfies a suitable hierarchical composition model. Furthermore, the difference between Transformer classifiers analyzed theoretically in this paper and Transformer classifiers used nowadays in practice are illustrated by considering classification problems in natural language processing.

On the rate of convergence of a classifier based on a Transformer encoder

discussion (0)