Pith. sign in

Learning to Compose Domain-Specific Transformations for Data Augmentation

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Data augmentation is a ubiquitous technique for increasing the size of labeled training sets by leveraging task-specific data transformations that preserve class labels. While it is often easy for domain experts to specify individual transformations, constructing and tuning the more sophisticated compositions typically needed to achieve state-of-the-art results is a time-consuming manual task in practice. We propose a method for automating this process by learning a generative sequence model over user-specified transformation functions using a generative adversarial approach. Our method can make use of arbitrary, non-deterministic transformation functions, is robust to misspecified user input, and is trained on unlabeled data. The learned transformation model can then be used to perform data augmentation for any end discriminative model. In our experiments, we show the efficacy of our approach on both image and text datasets, achieving improvements of 4.0 accuracy points on CIFAR-10, 1.4 F1 points on the ACE relation extraction task, and 3.4 accuracy points when using domain-specific transformation operations on a medical imaging dataset as compared to standard heuristic augmentation approaches.

fields

cs.LG 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Covariance Shrinkage via Stochastic Interpolation

cs.LG · 2026-06-05 · unverdicted · novelty 7.0

Recasts covariance shrinkage as risk minimization over stochastic interpolants between distributions, recovering known estimators via scheduling, couplings, and early stopping, and proposing a neural estimator with quadratic risk bounds.

citing papers explorer

Showing 1 of 1 citing paper.

  • Covariance Shrinkage via Stochastic Interpolation cs.LG · 2026-06-05 · unverdicted · none · ref 29 · internal anchor

    Recasts covariance shrinkage as risk minimization over stochastic interpolants between distributions, recovering known estimators via scheduling, couplings, and early stopping, and proposing a neural estimator with quadratic risk bounds.