REVIEW 2 cited by
Learning Discrete Representations via Information Maximizing Self-Augmented Training
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Learning discrete representations of data is a central machine learning task because of the compactness of the representations and ease of interpretation. The task includes clustering and hash learning as special cases. Deep neural networks are promising to be used because they can model the non-linearity of data and scale to large datasets. However, their model complexity is huge, and therefore, we need to carefully regularize the networks in order to learn useful representations that exhibit intended invariance for applications of interest. To this end, we propose a method called Information Maximizing Self-Augmented Training (IMSAT). In IMSAT, we use data augmentation to impose the invariance on discrete representations. More specifically, we encourage the predicted representations of augmented data points to be close to those of the original data points in an end-to-end fashion. At the same time, we maximize the information-theoretic dependency between data and their predicted discrete representations. Extensive experiments on benchmark datasets show that IMSAT produces state-of-the-art results for both clustering and unsupervised hash learning.
Forward citations
Cited by 2 Pith papers
-
Identifying Signatures of Image Phenotypes to Track Treatment Response in Liver Disease
An unsupervised deep-clustering vocabulary of liver MRI patches separated NASH treatment groups better than fat fraction and ALT and predicted biopsy grades, with replication in a second cohort.
-
Deep Kernel Learning for Clustering
KNet jointly optimizes a deep kernel and its spectral embedding through an HSIC objective, yielding strong clustering accuracy on non-convex and real datasets and allowing out-of-sample clustering.
Discussion (0). Continue with ORCID to comment.