← Back to all news
arXiv Machine Learning By Keaton Hamm, Varun Khurana

Structured Approximations of Measures

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

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
ragsafety
More like this →
arXiv Machine Learning
Sep 7

The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures

The paper investigates how many linear samples are needed to learn Lipschitz operators under Gaussian measures. It establishes both lower and upper bounds on the Hermite polynomial approximation error and shows that the minimal worst‑case error cannot converge algebraically with the number of samples. However, if the covariance operator of the Gaussian measure decays rapidly, convergence rates arbitrarily close to any algebraic rate can be achieved.

By Ben Adcock, Michael Griebel, Gregor Maier
More like this →