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

Choosing the Right AI Agent Memory Strategy: A Decision-Tree Approach

In this article, you will learn how to choose the right memory strategy for an…

22 hours ago

Behavioral Privacy Leakage in Agentic Negotiation: Formalizing and Mitigating Inference Attacks via Randomized Policies

This paper was accepted at the AI4TCI (Workshop on AI for Secure and Trustworthy Critical…

22 hours ago

Fine-tune NVIDIA Nemotron 3 models with Amazon SageMaker AI serverless model customization

Model customization transforms general-purpose AI models into specialized enterprise assets. By fine-tuning foundation models (FMs)…

22 hours ago

Frontier and Center: Who evaluates the evaluations?

Editor’s note: Some of the most interesting questions in AI are being asked by information…

22 hours ago

OpenAI’s Head of Safety Is Leaving the Company

Johannes Heidecke’s departure comes as OpenAI tries to further integrate its research and safety teams.

23 hours ago

Brain-inspired hardware brings faster, lower-power anomaly detection to AI systems

The brain's cerebellum doesn't waste energy analyzing every moment. Instead, it constantly monitors the world…

23 hours ago