arXiv (All)
open access
Wasserstein Distributionally Robust Online Learning
We study online Wasserstein distributionally robust optimization (DRO), where the ambiguity set is a Wasserstein ball centered at the empirical distribution and evolves with each observation. We formulate each round as a zero-sum game and develop an online distributional best-response algorithm that
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distance-Matrix Wasserstein Statistics for Scalable Gromov--Wasserstein Learning#187327
- StablePCA: Distributionally Robust Learning of Shared Representations from Multi-Source Data#1469096
- Retraction-Based Gradient Projection Algorithms on Manifolds#1105444
- On the Interaction of Compressibility and Adversarial Robustness#1118405
- Manifold Sampling via Entropy Maximization#178899
Record · ID 1488309
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive