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

Fine-Tuning vs. Frozen Embeddings: When to Adapt the LLM vs. the Sklearn Head

In this article, you will learn how to compare two strategies for adapting a large…

48 mins ago

Building an Agentic AI Platform on Amazon Bedrock AgentCore

If you’ve tried to get an agent into production, the model and tool use are…

48 mins ago

The 2,000-Nit OLED in Apple’s New MacBook Is a Big Deal

The touchscreen in the new MacBook Pro is crazily bright with very deep blacks. Here’s…

2 hours ago

Context Managers Beyond Opening Files in Python

The stopwatch in the opening script is the smallest case of the pattern.

1 day ago

AWS named a Leader in the 2026 Gartner Magic Quadrant for Contact Center as a Service

I’m proud to share that Amazon Web Services (AWS) has been named a Leader in…

1 day ago

Scale agents securely with IAM Helper Agent Skills and MCP Tools

As organizations adopt autonomous agents to build applications, securing identities and access has become more…

1 day ago