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

Measuring Performance of Transformer Inference

This chapter is divided into eight parts; they are: • Metrics for LLM Inference •…

7 hours ago

Static vs. Dynamic vs. Continuous Batching in LLM Inference

In this article, you will learn how static, dynamic, and continuous batching work in LLM…

7 hours ago

Introducing Web Search on Amazon Bedrock for foundation model grounding

When a foundation model needs to answer a question about last week’s earnings call, yesterday’s…

7 hours ago

How Deutsche Bank unlocked agility with an API-ready ecosystem

When people think about digital transformation in banking, they often focus on the visible results:…

7 hours ago

OK, Well, Rogue AI Agents Are Hacking Again

Rogue AI agents from OpenAI and Anthropic have again been caught trying to disrupt servers…

8 hours ago

People prefer stories written by AI—especially when told they’re written by a human

People gave the highest ratings to AI-generated stories they were told had been written by…

8 hours ago