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...

Full description

Bibliographic Details

Published in:	Transactions of the Association for Computational Linguistics Vol. 9; pp. 891 - 908
Main Authors:	Hahn, Michael, Jurafsky, Dan, Futrell, Richard
Format:	Journal Article
Language:	English
Published:	One Rogers Street, Cambridge, MA 02142-1209, USA MIT Press 18.08.2021 MIT Press Journals, The The MIT Press
Subjects:	Boolean functions Classification Classifiers Decoders Natural language processing Representations Sequences Subsets Task complexity Task performance
ISSN:	2307-387X, 2307-387X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!