We study finite-sample statistical performance guarantees for distributionally robust optimization (DRO) with optimal transport (OT) and OT-regularized divergence model neighborhoods. Specifically, we derive concentration inequalities for supervised learning via DRO-based adversarial training, as commonly employed to enhance the adversarial robustness of machine learning models. Our results apply to a wide range of OT cost functions, beyond the $p$-Wasserstein case studied by previous authors. In particular, our results are the first to: 1) cover soft-constraint norm-ball OT cost functions; soft-constraint costs have been shown empirically to enhance robustness when used in adversarial training, 2) apply to the combination of adversarial sample generation and adversarial reweighting that is induced by using OT-regularized $f$-divergence model neighborhoods; the added reweighting mechanism has also been shown empirically to further improve performance. In addition, even in the $p$-Wasserstein case, our bounds exhibit better behavior as a function of the DRO neighborhood size than previous results when applied to the adversarial setting.

Queuing network control determines the allocation of scarce resources to manage congestion, a fundamental problem in manufacturing, communications, and healthcare.

Deterministic We shows Lemma Given >0, ther I and PoF (G,I,0) 1 .

Figure 2: RN "100) when structure (see(A)stationary (B)altered T{3and2T{3as

Lemma 2.Suppose Assumptions 1 and 2 hold.

Foreacharma, letr(a) and cj(a) be, resp., the meanrewardandmeanresource-j consumption,i.e.,(r(a);c1(a),..., cd(a)):=Eo Da[o].We sometimeswriter =( r(a): a 2 [K])andcj =( cj(a): a 2 [K])asvectorsoverarms. Second, weuseatighterversionof Eq. (3.6) (see AppendixD.3):