Adaptive Data Augmentation: Elliptical Masking and Dynamic Regularization with Feedback

In recent years, machine learning (ML) models have achieved robust performance and effective generalization in real-world applications. While ML models often perform well on training data, they can struggle with unseen inputs due to overfitting. Data augmentation is a key strategy to increase data diversity and improve model adaptability. This paper introduces the Adaptive Data Augmentation (ADA) method with the newly introduced random Elliptical Cutout, a novel approach that dynamically adjusts augmentation parameters in an adaptive manner based on model performance. Unlike traditional static augmentation methods, ADA adaptively modifies key training parameters, such as batch size, dropout rate, and weight decay, in response to validation accuracy. When validation accuracy stagnates over multiple epochs, these parameters are automatically updated to enhance generalization and reduce overfitting. We validate our approach on diverse datasets, including CIFAR-10, X-RAY, and a Brain MRI, demonstrating significant improvements in model accuracy and robustness compared to well known MixUp method. The ADA method achieves Area Under the Receiver Operating Characteristic Curve (AUC-ROC) ranging from 98.19% to 99.85% across all datasets and models, effectively reducing overfitting while enhancing generalization and classification robustness.

Authors

Institutions

Publication Details

Published
2025-03-22
DOI
https://doi.org/10.1109/southeastcon56624.2025.10971474
Primary Topic
Image and Signal Denoising Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Data Augmentation: Elliptical Masking and Dynamic Regularization with Feedback

Nikolay Sirakov, Namasivayam Ambalavanan, Arie Nakhmani, Avinash Singh
Image and Signal Denoising Methods
article

Adaptive Data Augmentation: Elliptical Masking and Dynamic Regularization with Feedback

Nikolay Sirakov, Namasivayam Ambalavanan, Arie Nakhmani, Avinash Singh
article en

Abstract

In recent years, machine learning (ML) models have achieved robust performance and effective generalization in real-world applications. While ML models often perform well on training data, they can struggle with unseen inputs due to overfitting. Data augmentation is a key strategy to increase data diversity and improve model adaptability. This paper introduces the Adaptive Data Augmentation (ADA) method with the newly introduced random Elliptical Cutout, a novel approach that dynamically adjusts augmentation parameters in an adaptive manner based on model performance. Unlike traditional static augmentation methods, ADA adaptively modifies key training parameters, such as batch size, dropout rate, and weight decay, in response to validation accuracy. When validation accuracy stagnates over multiple epochs, these parameters are automatically updated to enhance generalization and reduce overfitting. We validate our approach on diverse datasets, including CIFAR-10, X-RAY, and a Brain MRI, demonstrating significant improvements in model accuracy and robustness compared to well known MixUp method. The ADA method achieves Area Under the Receiver Operating Characteristic Curve (AUC-ROC) ranging from 98.19% to 99.85% across all datasets and models, effectively reducing overfitting while enhancing generalization and classification robustness.

East Texas A&M University (US), University of Alabama at Birmingham (US)
National Institutes of Health
Openalex Percentile: Top 93%
Image and Signal Denoising Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.