paper-with-me

홈 › Papers

Reweighting Augmented Samples by Minimizing the Maximal Expected Loss

2021-03-16 · ICLR 2021 1 · Mingyang Yi, Lu Hou, Lifeng Shang, Xin Jiang, Qun Liu, Zhi-Ming Ma

Data augmentation is an effective technique to improve the generalization of deep neural networks. However, previous data augmentation methods usually treat the augmented samples equally without considering their individual impacts on the model. To address this, for the augmented samples from the same training example, we propose to assign different weights to them. We construct the maximal expected loss which is the supremum over any reweighted loss on augmented samples. Inspired by adversarial training, we minimize this maximal expected loss (MMEL) and obtain a simple and interpretable closed-form solution: more attention should be paid to augmented samples with large loss values (i.e., harder examples). Minimizing this maximal expected loss enables the model to perform well under any reweighting strategy. The proposed method can generally be applied on top of any data augmentation methods. Experiments are conducted on both natural language understanding tasks with token-level data augmentation, and image classification tasks with commonly-used image augmentation techniques like random crop and horizontal flip. Empirical results show that the proposed method improves the generalization performance of the model.

📄 PDF Abstract BibTeX arXiv:2103.08933

Code (1)

yookyungkho/mav pytorch

Tasks

Data AugmentationImage Augmentationimage-classificationImage ClassificationNatural Language Understanding

Similar Papers 제목 키워드 기반

Regularizing Deep Networks with Semantic Data Augmentation

2020-07-21 · Yulin Wang, Gao Huang, Shiji Song, Xuran Pan 외

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-inde…

Data AugmentationDiversity

Active Sample Selection and Correction Propagation on a Gradually-Augmented Graph

2015-06-01 · CVPR 2015 6 · Hang Su, Zhaozheng Yin, Takeo Kanade, Seungil Huh

When data have a complex manifold structure or the characteristics of data evolve over time, it is unrealistic to expect a graph-based semi-supervised learning method to achieve flawless classification given a small numb…

General Classification

Reducing and Exploiting Data Augmentation Noise through Meta Reweighting Contrastive Learning for Text Classification

2024-09-26 · Guanyi Mou, Yichuan Li, Kyumin Lee

Data augmentation has shown its effectiveness in resolving the data-hungry problem and improving model's generalization ability. However, the quality of augmented data can be varied, especially compared with the raw/orig…

Contrastive LearningData AugmentationMeta-Learningtext-classification+1

Reweighting samples under covariate shift using a Wasserstein distance criterion

2020-10-19 · Julien Reygner, Adrien Touboul

Considering two random variables with different laws to which we only have access through finite size iid samples, we address how to reweight the first sample so that its empirical distribution converges towards the true…

Uncertainty Quantification

Generalization Error Bounds for Noisy, Iterative Algorithms via Maximal Leakage

2023-02-28 · Ibrahim Issa, Amedeo Roberto Esposito, Michael Gastpar

We adopt an information-theoretic framework to analyze the generalization behavior of the class of iterative, noisy learning algorithms. This class is particularly suitable for study under information-theoretic metrics a…

Generalization Bounds