arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.03780cs.CVcs.LG

DADA: Differentiable Automatic Data Augmentation

Wangxuan Institute of Computer Technology, Peking University(北京大学王选计算机研究所);Anyvision(Anyvision公司);Queens University of Belfast(贝尔法斯特女王大学);School of Informatics, The University of Edinburgh(爱丁堡大学信息学院)

Yonggang Li, Guosheng Hu, Yongtao Wang, Timothy Hospedales, Neil M. Robertson, Yongxin Yang

英文摘要:

Data augmentation (DA) techniques aim to increase data variability, and thus train deep networks with better generalisation. The pioneering AutoAugment automated the search for optimal DA policies with reinforcement learning. However, AutoAugment is extremely computationally expensive, limiting its wide applicability. Followup works such as Population Based Augmentation (PBA) and Fast AutoAugment improved efficiency, but their optimization speed remains a bottleneck. In this paper, we propose Differentiable Automatic Data Augmentation (DADA) which dramatically reduces the cost. DADA relaxes the discrete DA policy selection to a differentiable optimization problem via Gumbel-Softmax. In addition, we introduce an unbiased gradient estimator, RELAX, leading to an efficient and effective one-pass optimization strategy to learn an efficient and accurate DA policy. We conduct extensive experiments on CIFAR-10, CIFAR-100, SVHN, and ImageNet datasets. Furthermore, we demonstrate the value of Auto DA in pre-training for downstream detection problems. Results show our DADA is at least one order of magnitude faster than the state-of-the-art while achieving very comparable accuracy. The code is available at https://github.com/VDIGPKU/DADA.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑