Categories: FAANG

Instance-Optimal Private Density Estimation in the Wasserstein Distance

Estimating the density of a distribution from samples is a fundamental problem in statistics. In many practical settings, the Wasserstein distance is an appropriate error metric for density estimation. For example, when estimating population densities in a geographic region, a small Wasserstein distance means that the estimate is able to capture roughly where the population mass is. In this work we study differentially private density estimation in the Wasserstein distance. We design and analyze instance-optimal algorithms for this problem that can adapt to easy instances.
For distributions…
AI Generated Robotic Content

Recent Posts

Anime characters + realistic backgrounds (winter edition)

submitted by /u/plsdontultme [link] [comments]

5 hours ago

Attention Variants and Memory Efficiency

Overview This post is divided into eight parts; they are: • The Checkpoint Fixes the…

5 hours ago

Benchmarking Scikit-Ollama vs. Groq-Backed Scikit-LLM: Speed, Cost, and Accuracy

In this article, you will learn how to build a side-by-side benchmark of local and…

5 hours ago

BAIR at CoRL 2026

The Conference on Robot Learning (CoRL) takes place November 9–12, 2026, in Austin, Texas. BAIR…

5 hours ago

Fact-Checking at Scale: Building a More Accurate and Efficient Synopsis Factuality System

By Shreya S Ramanujam, Yongce Li, Afshine Amidi, Sina Ghiassian, Benjamin Klein.IntroductionPicture this — you’re home after a…

5 hours ago

How skills and agents work in AWS Quick

If you use AI agents, you’ve probably explained the same task more than once. You…

5 hours ago