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

Powering Multimodal Intelligence for Video Search

Synchronizing the Senses: Powering Multimodal Intelligence for Video SearchBy: Meenakshi Jindal and Munya MarazanyeToday’s filmmakers capture…

3 hours ago

Envoy: A future-ready foundation for agentic AI networking

In today's agentic AI environments, the network has a new set of responsibilities. In a…

3 hours ago

Meta Pauses Work With Mercor After Data Breach Puts AI Industry Secrets at Risk

Major AI labs are investigating a security incident that impacted Mercor, a leading data vendor.…

4 hours ago

Living brain cells enable machine learning computations

A research team at Tohoku University and Future University Hakodate has demonstrated that living biological…

4 hours ago

LTX Desktop 1.0.3 is live! Now runs on 16 GB VRAM machines

The biggest change: we integrated model layer streaming across all local inference pipelines, cutting peak…

1 day ago