To be Continuous, or to be Discrete, Those are Bits of Questions
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 47 of its 77 references that are in the map. First posted on arXiv 12 Jun 2024.
Builds on
47 of 77 references.
References · 47
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2016Layer Normalizationcited by 5,579
- 2017Neural Discrete Representation Learningcited by 4,650
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
35 more
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2018Deep contextualized word representationscited by 2,285
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2019BioBERT: a pre-trained biomedical language representation model for biomedical text miningcited by 1,935
- 2019Generating Diverse High-Fidelity Images with VQ-VAE-2cited by 1,376
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
- 2018Subword Regularization: Improving Neural Network Translation Models with Multiple Subword Candidatescited by 632
- 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 225
- 2018Constituency Parsing with a Self-Attentive Encodercited by 196
- 2014A* Samplingcited by 150
- 2020Named Entity Recognition as Dependency Parsingcited by 150
- 2018Multilingual Constituency Parsing with Self-Attention and Pre-Trainingcited by 117
- 2014Neural Variational Inference and Learning in Belief Networkscited by 116
- 2017Structured Attention Networkscited by 95
- 2016Variational inference for Monte Carlo objectivescited by 83
- 2021Locate and Label: A Two-stage Identifier for Nested Named Entity Recognitioncited by 60
- 2017A Minimal Span-Based Neural Constituency Parsercited by 59
- 2020Fast and Accurate Neural CRF Constituency Parsingcited by 50
- 2019Head-Driven Phrase Structure Grammar Parsing on Penn Treebankcited by 43
- 2021A Sequence-to-Set Network for Nested Named Entity Recognitioncited by 40
- 2019Nested Named Entity Recognition via Second-best Sequence Learning and Decodingcited by 34
- 2017Learning Structured Text Representationscited by 24
- 2020Instance-Based Learning of Span Representations: A Case Study through Named Entity Recognitioncited by 23
- 2020Strongly Incremental Constituency Parsing with Graph Neural Networkscited by 23
- 2020Nested Named Entity Recognition with Partially-Observed TreeCRFscited by 23
- 2018What's Going On in Neural Constituency Parsers? An Analysiscited by 22
- 2021Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networkscited by 21
- 2020Improving Constituency Parsing with Span Attentioncited by 17
- 2022Nested Named Entity Recognition as Latent Lexicalized Constituency Parsingcited by 14
- 2018Backpropagating through Structured Argmax using a SPIGOTcited by 11
- 2016The Sum-Product Theorem: A Foundation for Learning Tractable Modelscited by 8
- 2021A Conditional Splitting Framework for Efficient Constituency Parsingcited by 7
- 2020Understanding the Mechanics of SPIGOT: Surrogate Gradients for Latent Structure Learningcited by 6
- 2021Instance-Based Neural Dependency Parsingcited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.
- 2026Dual Latent Memory for Visual Multi-agent Systemcited by 9
- 2024On Eliciting Syntax from Language Models via Hashingcited by 0
- 2026Dual Latent Memory for Visual Multi-agent System31 Jan 2026
- 2024On Eliciting Syntax from Language Models via Hashing5 Oct 2024