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

HunyuanImage 3.0 (80B) running natively in ComfyUI on a single 12–24 GB GPU: text-to-image, editing and style transfer, ~30 s per image

I've been working on native ComfyUI support for Tencent's HunyuanImage 3.0, the 80B mixture-of-experts image…

21 hours ago

Synchronous vs. Asynchronous Agent Execution: Architecture Patterns for Production

In this article, you will learn how synchronous and asynchronous execution patterns differ architecturally, and…

21 hours ago

RISED: Rubrics for Agentic Multi-Environment Selection and Self-Distillation

Training a single LLM agent jointly across diverse interactive environments has attracted increasing attention as…

21 hours ago

Building a context-aware AI assistant on AgentCore and OpenClaw

Off-the-shelf AI assistants answer individual questions well, but they fall short on a different axis:…

21 hours ago

I Found the 20 Best Prime Day Tech and Gadget Deals (October 2026)

Never pay full price. Bag yourself some Prime Day tech deals on our favorite WIRED-tested…

22 hours ago

Agentic AI turns simple language into self-guided X-ray scans of microelectronics

Science has increasingly used artificial intelligence (AI) as a kind of microscope—sorting data, analyzing images…

22 hours ago