Categories: FAANG

Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis

Fingerprinting codes are a crucial tool for proving lower bounds in differential privacy. They have been used to prove tight lower bounds for several fundamental questions, especially in the “low accuracy” regime. Unlike reconstruction/discrepancy approaches however, they are more suited for proving worst-case lower bounds, for query sets that arise naturally from the fingerprinting codes construction. In this work, we propose a general framework for proving fingerprinting type lower bounds, that allows us to tailor the technique to the geometry of the query set.
Our approach allows us to…
AI Generated Robotic Content

Recent Posts

Are there any open source alternatives to this?

I know there are models available that can fill in or edit parts, but I'm…

4 hours ago

The future of engineering belongs to those who build with AI, not without it

As we look ahead, the relationship between engineers and AI systems will likely evolve from…

5 hours ago

The 8 Best Handheld Vacuums, Tested and Reviewed (2025)

Lightweight, powerful, and generally inexpensive, the handheld vacuum is the perfect household helper.

5 hours ago

I really miss the SD 1.5 days

submitted by /u/Dwanvea [link] [comments]

1 day ago

Latent Bridge Matching: Jasper’s Game-Changing Approach to Image Translation

Discover how latent bridge matching, pioneered by the Jasper research team, transforms image-to-image translation with…

1 day ago

A Gentle Introduction to SHAP for Tree-Based Models

Machine learning models have become increasingly sophisticated, but this complexity often comes at the cost…

1 day ago