2,714 research outputs found
Understanding Compressive Adversarial Privacy
Designing a data sharing mechanism without sacrificing too much privacy can
be considered as a game between data holders and malicious attackers. This
paper describes a compressive adversarial privacy framework that captures the
trade-off between the data privacy and utility. We characterize the optimal
data releasing mechanism through convex optimization when assuming that both
the data holder and attacker can only modify the data using linear
transformations. We then build a more realistic data releasing mechanism that
can rely on a nonlinear compression model while the attacker uses a neural
network. We demonstrate in a series of empirical applications that this
framework, consisting of compressive adversarial privacy, can preserve
sensitive information
Event Generation and Statistical Sampling for Physics with Deep Generative Models and a Density Information Buffer
We present a study for the generation of events from a physical process with
deep generative models. The simulation of physical processes requires not only
the production of physical events, but also to ensure these events occur with
the correct frequencies. We investigate the feasibility of learning the event
generation and the frequency of occurrence with Generative Adversarial Networks
(GANs) and Variational Autoencoders (VAEs) to produce events like Monte Carlo
generators. We study three processes: a simple two-body decay, the processes
and including the decay of the top
quarks and a simulation of the detector response. We find that the tested GAN
architectures and the standard VAE are not able to learn the distributions
precisely. By buffering density information of encoded Monte Carlo events given
the encoder of a VAE we are able to construct a prior for the sampling of new
events from the decoder that yields distributions that are in very good
agreement with real Monte Carlo events and are generated several orders of
magnitude faster. Applications of this work include generic density estimation
and sampling, targeted event generation via a principal component analysis of
encoded ground truth data, anomaly detection and more efficient importance
sampling, e.g. for the phase space integration of matrix elements in quantum
field theories.Comment: 24 pages, 10 figure
Enabling Massive Deep Neural Networks with the GraphBLAS
Deep Neural Networks (DNNs) have emerged as a core tool for machine learning.
The computations performed during DNN training and inference are dominated by
operations on the weight matrices describing the DNN. As DNNs incorporate more
stages and more nodes per stage, these weight matrices may be required to be
sparse because of memory limitations. The GraphBLAS.org math library standard
was developed to provide high performance manipulation of sparse weight
matrices and input/output vectors. For sufficiently sparse matrices, a sparse
matrix library requires significantly less memory than the corresponding dense
matrix implementation. This paper provides a brief description of the
mathematics underlying the GraphBLAS. In addition, the equations of a typical
DNN are rewritten in a form designed to use the GraphBLAS. An implementation of
the DNN is given using a preliminary GraphBLAS C library. The performance of
the GraphBLAS implementation is measured relative to a standard dense linear
algebra library implementation. For various sizes of DNN weight matrices, it is
shown that the GraphBLAS sparse implementation outperforms a BLAS dense
implementation as the weight matrix becomes sparser.Comment: 10 pages, 7 figures, to appear in the 2017 IEEE High Performance
Extreme Computing (HPEC) conferenc
- …