Research
Beyond Empirical Support: Structured Outlier Generation via Sinkhorn Optimal Transport
arXiv:2609.31470v1 Announce Type: cross Abstract: Outliers are essential for evaluating and improving the robustness of machine learning systems, especially when future distributions may differ signif
arXiv:2609.31470v1 Announce Type: cross Abstract: Outliers are essential for evaluating and improving the robustness of machine learning systems, especially when future distributions may differ significantly from historical training data. In high-stakes applications, robustness often depends on rare cases that finite datasets fail to capture, making simple resampling or perturbation insufficient for stress scenario generation. Existing outlier synthesis methods typically rely on sparse neighborhoods, low support latent regions, or classifier boundary crossings, which can be heuristic, unstable, and tied to specific modalities or architectures. We therefore propose Sinkhorn Boundary Outlier Generation (SBOG), a structured framework for latent-space outlier generation that couples Sinkhorn optimal transport geometry with distributionally robust boundary modeling. The resulting Sinkhorn-induced support cost guides the sampler toward weakly supported boundary regions, while semantic constraints prevent uncontrolled drift from the intended context, yielding controlled deviations from the in-distribution reference measure rather than arbitrary sparse-region samples. Experiments on time series anomaly generation and image outlier synthesis show that our framework produces informative, semantically controlled outliers and improves downstream robustness evaluation across modalities, providing a foundation for stress scenario generation beyond empirical support.
Related
- Mind the Gap: Navigating Inference with Optimal Transport Maps
- Entropic Riemannian Neural Optimal Transport
- Multimarginal flow matching with optimal transport potentials
- Geometric Dictionary Learning of Dynamical Systems with Optimal Transport
Source: arXiv cs.LG | 2026-09-28