First-Order Manifold Data Augmentation for Regression Learning
Ilya Kaufman, Omri Azencot
TL;DR
This work tackles the paucity of domain-independent data augmentation for regression by introducing First-Order Manifold Augmentation (FOMA). FOMA generates augmented samples by perturbing along the tangent space of the training data manifold, approximated via SVD and controlled by a Beta-distributed parameter to scale small singular values; it is fully differentiable and can be applied at any layer. The authors provide a VRM-based analysis, compare FOMA to Mixup and other baselines, and demonstrate significant improvements in both in-distribution generalization and out-of-distribution robustness across diverse regression tasks. They also perform extensive ablations to justify design choices and discuss computational considerations tied to the SVD-based approach. Overall, FOMA represents a practical, principled tangent-space augmentation strategy that enhances regression performance under distribution shifts and regularization challenges.
Abstract
Data augmentation (DA) methods tailored to specific domains generate synthetic samples by applying transformations that are appropriate for the characteristics of the underlying data domain, such as rotations on images and time warping on time series data. In contrast, domain-independent approaches, e.g. mixup, are applicable to various data modalities, and as such they are general and versatile. While regularizing classification tasks via DA is a well-explored research topic, the effect of DA on regression problems received less attention. To bridge this gap, we study the problem of domain-independent augmentation for regression, and we introduce FOMA: a new data-driven domain-independent data augmentation method. Essentially, our approach samples new examples from the tangent planes of the train distribution. Augmenting data in this way aligns with the network tendency towards capturing the dominant features of its input signals. We evaluate FOMA on in-distribution generalization and out-of-distribution robustness benchmarks, and we show that it improves the generalization of several neural architectures. We also find that strong baselines based on mixup are less effective in comparison to our approach. Our code is publicly available athttps://github.com/azencot-group/FOMA.
