arXiv (All)
open access
Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
Resource-efficiently computing representations of probability distributions and the distances between them while only having access to the samples is a fundamental and useful problem across mathematical sciences. In this paper, we propose a generic framework to learn the probability and cumulative d
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
- Gromov-Wasserstein at Scale, Beyond Squared Norms#1201982
- A Sub-4 Approximation for Fair $k$-Means#985378
- On Inherent Privacy of Posterior Sampling: A Unified Rényi-Divergence Framework#1354264
- CHANGE POINT ANALYSIS IN HIGH-DIMENSIONAL DATA USING RANDOM PROJECTIONS#210676
- Finite-Sample Unbiasedly Estimable Information Monotones#615059
Record · ID 1328275
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