paper-with-me

홈 › Papers

Asymptotic Midpoint Mixup for Margin Balancing and Moderate Broadening

2024-01-26 · Hoyong Kim, Semi Lee, Kangil Kim

In the feature space, the collapse between features invokes critical problems in representation learning by remaining the features undistinguished. Interpolation-based augmentation methods such as mixup have shown their effectiveness in relieving the collapse problem between different classes, called inter-class collapse. However, intra-class collapse raised in coarse-to-fine transfer learning has not been discussed in the augmentation approach. To address them, we propose a better feature augmentation method, asymptotic midpoint mixup. The method generates augmented features by interpolation but gradually moves them toward the midpoint of inter-class feature pairs. As a result, the method induces two effects: 1) balancing the margin for all classes and 2) only moderately broadening the margin until it holds maximal confidence. We empirically analyze the collapse effects by measuring alignment and uniformity with visualizing representations. Then, we validate the intra-class collapse effects in coarse-to-fine transfer learning and the inter-class collapse effects in imbalanced learning on long-tailed datasets. In both tasks, our method shows better performance than other augmentation methods.

📄 PDF Abstract BibTeX arXiv:2401.14696

Code (0)

등록된 구현이 없습니다.

Tasks

Representation LearningTransfer Learning

Methods 이 논문이 사용한 방법론

Mixup Mixup is a data augmentation technique that generates a weighted combination of random image pairs from the training data. Given two images and their ground truth labels:…

Similar Papers 제목 키워드 기반

On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method

2020-11-06 · NeurIPS 2020 12 · Ye He, Krishnakumar Balasubramanian, Murat A. Erdogdu

The randomized midpoint method, proposed by [SL19], has emerged as an optimal discretization procedure for simulating the continuous time Langevin diffusions. Focusing on the case of strong-convex and smooth potentials, …

Numerical Integration

Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications

2023-06-28 · NeurIPS 2023 11 · Xinyu Ma, Xu Chu, Yasha Wang, Yang Lin 외

Graph data augmentation has shown superiority in enhancing generalizability and robustness of GNNs in graph-level classifications. However, existing methods primarily focus on the augmentation in the graph signal space a…

Data Augmentation

Provably Learning Diverse Features in Multi-View Data with Midpoint Mixup

2022-10-24 · Muthu Chidambaram, Xiang Wang, Chenwei Wu, Rong Ge

Mixup is a data augmentation technique that relies on training using random convex combinations of data points and their labels. In recent years, Mixup has become a standard primitive used in the training of state-of-the…

Data Augmentationimage-classificationImage Classification

Towards the Desirable Decision Boundary by Moderate-Margin Adversarial Training

2022-07-16 · Xiaoyu Liang, Yaguan Qian, Jianchang Huang, Xiang Ling 외

Adversarial training, as one of the most effective defense methods against adversarial attacks, tends to learn an inclusive decision boundary to increase the robustness of deep learning models. However, due to the large …

Langevin Monte Carlo for strongly log-concave distributions: Randomized midpoint revisited

2023-06-14 · Lu Yu, Avetik Karagulyan, Arnak Dalalyan

We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\mathbb R^p$. In this context, if no additional density information is available, the randomized…