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

2026 BAIR Graduate Showcase

Congratulations to the Berkeley Artificial Intelligence Research (BAIR) Lab class of 2026! This year, BAIR…

22 hours ago

Run NVIDIA Nemotron and OpenAI GPT OSS models on Amazon Bedrock in AWS GovCloud (US)

Government agencies running workloads in AWS GovCloud (US) need AI capabilities that keep pace with…

22 hours ago

AlloyDB AI Functions – now with revolutionary performance boosts and cost savings

AlloyDB is an AI-native database—it isn’t just a passive data store, it intelligently understands and…

22 hours ago

The Best July 4 Grill and Griddle Deals: Weber, Traeger, Recteq

Fourth of July weekend is the last great grill and griddle sale of the summer,…

23 hours ago

Why AI fiction still feels flat: New test shows characters lack mystery and complexity

Researchers at the University of North Carolina at Chapel Hill have found that while artificial…

23 hours ago

Context Window Management for Long-Running Agents: Strategies and Tradeoffs

In this article, you will learn five practical strategies for managing context windows in long-running…

2 days ago