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

Submit Your Questions: Inside The World of Online Romance Scams

The Yahoo Boys author Carlos Barragán will join Kate Knibbs to answer your questions about…

23 hours ago

3 Nuclear Startups Hit a Big Milestone. Why It Matters—and Why It Doesn’t

The companies’ Fourth of July plans include celebrating new reactor designs coming online. But there’s…

2 days ago

Context vs. Memory Engineering in Agentic AI Systems

Compression on Arrival Tool outputs should be compressed after a call returns, not after the…

3 days ago

Why I disappeared for 3 Months & What’s Next

I’ve been quiet since November because I’ve been building.Over the past few months, AI has…

3 days ago

Multi-Agent Teams Hold Experts Back

Multi-agent LLM systems are increasingly deployed as autonomous collaborators, where agents interact freely rather than…

3 days ago

Managing Elasticsearch Reindex at Scale: Performance, Reliability, and Observability

Editor’s Note: This is the fourth post in a series exploring how Palantir customizes infrastructure…

3 days ago