|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM320385728 |
| 003 |
DE-627 |
| 005 |
20231225173447.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2022 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2021.3052951
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1067.xml
|
| 035 |
|
|
|a (DE-627)NLM320385728
|
| 035 |
|
|
|a (NLM)33476265
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Wang, Yulin
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Regularizing Deep Networks With Semantic Data Augmentation
|
| 264 |
|
1 |
|c 2022
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Revised 07.06.2022
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Data augmentation is widely known as a simple yet surprisingly effective technique for regularizing deep networks. Conventional data augmentation schemes, e.g., flipping, translation or rotation, are low-level, data-independent and class-agnostic operations, leading to limited diversity for augmented samples. To this end, we propose a novel semantic data augmentation algorithm to complement traditional approaches. The proposed method is inspired by the intriguing property that deep networks are effective in learning linearized features, i.e., certain directions in the deep feature space correspond to meaningful semantic transformations, e.g., changing the background or view angle of an object. Based on this observation, translating training samples along many such directions in the feature space can effectively augment the dataset for more diversity. To implement this idea, we first introduce a sampling based method to obtain semantically meaningful directions efficiently. Then, an upper bound of the expected cross-entropy (CE) loss on the augmented training set is derived by assuming the number of augmented samples goes to infinity, yielding a highly efficient algorithm. In fact, we show that the proposed implicit semantic data augmentation (ISDA) algorithm amounts to minimizing a novel robust CE loss, which adds minimal extra computational cost to a normal training procedure. In addition to supervised learning, ISDA can be applied to semi-supervised learning tasks under the consistency regularization framework, where ISDA amounts to minimizing the upper bound of the expected KL-divergence between the augmented features and the original features. Although being simple, ISDA consistently improves the generalization performance of popular deep models (e.g., ResNets and DenseNets) on a variety of datasets, i.e., CIFAR-10, CIFAR-100, SVHN, ImageNet, and Cityscapes. Code for reproducing our results is available at https://github.com/blackfeather-wang/ISDA-for-Deep-Networks
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Huang, Gao
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Song, Shiji
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Pan, Xuran
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Xia, Yitong
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wu, Cheng
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 44(2022), 7 vom: 21. Juli, Seite 3733-3748
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:44
|g year:2022
|g number:7
|g day:21
|g month:07
|g pages:3733-3748
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2021.3052951
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 44
|j 2022
|e 7
|b 21
|c 07
|h 3733-3748
|