Text Classification and Clustering with Annealing Soft Nearest Neighbor Loss
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationClusteringDisentanglementRepresentation Learningtext-classificationText ClassificationText ClusteringSimilar Papers 제목 키워드 기반
Improving k-Means Clustering Performance with Disentangled Internal Representations
Deep clustering algorithms combine representation learning and clustering by jointly optimizing a clustering loss and a non-clustering loss. In such methods, a deep neural network is used for representation learning toge…
ClusteringDeep ClusteringImage ClassificationImage Clustering+1Soft-MSM: Differentiable Context-Aware Elastic Alignment for Time Series
Elastic distances like dynamic time warping (DTW) are central to time series machine learning because they compare sequences under local temporal misalignment. Soft-DTW is an adaptation of DTW that can be used as a gradi…
Quantum Annealing for Clustering
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in prac…
ClusteringSample Efficient Graph-Based Optimization with Noisy Observations
We study sample complexity of optimizing "hill-climbing friendly" functions defined on a graph under noisy observations. We define a notion of convexity, and we show that a variant of best-arm identification can find a n…
Re-RankingAtom Search Optimization with Simulated Annealing -- a Hybrid Metaheuristic Approach for Feature Selection
'Hybrid meta-heuristics' is one of the most interesting recent trends in the field of optimization and feature selection (FS). In this paper, we have proposed a binary variant of Atom Search Optimization (ASO) and its hy…
Emotion RecognitionFacial Emotion Recognitionfeature selectionHandwritten Digit Recognition