paper-with-me

홈 › Papers

Can we learn better with hard samples?

2023-04-07 · Subin Sahayam, John Zakkam, Umarani Jayaraman

In deep learning, mini-batch training is commonly used to optimize network parameters. However, the traditional mini-batch method may not learn the under-represented samples and complex patterns in the data, leading to a longer time for generalization. To address this problem, a variant of the traditional algorithm has been proposed, which trains the network focusing on mini-batches with high loss. The study evaluates the effectiveness of the proposed training using various deep neural networks trained on three benchmark datasets (CIFAR-10, CIFAR-100, and STL-10). The deep neural networks used in the study are ResNet-18, ResNet-50, Efficient Net B4, EfficientNetV2-S, and MobilenetV3-S. The experimental results showed that the proposed method can significantly improve the test accuracy and speed up the convergence compared to the traditional mini-batch training method. Furthermore, we introduce a hyper-parameter delta ({\delta}) that decides how many mini-batches are considered for training. Experiments on various values of {\delta} found that the performance of the proposed method for smaller {\delta} values generally results in similar test accuracy and faster generalization. We show that the proposed method generalizes in 26.47% less number of epochs than the traditional mini-batch method in EfficientNet-B4 on STL-10. The proposed method also improves the test top-1 accuracy by 7.26% in ResNet-18 on CIFAR-100.

📄 PDF Abstract BibTeX arXiv:2304.03486

Code (1)

imjohnzakkam/DyBAT 공식 구현 pytorch

Tasks

Image Classification

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

DropMix: Better Graph Contrastive Learning with Harder Negative Samples

2023-10-15 · Yueqi Ma, Minjie Chen, Xiang Li

While generating better negative samples for contrastive learning has been widely studied in the areas of CV and NLP, very few work has focused on graph-structured data. Recently, Mixup has been introduced to synthesize …

Contrastive Learning

Data-Efficient Contrastive Learning by Differentiable Hard Sample and Hard Positive Pair Generation

2021-09-29 · Yawen Wu, Zhepeng Wang, Dewen Zeng, Yiyu Shi 외

Contrastive learning (CL), a self-supervised learning approach, can effectively learn visual representations from unlabeled data. However, CL requires learning on vast quantities of diverse data to achieve good performan…

Contrastive LearningSelf-Supervised Learning

Differences Between Hard and Noisy-labeled Samples: An Empirical Study

2023-07-20 · Mahsa Forouzesh, Patrick Thiran

Extracting noisy or incorrectly labeled samples from a labeled dataset with hard/difficult samples is an important yet under-explored topic. Two general and often independent lines of work exist, one focuses on addressin…

OTFace: Hard Samples Guided Optimal Transport Loss for Deep Face Representation

2022-03-28 · Jianjun Qian, Shumin Zhu, Chaoyu Zhao, Jian Yang 외

Face representation in the wild is extremely hard due to the large scale face variations. To this end, some deep convolutional neural networks (CNNs) have been developed to learn discriminative feature by designing prope…

Triplet

Better and Faster: Exponential Loss for Image Patch Matching

2019-10-01 · ICCV 2019 10 · Shuang Wang, Yanfeng Li, Xuefeng Liang, Dou Quan 외

Recent studies on image patch matching are paying more attention on hard sample learning, because easy samples do not contribute much to the network optimization. They have proposed various hard negative sample mining st…

Image RetrievalPatch MatchingRetrievalTriplet