ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2111.08505
20
2

On Adaptive Confidence Sets for the Wasserstein Distances

16 November 2021
N. Deo
Thibault Randrianarisoa
ArXivPDFHTML
Abstract

In the density estimation model, we investigate the problem of constructing adaptive honest confidence sets with radius measured in Wasserstein distance WpW_pWp​, p≥1p\geq1p≥1, and for densities with unknown regularity measured on a Besov scale. As sampling domains, we focus on the d−d-d−dimensional torus Td\mathbb{T}^dTd, in which case 1≤p≤21\leq p\leq 21≤p≤2, and Rd\mathbb{R}^dRd, for which p=1p=1p=1. We identify necessary and sufficient conditions for the existence of adaptive confidence sets with diameters of the order of the regularity-dependent WpW_pWp​-minimax estimation rate. Interestingly, it appears that the possibility of such adaptation of the diameter depends on the dimension of the underlying space. In low dimensions, d≤4d\leq 4d≤4, adaptation to any regularity is possible. In higher dimensions, adaptation is possible if and only if the underlying regularities belong to some interval of width at least d/(d−4)d/(d-4)d/(d−4). This contrasts with the usual Lp−L_p-Lp​−theory where, independently of the dimension, adaptation requires regularities to lie in a small fixed-width window. For configurations allowing these adaptive sets to exist, we explicitly construct confidence regions via the method of risk estimation, centred at adaptive estimators. Those are the first results in a statistical approach to adaptive uncertainty quantification with Wasserstein distances. Our analysis and methods extend more globally to weak losses such as Sobolev norm distances with negative smoothness indices.

View on arXiv
Comments on this paper