paper-with-me

홈 › Papers

A Statistical Learning Perspective on Semi-dual Adversarial Neural Optimal Transport Solvers

2025-02-03 · Roman Tarasov, Petr Mokrov, Milena Gazdieva, Evgeny Burnaev, Alexander Korotin

Neural network-based optimal transport (OT) is a recent and fruitful direction in the generative modeling community. It finds its applications in various fields such as domain translation, image super-resolution, computational biology and others. Among the existing OT approaches, of considerable interest are adversarial minimax solvers based on semi-dual formulations of OT problems. While promising, these methods lack theoretical investigation from a statistical learning perspective. Our work fills this gap by establishing upper bounds on the generalization error of an approximate OT map recovered by the minimax quadratic OT solver. Importantly, the bounds we derive depend solely on some standard statistical and mathematical properties of the considered functional classes (neural nets). While our analysis focuses on the quadratic OT, we believe that similar bounds could be derived for general OT case, paving the promising direction for future research.

📄 PDF Abstract BibTeX arXiv:2502.01310

Code (0)

등록된 구현이 없습니다.

Tasks

Image Super-ResolutionSuper-Resolution

Similar Papers 제목 키워드 기반

Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Plays

2019-11-25 · N. Mert Vural, Hakan Gokcesu, Kaan Gokcesu, Suleyman S. Kozat

We investigate the adversarial bandit problem with multiple plays under semi-bandit feedback. We introduce a highly efficient algorithm that asymptotically achieves the performance of the best switching $m$-arm strategy …

On the (In)Compatibility between Group Fairness and Individual Fairness

2024-01-13 · Shizhou Xu, Thomas Strohmer

We study the compatibility between the optimal statistical parity solutions and individual fairness. While individual fairness seeks to treat similar individuals similarly, optimal statistical parity aims to provide simi…

Fairness

Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers

2021-10-27 · NeurIPS 2021 12 · Jeffrey Negrea, Blair Bilodeau, Nicolò Campolongo, Francesco Orabona 외

Quantile (and, more generally, KL) regret bounds, such as those achieved by NormalHedge (Chaudhuri, Freund, and Hsu 2009) and its variants, relax the goal of competing against the best individual expert to only competing…

Rate-Optimal Noise Annealing in Semi-Dual Neural Optimal Transport: Tangential Identifiability, Off-Manifold Ambiguity, and Guaranteed Recovery

2026-02-04 · Raymond Chu, Jaewoong Choi, Dohyun Kwon arxiv

Semi-dual neural optimal transport learns a transport map via a max-min objective, yet training can converge to incorrect or degenerate maps. We fully characterize these spurious solutions in the common regime where data…

Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularization

2020-07-13 · Blair Bilodeau, Jeffrey Negrea, Daniel M. Roy

We consider prediction with expert advice when data are generated from distributions varying arbitrarily within an unknown constraint set. This semi-adversarial setting includes (at the extremes) the classical i.i.d. set…

All