Junliang Huang

Learn More
We consider accurately answering smooth queries while preserving differential privacy. A query is said to be K-smooth if it is specified by a function defined on [−1, 1] d whose partial derivatives up to order K are all bounded. We develop an ǫ-differentially private mechanism for the class of K-smooth queries. The major advantage of the algorithm is that(More)
  • 1