arXiv Machine Learning
Jun 25

Structured Approximations of Measures

arXiv:2310. 09149v3 Announce Type: replace-cross Abstract: We study the approximation of probability measures in the Wasserstein-$p$ distance by structured classes of approximators, motivated by applications in imaging, machine learning, and physical measurement under sensor constraints.

By Keaton Hamm, Varun Khurana
arXiv Machine Learning
Jul 14

The VC dimension of partial concept classes via Radon's theorem

arXiv:2607. 10751v1 Announce Type: new Abstract: Following Alon, Hanneke, Holzman, and Moran (FOCS 2021), we define a partial concept class (PCC) as a family of partial functions \(f: V\to\{0,1,\ast\}\); equivalently, its concepts partition the ground set into black ($f^{-1}(1)$), grey ($f^{-1}(\ast)$), and white parts ($f^{-1}(0)$).

By Grigory Ivanov, Attila Jung, M\'arton Nasz\'odi
arXiv AI
Jun 8

A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space

arXiv:2606. 07325v1 Announce Type: cross Abstract: We study the minimax rate of estimating a future value $\mu_{t_n+h}$ of a curve $t\mapsto\mu_t$ in the $2$-Wasserstein space $\mathcal{P}_2(\mathbb{R}^d)$ from finitely many noisy snapshots of its past, under an adiabatic bound $\|\nabla_t^k v\|\le\varepsilon$ on the $k$-th covariant derivative of the velocity field.

By Munsik Kim
arXiv Machine Learning
Aug 18

The Observable Wasserstein Distance

arXiv:2605. 09916v2 Announce Type: replace-cross Abstract: We introduce the observable Wasserstein distance, a framework for deriving lower bounds on the Wasserstein distance between probability measures on Polish metric spaces, designed to bypass the computational intractability of exact optimal transport in large-scale, non-Euclidean datasets.

By Edivaldo Lopes dos Santos, Leandro Vicente Mauri, Washington Mio, Tom Needham