Know Yourself and Know Your Neighbour: A Syntactically Informed Self-Supervised Compositional Sentence Representation Learning Framework using a Recursive Hypernetwork
cs.CL, cs.LG
Submitted: 2026-10-12
Updated: 2026-10-12
Journal ref: Published in Transactions on Machine Learning Research (TMLR), 2025
Code: https://github.com/vasudev2020/codi
License: http://creativecommons.org/licenses/by/4.0/
The gist: Sentence representation learning is still an open challenge in Natural Language Processing.
Terminology
Abstract
Sentence representation learning is still an open challenge in Natural Language Processing. In this work, we propose a new self-supervised framework for learning sentence representations, using a special type of neural network called a recursive hypernetwork. Our proposed model composes the representation of a sentence from representations of words by applying a recursive composition through the parse tree. We maintain a separate syntactic and semantic representation, and the semantic composition is guided by the information from the syntactic representation. To train this model, we introduce a novel set of six self-supervised tasks. By analysing the performance on 7 probing tasks, we validate that the generated sentence representation encodes richer linguistic information than both averaging baselines and state-of-the-art alternatives. Furthermore, we assess the impact of the six proposed self-supervised training tasks through ablation studies. We also demonstrate that the representations generated by our model are stable for sentences of varying length and that the semantic composition operators adapt to different syntactic categories.
Sources
- Layer Normalization
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
- Adam: A Method for Stochastic Optimization
- RoBERTa: A Robustly Optimized BERT Pretraining Approach
- Jointly Learning Sentence Embeddings and Syntax with Unsupervised Tree-LSTMs
- HUBERT Untangles BERT to Improve Transfer across NLP Tasks
- All-but-the-Top: Simple and Effective Postprocessing for Word Representations
- Improving Natural Language Inference with a Pretrained Parser
- LLaMA: Open and Efficient Foundation Language Models
- Towards Universal Paraphrastic Sentence Embeddings
- Long Short-Term Memory Over Tree Structures
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering