To be Continuous, or to be Discrete, Those are Bits of Questions

12 Jun 2024  ·  Yiran Wang, Masao Utiyama ·

Recently, binary representation has been proposed as a novel representation that lies between continuous and discrete representations. It exhibits considerable information-preserving capability when being used to replace continuous input vectors. In this paper, we investigate the feasibility of further introducing it to the output side, aiming to allow models to output binary labels instead. To preserve the structural information on the output side along with label information, we extend the previous contrastive hashing method as structured contrastive hashing. More specifically, we upgrade CKY from label-level to bit-level, define a new similarity function with span marginal probabilities, and introduce a novel contrastive loss function with a carefully designed instance selection strategy. Our model achieves competitive performance on various structured prediction tasks, and demonstrates that binary representation can be considered a novel representation that further bridges the gap between the continuous nature of deep learning and the discrete intrinsic property of natural languages.

PDF Abstract

Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Nested Named Entity Recognition ACE 2004 Hashing F1 87.93 # 9
Nested Named Entity Recognition ACE 2005 Hashing F1 85.90 # 10
Constituency Parsing CTB5 Hashing + Bert F1 score 92.33 # 4
Nested Named Entity Recognition GENIA Hashing F1 80.54 # 6
Constituency Parsing Penn Treebank Hashing + XLNet F1 score 96.43 # 1
Constituency Parsing Penn Treebank Hashing + Bert F1 score 96.03 # 7

Methods


No methods listed for this paper. Add relevant methods here