Papers
Topics
Authors
Recent
Search
2000 character limit reached

Distortion-Disentangled Contrastive Learning

Published 9 Mar 2023 in cs.CV and cs.AI | (2303.05066v3)

Abstract: Self-supervised learning is well known for its remarkable performance in representation learning and various downstream computer vision tasks. Recently, Positive-pair-Only Contrastive Learning (POCL) has achieved reliable performance without the need to construct positive-negative training sets. It reduces memory requirements by lessening the dependency on the batch size. The POCL method typically uses a single loss function to extract the distortion invariant representation (DIR) which describes the proximity of positive-pair representations affected by different distortions. This loss function implicitly enables the model to filter out or ignore the distortion variant representation (DVR) affected by different distortions. However, existing POCL methods do not explicitly enforce the disentanglement and exploitation of the actually valuable DVR. In addition, these POCL methods have been observed to be sensitive to augmentation strategies. To address these limitations, we propose a novel POCL framework named Distortion-Disentangled Contrastive Learning (DDCL) and a Distortion-Disentangled Loss (DDL). Our approach is the first to explicitly disentangle and exploit the DVR inside the model and feature stream to improve the overall representation utilization efficiency, robustness and representation ability. Experiments carried out demonstrate the superiority of our framework to Barlow Twins and Simsiam in terms of convergence, representation quality, and robustness on several benchmark datasets.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (56)
  1. Can we gain more from orthogonality regularizations in training deep networks?, volume 31, pages 4261–4271. 2018.
  2. Vicreg: Variance-invariance-covariance regularization for self-supervised learning. Le Centre pour la Communication Scientifique Directe - HAL - Diderot, Apr 2022.
  3. Representation learning: A review and new perspectives. IEEE transactions on pattern analysis and machine intelligence, 35(8):1798–1828, 2013.
  4. Food-101 – mining discriminative components with random forests. In European Conference on Computer Vision, 2014.
  5. Signature verification using a" siamese" time delay neural network. Advances in neural information processing systems, 6, 1993.
  6. Learning disentangled semantic representation for domain adaptation. In IJCAI: proceedings of the conference, volume 2019, page 2060. NIH Public Access, 2019.
  7. Unsupervised learning of visual features by contrasting cluster assignments. Advances in neural information processing systems, 33:9912–9924, 2020.
  8. A simple framework for contrastive learning of visual representations. In International conference on machine learning, pages 1597–1607. PMLR, 2020.
  9. Big self-supervised models are strong semi-supervised learners. Advances in neural information processing systems, 33:22243–22255, 2020.
  10. Infogan: Interpretable representation learning by information maximizing generative adversarial nets. 2016.
  11. Improved baselines with momentum contrastive learning. arXiv preprint arXiv:2003.04297, 2020.
  12. Exploring simple siamese representation learning. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 15750–15758, 2021.
  13. An empirical study of training self-supervised vision transformers. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 9640–9649, 2021.
  14. An analysis of single-layer networks in unsupervised feature learning. In Proceedings of the fourteenth international conference on artificial intelligence and statistics, pages 215–223. JMLR Workshop and Conference Proceedings, 2011.
  15. Equivariant contrastive learning. arXiv preprint arXiv:2111.00899, 2021.
  16. Imagenet: A large-scale hierarchical image database. In 2009 IEEE Conference on Computer Vision and Pattern Recognition, Jun 2009.
  17. Equimod: An equivariance module to improve self-supervised learning. Nov 2022.
  18. Theory and evaluation metrics for learning disentangled representations. 2020.
  19. With a little help from my friends: Nearest-neighbor contrastive learning of visual representations. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 9588–9597, 2021.
  20. Zero-shot synthesis with group-supervised learning. arXiv preprint arXiv:2009.06586, 2020.
  21. Bootstrap your own latent-a new approach to self-supervised learning. Advances in neural information processing systems, 33:21271–21284, 2020.
  22. Noise-contrastive estimation: A new estimation principle for unnormalized statistical models. In Proceedings of the thirteenth international conference on artificial intelligence and statistics, pages 297–304. JMLR Workshop and Conference Proceedings, 2010.
  23. Masked autoencoders are scalable vision learners. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 16000–16009, 2022.
  24. Momentum contrast for unsupervised visual representation learning. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 9729–9738, 2020.
  25. On the neural tangent kernel of deep networks with orthogonal initialization. arXiv preprint arXiv:2004.05867, 2020.
  26. Variational interaction information maximization for cross-domain disentanglement. Advances in Neural Information Processing Systems, 33:22479–22491, 2020.
  27. Learning multiple layers of features from tiny images. 2009.
  28. OLE: Orthogonal Low-rank Embedding, A Plug and Play Geometric Loss for Deep Learning, volume 2, page 6. IEEE, 6 2018.
  29. Interpretable generative adversarial networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, pages 1280–1288, 2022.
  30. Orthogonal deep neural networks. IEEE transactions on pattern analysis and machine intelligence, 43(4):1352–1368, 2019.
  31. Twin contrastive learning for online clustering. International Journal of Computer Vision, 130(9):2205–2221, 2022.
  32. Deep hyperspherical learning, pages 3953–3963. Number 2. 2017.
  33. On the fairness of disentangled representations. Advances in neural information processing systems, 32, 2019.
  34. Challenging common assumptions in the unsupervised learning of disentangled representations. In international conference on machine learning, pages 4114–4124. PMLR, 2019.
  35. A commentary on the unsupervised learning of disentangled representations. Proceedings of the AAAI Conference on Artificial Intelligence, 34(09):13681–13684, 4 2020.
  36. Automated flower classification over a large number of classes. 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing, pages 722–729, 2008.
  37. Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748, 2018.
  38. Orthogonal projection loss. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pages 12333–12343, 2021.
  39. Fairness by learning orthogonal disentangled representations. In Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part XXIX 16, pages 746–761. Springer, 2020.
  40. Are disentangled representations helpful for abstract visual reasoning? 2019.
  41. SVDNet for Pedestrian Retrieval, pages 3800–3808. Number 2. IEEE, 10 2017.
  42. Lightly. GitHub. Note: https://github.com/lightly-ai/lightly, 2020.
  43. Robustly disentangled causal mechanisms: Validating deep representations for interventional robustness. 2019.
  44. Relative contrastive loss for unsupervised representation learning. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXVII, pages 1–18. Springer, 2022.
  45. Disentangled Representation Learning GAN for Pose-Invariant Face Recognition. IEEE, 7 2017.
  46. Orthogonal Convolutional Neural Networks, volume 2020. IEEE, 6 2020.
  47. Orthogonal convolutional neural networks. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 11505–11515, 2020.
  48. Self-supervised learning disentangled group representation as feature. Advances in Neural Information Processing Systems, 34:18225–18240, 2021.
  49. Orthogonal deep features decomposition for age-invariant face recognition. In Proceedings of the European conference on computer vision (ECCV), pages 738–753, 2018.
  50. Caltech-UCSD Birds 200. Technical Report CNS-TR-2010-001, California Institute of Technology, 2010.
  51. Unsupervised feature learning via non-parametric instance discrimination. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 3733–3742, 2018.
  52. What should not be contrastive in contrastive learning. International Conference on Learning Representations, May 2021.
  53. Unsupervised embedding learning via invariant and spreading instance feature. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6210–6219, 2019.
  54. Decoupled contrastive learning. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXVI, pages 668–684. Springer, 2022.
  55. Barlow twins: Self-supervised learning via redundancy reduction. In International Conference on Machine Learning, pages 12310–12320. PMLR, 2021.
  56. Decoupled adversarial contrastive learning for self-supervised adversarial robustness. In Computer Vision–ECCV 2022: 17th European Conference, Tel Aviv, Israel, October 23–27, 2022, Proceedings, Part XXX, pages 725–742. Springer, 2022.
Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.