Text Classification and Clustering with Annealing Soft Nearest Neighbor Loss
Not on the map. Why?
Abstract (arXiv)
We define disentanglement as how far class-different data points from each other are, relative to the distances among class-similar data points. When maximizing disentanglement during representation learning, we obtain a transformed feature representation where the class memberships of the data points are preserved. If the class memberships of the data points are preserved, we would have a feature representation space in which a nearest neighbour classifier or a clustering algorithm would perform well. We take advantage of this method to learn better natural language representation, and employ it on text classification and text clustering tasks. Through disentanglement, we obtain text representations with better-defined clusters and improve text classification performance. Our approach had a test classification accuracy of as high as 90.11% and test clustering accuracy of 88% on the AG News dataset, outperforming our baseline models -- without any other training tricks or regularization.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 42 references that are in the map. First posted on arXiv 23 Jul 2021.
Builds on
11 of 42 references.
References · 11
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2018Deep contextualized word representationscited by 2,290
- 2017Supervised Learning of Universal Sentence Representations from Natural Language Inference Datacited by 432
- 2017Advances in Pre-Training Distributed Word Representationscited by 207
- 2015Adding Gradient Noise Improves Learning for Very Deep Networkscited by 145
- 2019Analyzing and Improving Representations with the Soft Nearest Neighbor Losscited by 95
- 2019No Training Required: Exploring Random Encoders for Sentence Classificationcited by 32
- 2020Improving k-Means Clustering Performance with Disentangled Internal Representationscited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025SDEC: Semantic Deep Embedded Clusteringcited by 0
- 2025SDEC: Semantic Deep Embedded Clustering18 Aug 2025