Computer Science – Data Structures and Algorithms
Scientific paper
2010-04-19
Computer Science
Data Structures and Algorithms
Appears in APPROX 2010
Scientific paper
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures other commonly studied classes, including predicate queries and histogram queries. We show that the accuracy to which a set of linear queries can be answered is closely related to its fat-shattering dimension, a property that characterizes the learnability of real-valued functions in the agnostic-learning setting.
No associations
LandOfFree
Differential Privacy and the Fat-Shattering Dimension of Linear Queries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Differential Privacy and the Fat-Shattering Dimension of Linear Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Differential Privacy and the Fat-Shattering Dimension of Linear Queries will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-59892