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

Lance by ByteDance: 3B Apache2 model for image and video understanding, generation, and editing

https://lance-project.github.io/ https://github.com/bytedance/Lance https://huggingface.co/bytedance-research/Lance submitted by /u/HatEducational9965 [link] [comments]

9 hours ago

Building Vector Similarity Search in PostgreSQL with pgvector

Search works well when users know exactly what they are looking for, but it breaks…

9 hours ago

Prompting Amazon Nova 2 for content moderation

If you moderate user-generated content at scale, you need a system that catches policy violations…

9 hours ago

These 11 Automatic Cat Feeders Were the Best We Tested in 2026

We tested some of the most popular automatic dry- and wet-food pet feeders to see…

10 hours ago

Audio cues can make AI feel more human, though some users may judge it as rude

Researchers at Carnegie Mellon University are investigating how humans respond to artificial intelligence agents that…

10 hours ago

NeuralCompanion

NeuralCompanion is an open-source, local-first AI companion project for people who like building, experimenting, and…

1 day ago