• Aucun résultat trouvé

Differential Privacy Preserving Regression Analysis and Deep Learning

N/A
N/A
Protected

Academic year: 2022

Partager "Differential Privacy Preserving Regression Analysis and Deep Learning"

Copied!
1
0
0

Texte intégral

(1)

Differential Privacy Preserving Regression Analysis and Deep Learning

Xintao Wu

University of Arkansas,USA

[email protected]

ABSTRACT

Many data mining and machine learning methods such as regres- sion models often involve optimization of objective functions. The functional mechanism (FM), which perturbs coefficients of the poly- nomial representation of the objective function, has been shown as an effective way to achieve differential privacy. Although the learned model guarantees protection against attempts to infer whether a subject was included in the training set, it is not designed to pro- tect attribute privacy when model inversion attacks are launched.

In model inversion attacks, an adversary uses the released model to make predictions of sensitive attributes of a target individual when some background information is available. In the first part of this talk, we present an approach which leverages the FM but effec- tively balances the privacy budget for sensitive and non-sensitive attributes in learning the model. As a result, the approach can ef- fectively prevent model inversion attacks and retain model utility while preserving privacy. In the second part of this talk, we con- centrate on recent research on privacy preserving deep learning.

In particular, we present the differential privacy preserving deep Auto-encoder based on the FM. Finally we present challenges and findings when applying the developed techniques in healthcare and genome wide association studies.

Keywords

Differential privacy; regression; deep learning

Biography

Dr. Xintao Wu is the professor and the Charles D. Morgan/Acxiom Endowed Graduate Research Chair in Database in Computer Sci- ence and Computer Engineering Department at University of Arkansas.

He was a faculty member in College of Computing and Informat- ics at the University of North Carolina at Charlotte from 2001 to 2014. Dr. Wu’s major research interests include data mining, priva- cy and security, database application testing and big data analysis.

His recent research work has been to develop privacy preserving techniques for mining tabular data, social network data, healthcare data, and GWAS data and develop spectral analysis based fraud de-

c2016, Copyright is with the authors. Published in the Workshop Pro- ceedings of the EDBT/ICDT 2016 Joint Conference (March 15, 2016, Bor- deaux, France) on CEUR-WS.org (ISSN 1613-0073). Distribution of this paper is permitted under the terms of the Creative Commons license CC- by-nc-nd 4.0

tection techniques in social networks. Dr. Wu has published over 90 scholarly papers. He and his students received several award- s including a PAKDD’09 Best Student Paper Runner-up Award, WISE’12 Challenge Runner-up Award, PAKDD’13 Best Applica- tion Paper Award, and BIBM’13 Best Paper Award. Dr. Wu has served on editorial boards of several international journals and fre- quently served on NSF review panels and program committees of top international conferences, including ACM KDD, CIKM, IEEE ICDM, SIAM SDM, PKDD, and PAKDD. Dr. Wu is a recipient of NSF CAREER Award (2006), Excellence in Undergraduate Teach- ing Award (2005), and Outstanding Faculty Research Award (2009) from College of Computing and Informatics at UNC Charlotte.

Références

Documents relatifs

We performed a comparison of 6 data generative methods 2 on the MIMIC-III mortality problem: (1) Gaussian Multivariate [2], (2) Wasserstein GAN (WGAN) [3, 4], (3) Parzen Windows

In iPDA, each sensor node hides its individual data by slicing the data and sending en- crypted data slices to different neighboring nodes, then the aggregators aggregate the

Searchable encryption schemes allow a client to query from an untrusted server to search within encrypted data without having the encryption key and without learning information

In addition to our above study in the data collection scenario, we also compare our randomized response with two mechanism- s, Laplacian mechanism and smooth sensitivity, in the

This month, at the ACM Web Search and Data Mining (WSDM) Conference, my colleagues and I will describe a way to protect privacy during large-scale analyses of textual data supplied

two-fold when submitting a batch of data for annotation: (1) labeling this selected subset leads to the greatest increase in our machine learning model performance, (2) the

Our contributions are as follows: (i) an architecture of a pri- vacy preserving workflow system that preserves the privacy of the dataset used and generated when enacting

The key contributions of this paper consist of an automated approach for extracting task-relevant schema from RDF data sources for the formulation of data selection and