Forced to Learn: Discovering Disentangled Representations Without Exhaustive Labels
Alexey Romanov, Anna Rumshisky

TL;DR
This paper introduces two simple, model-agnostic loss components that enhance neural network representations for clustering tasks, significantly improving cluster quality without complex training or exhaustive labels.
Contribution
The authors propose novel loss functions that improve clustering quality in neural networks, applicable to various models without complex procedures or extensive labels.
Findings
Consistent improvement in clustering quality measured by Adjusted Mutual Information.
Outperforms previous methods on RNN and CNN models.
Applicable to arbitrary models and cost functions.
Abstract
Learning a better representation with neural networks is a challenging problem, which was tackled extensively from different prospectives in the past few years. In this work, we focus on learning a representation that could be used for a clustering task and introduce two novel loss components that substantially improve the quality of produced clusters, are simple to apply to an arbitrary model and cost function, and do not require a complicated training procedure. We evaluate them on two most common types of models, Recurrent Neural Networks and Convolutional Neural Networks, showing that the approach we propose consistently improves the quality of KMeans clustering in terms of Adjusted Mutual Information score and outperforms previously proposed methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Domain Adaptation and Few-Shot Learning · Adversarial Robustness in Machine Learning
