mlsanityData to 7 Oct 2026

Rotating spiders and reflecting dogs: a class conditional approach to learning data augmentation distributions

arXiv 2106.04009 ↗First posted 7 Jun 2021cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Building invariance to non-meaningful transformations is essential to building efficient and generalizable machine learning models. In practice, the most common way to learn invariance is through data augmentation. There has been recent interest in the development of methods that learn distributions on augmentation transformations from the training data itself. While such approaches are beneficial since they are responsive to the data, they ignore the fact that in many situations the range of transformations to which a model needs to be invariant changes depending on the particular class input belongs to. For example, if a model needs to be able to predict whether an image contains a starfish or a dog, we may want to apply random rotations to starfish images during training (since these do not have a preferred orientation), but we would not want to do this to images of dogs. In this work we introduce a method by which we can learn class conditional distributions on augmentation transformations. We give a number of examples where our methods learn different non-meaningful transformations depending on class and further show how our method can be used as a tool to probe the symmetries intrinsic to a potentially complex dataset.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 17 of its 23 references that are in the map. First posted on arXiv 7 Jun 2021.

Builds on

17 of 23 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  3. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  4. 2016Group Equivariant Convolutional Networkscited by 1,154
  5. 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
  6. 2019General E(2)-Equivariant Steerable CNNscited by 441
  7. 2016Harmonic Networks: Deep Translation and Rotation Equivariancecited by 293
  8. 2019Fast AutoAugmentcited by 243
  9. 2019Deep Scale-spaces: Equivariance Over Scalecited by 113
  10. 2019Scale-Equivariant Steerable Networkscited by 110
  11. 2016Rotation equivariant vector field networkscited by 98
  12. 2019Faster AutoAugment: Learning Augmentation Strategies using Backpropagationcited by 96
5 more
  1. 2017Oriented Response Networkscited by 67
  2. 2016TI-POOLING: transformation-invariant pooling for feature learning in Convolutional Neural Networkscited by 66
  3. 2020DADA: Differentiable Automatic Data Augmentationcited by 57
  4. 2020Learning Invariances in Neural Networkscited by 52
  5. 2018Learning Invariances using the Marginal Likelihoodcited by 51

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.