mlsanityData to 7 Oct 2026

Learning Discrete Representations via Information Maximizing Self-Augmented Training

arXiv 1702.08720 ↗First posted 28 Feb 2017stat.ML cs.LGcited by 149

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 149 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2019: 1; 2020: 0; 2021: 37; 2022: 38; 2023: 28; 2024: 21; 2025: 16; 2026: 8.

149 papers.

Sort:

By area:

  1. 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 982
  2. 2023A Comprehensive Survey on Test-Time Adaptation under Distribution Shiftscited by 353
  3. 2021SubTab: Subsetting Features of Tabular Data for Self-Supervised Representation Learningcited by 101
  4. 2022Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptationcited by 93
  5. 2021TVT: Transferable Vision Transformer for Unsupervised Domain Adaptationcited by 81
  6. 2022Deep Clustering: A Comprehensive Surveycited by 78
  7. 2022Improving Test-Time Adaptation via Shift-agnostic Weight Regularization and Nearest Source Prototypescited by 67
  8. 2021Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelationcited by 65
  9. 2022Twin Contrastive Learning for Online Clusteringcited by 60
  10. 2022The Hidden Uniform Cluster Prior in Self-Supervised Learningcited by 57
  11. 2024ReconBoost: Boosting Can Achieve Modality Reconcilementcited by 56
  12. 2022Semi-Supervised and Unsupervised Deep Visual Learning: A Surveycited by 52
38 more
  1. 2021DINE: Domain Adaptation from Single and Multiple Black-box Predictorscited by 51
  2. 2021Unsupervised Layered Image Decomposition into Object Prototypescited by 50
  3. 2021MiCE: Mixture of Contrastive Experts for Unsupervised Image Clusteringcited by 42
  4. 2021Consistency Regularization for Cross-Lingual Fine-Tuningcited by 41
  5. 2022Parametric Information Maximization for Generalized Category Discoverycited by 39
  6. 2021You Never Cluster Alonecited by 38
  7. 2023Variational Positive-incentive Noise: How Noise Benefits Modelscited by 38
  8. 2023Image Clustering with External Guidancecited by 36
  9. 2024Domain-Agnostic Mutual Prompting for Unsupervised Domain Adaptationcited by 32
  10. 2021Transformer-Based Source-Free Domain Adaptationcited by 30
  11. 2021Multi-Facet Clustering Variational Autoencoderscited by 28
  12. 2023RPEFlow: Multimodal Fusion of RGB-PointCloud-Event for Joint Optical Flow and Scene Flow Estimationcited by 26
  13. 2021AVA-AVD: Audio-Visual Speaker Diarization in the Wildcited by 24
  14. 2023Advancements in Point Cloud Data Augmentation for Deep Learning: A Surveycited by 24
  15. 2023ClusT3: Information Invariant Test-Time Trainingcited by 21
  16. 2021Pareto Domain Adaptationcited by 20
  17. 2022A Differential Entropy Estimator for Training Neural Networkscited by 20
  18. 2025ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discoverycited by 19
  19. 2022Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metriccited by 17
  20. 2022On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptationcited by 16
  21. 2022SCALE: Online Self-Supervised Lifelong Learning without Prior Knowledgecited by 16
  22. 2021On-target Adaptationcited by 15
  23. 2023Hyperbolic Contrastive Learningcited by 15
  24. 2023Incomplete Contrastive Multi-View Clustering with High-Confidence Guidingcited by 15
  25. 2024Bring Event into RGB and LiDAR: Hierarchical Visual-Motion Fusion for Scene Flowcited by 15
  26. 2021A Framework for Deep Constrained Clusteringcited by 14
  27. 2021Boosting Semi-supervised Image Segmentation with Global and Local Mutual Information Regularizationcited by 14
  28. 2021Unsupervised Image Segmentation by Mutual Information Maximization and Adversarial Regularizationcited by 13
  29. 2024Enhancing Information Maximization with Distance-Aware Contrastive Learning for Source-Free Cross-Domain Few-Shot Learningcited by 13
  30. 2021M2IOSR: Maximal Mutual Information Open Set Recognitioncited by 12
  31. 2021Self-Supervised Learning by Estimating Twin Class Distributionscited by 12
  32. 2021Information Maximization Clustering via Multi-View Self-Labellingcited by 10
  33. 2021Deep Fair Discriminative Clusteringcited by 10
  34. 2022Active Source Free Domain Adaptationcited by 10
  35. 2021Doubly Contrastive Deep Clusteringcited by 9
  36. 2024A Survey on Deep Clustering: From the Prior Perspectivecited by 9
  37. 2022Measuring the Interpretability of Unsupervised Representations via Quantized Reverse Probingcited by 8
  38. 2024Learn from the Learnt: Source-Free Active Domain Adaptation via Contrastive Sampling and Visual Persistencecited by 8

50 most cited of 149 All 149 (JSON)