Sensitivity as a Complexity Measure for Sequence Classification Tasks

We introduce a theoretical framework for understanding and predicting the complexity of sequence classification tasks, using a novel extension of the theory of Boolean function sensitivity. The sensitivity of a function, given a distribution over input sequences, quantifies the number of disjoint su...

Celý popis

Podrobná bibliografia

Vydané v:	Transactions of the Association for Computational Linguistics Ročník 9; s. 891 - 908
Hlavní autori:	Hahn, Michael, Jurafsky, Dan, Futrell, Richard
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	One Rogers Street, Cambridge, MA 02142-1209, USA MIT Press 18.08.2021 MIT Press Journals, The The MIT Press
Predmet:	Boolean functions Classification Classifiers Decoders Natural language processing Representations Sequences Subsets Task complexity Task performance
ISSN:	2307-387X, 2307-387X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!