DNA: Dynamic Network Augmentation
Scott Mahan, Tim Doster, Henry Kvinge

TL;DR
This paper introduces Dynamic Network Augmentation (DNA), a method that learns input-dependent data augmentation policies to improve model robustness to geometric transformations, surpassing static augmentation approaches.
Contribution
DNA enables learning input-conditional augmentation policies via a neural network, allowing dynamic and input-specific data augmentation during training.
Findings
DNA outperforms static augmentation methods on transformed datasets.
The model learns diverse augmentation policies conditioned on input features.
Dynamic policies improve robustness to geometric transformations.
Abstract
In many classification problems, we want a classifier that is robust to a range of non-semantic transformations. For example, a human can identify a dog in a picture regardless of the orientation and pose in which it appears. There is substantial evidence that this kind of invariance can significantly improve the accuracy and generalization of machine learning models. A common technique to teach a model geometric invariances is to augment training data with transformed inputs. However, which invariances are desired for a given classification task is not always known. Determining an effective data augmentation policy can require domain expertise or extensive data pre-processing. Recent efforts like AutoAugment optimize over a parameterized search space of data augmentation policies to automate the augmentation process. While AutoAugment and similar methods achieve state-of-the-art…
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
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Domain Adaptation and Few-Shot Learning
