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

An Introduction to Loop Engineering

It's tempting to treat loop engineering as something invented in a single week in June,…

2 hours ago

Best practices for applying Amazon Bedrock Guardrails to code generation workflows

This post continues our series on best practices with Amazon Bedrock Guardrails. For the previous…

2 hours ago

The Blueprint: How Voicify makes AI-enabled ordering a delight for customers

Welcome to The Blueprint, a new feature where we highlight how Google Cloud customers are…

2 hours ago

An FDA Panel Just Endorsed These Unproven Peptides

Outside experts—some with a vested interest in peptides—recommended adding a number of the amino acids…

3 hours ago

AI extracts hidden material rules from microscopic data to predict large-scale behavior

Researchers from the National University of Singapore (NUS) have developed artificial intelligence (AI) methods that…

3 hours ago

AI Teammates: how monday.com runs production AI agents on Amazon Bedrock

AI Teammates are agentic AI on Amazon Bedrock, and few engineering organizations run them in…

1 day ago