Backend
Minimax Rates for Conditional Generative Learning under Wasserstein Loss
arXiv stat.ML0 views
arXiv:2610.35490v1 Announce Type: cross Abstract: We study minimax rates for conditional generative learning under integrated Wasserstein loss, with H\"older continuous conditional laws and an unrestricted covariate distribution. We evaluate unrestricted generators through their conditional output distributions. For expected Wasserstein loss, the minimax rate agrees with the rate under uniform covariates and follows from balancing localization bias against unconditional distribution estimation error. Higher moments of the loss can instead be dominated by unobserved covariate regions, which force an additional risk contribution of order $n^{-1}$, where $n$ is the sample size. An adaptive localization argument gives matching upper bounds. The results cover unrestricted response laws and possibly vanishing Besov densities for $W_1$, and extend to higher Wasserstein orders under uniform response density bounds and integrability conditions. A multiscale lower bound closes the logarithmic gap in unconditional $W_1$ minimax rates in dimension two for both unrestricted distributions and Besov density classes. We also establish minimax rates for conditional Brenier maps under density, integrability, and uniform curvature conditions.
Source:https://arxiv.org/abs/2610.35490PreviousPrior Predictive Matching for Bayesian LoRANextBalanced Sampling in Stochastic Multi-objective Bandits
Related posts
Why Your Docker Builds Are Slow: Diagnosing Linux Disk I/O Bottlenecks
0dev.to Docker
Deploy FastAPI with PostgreSQL: Docker, a VPS with Caddy, or Railway
0dev.to Docker
Spent 5 months on an enterprise deal, only to lose the deal to the CPO's buddy
0Hacker News Ask
Show HN: HakTok – TikTok for Hacker News
0Hacker News Show
Show HN: Blorgle – a word game with a community-driven word bank
0Hacker News Show
Robot platform combines AI and rapid imaging to improve perovskite solar cell fabrication
0Phys.org Tech