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

Building Agentic Workflows in Python with LangGraph

In this article, you will learn how to build a complete agentic workflow in Python…

52 mins ago

RayRoPE: Projective Ray Positional Encoding for Multi-View Attention

We study positional encodings for multi-view transformers that process tokens from a set of posed…

52 mins ago

Custom OS installation now available on AWS DeepRacer devices

With the stock firmware and software, developers couldn’t modify their AWS DeepRacer devices to use…

52 mins ago

The Galaxy Card Is Samsung’s Answer to the Apple Card

Directly added to your Samsung Wallet account, it’s yet another cash-back credit card, this time…

2 hours ago

Weak AI regulation may be worse than none at all, researchers say

A new modeling study finds that weak AI regulation may be worse than no regulation…

2 hours ago

Hidden prompts can plant false memories in AI agents, researchers warn

Large language models (LLMs), the computational algorithms underpinning ChatGPT, Gemini and other artificial intelligence (AI)-powered…

1 day ago