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

Word Embeddings for Tabular Data Feature Engineering

It would be difficult to argue that word embeddings — dense vector representations of words…

6 hours ago

AXLearn: Modular Large Model Training on Heterogeneous Infrastructure

We design and implement AXLearn, a production deep learning system that facilitates scalable and high-performance…

6 hours ago

Advanced fine-tuning methods on Amazon SageMaker AI

This post provides the theoretical foundation and practical insights needed to navigate the complexities of…

6 hours ago

How Jina AI built its 100-billion-token web grounding system with Cloud Run GPUs

Editor’s note: The Jina AI Reader is a specialized tool that transforms raw web content…

6 hours ago

A Gaming GPU Helps Crack the Code on a Thousand-Year Cultural Conversation

Ceramics — the humble mix of earth, fire and artistry — have been part of…

6 hours ago