16,224 research outputs found
When Causal Intervention Meets Adversarial Examples and Image Masking for Deep Neural Networks
Discovering and exploiting the causality in deep neural networks (DNNs) are
crucial challenges for understanding and reasoning causal effects (CE) on an
explainable visual model. "Intervention" has been widely used for recognizing a
causal relation ontologically. In this paper, we propose a causal inference
framework for visual reasoning via do-calculus. To study the intervention
effects on pixel-level features for causal reasoning, we introduce pixel-wise
masking and adversarial perturbation. In our framework, CE is calculated using
features in a latent space and perturbed prediction from a DNN-based model. We
further provide the first look into the characteristics of discovered CE of
adversarially perturbed images generated by gradient-based methods
\footnote{~~https://github.com/jjaacckkyy63/Causal-Intervention-AE-wAdvImg}.
Experimental results show that CE is a competitive and robust index for
understanding DNNs when compared with conventional methods such as
class-activation mappings (CAMs) on the Chest X-Ray-14 dataset for
human-interpretable feature(s) (e.g., symptom) reasoning. Moreover, CE holds
promises for detecting adversarial examples as it possesses distinct
characteristics in the presence of adversarial perturbations.Comment: Noted our camera-ready version has changed the title. "When Causal
Intervention Meets Adversarial Examples and Image Masking for Deep Neural
Networks" as the v3 official paper title in IEEE Proceeding. Please use it in
your formal reference. Accepted at IEEE ICIP 2019. Pytorch code has released
on https://github.com/jjaacckkyy63/Causal-Intervention-AE-wAdvIm
Understanding and Predicting Delay in Reciprocal Relations
Reciprocity in directed networks points to user's willingness to return
favors in building mutual interactions. High reciprocity has been widely
observed in many directed social media networks such as following relations in
Twitter and Tumblr. Therefore, reciprocal relations between users are often
regarded as a basic mechanism to create stable social ties and play a crucial
role in the formation and evolution of networks. Each reciprocity relation is
formed by two parasocial links in a back-and-forth manner with a time delay.
Hence, understanding the delay can help us gain better insights into the
underlying mechanisms of network dynamics. Meanwhile, the accurate prediction
of delay has practical implications in advancing a variety of real-world
applications such as friend recommendation and marketing campaign. For example,
by knowing when will users follow back, service providers can focus on the
users with a potential long reciprocal delay for effective targeted marketing.
This paper presents the initial investigation of the time delay in reciprocal
relations. Our study is based on a large-scale directed network from Tumblr
that consists of 62.8 million users and 3.1 billion user following relations
with a timespan of multiple years (from 31 Oct 2007 to 24 Jul 2013). We reveal
a number of interesting patterns about the delay that motivate the development
of a principled learning model to predict the delay in reciprocal relations.
Experimental results on the above mentioned dynamic networks corroborate the
effectiveness of the proposed delay prediction model.Comment: 10 page
Attributed Network Embedding for Learning in a Dynamic Environment
Network embedding leverages the node proximity manifested to learn a
low-dimensional node vector representation for each node in the network. The
learned embeddings could advance various learning tasks such as node
classification, network clustering, and link prediction. Most, if not all, of
the existing works, are overwhelmingly performed in the context of plain and
static networks. Nonetheless, in reality, network structure often evolves over
time with addition/deletion of links and nodes. Also, a vast majority of
real-world networks are associated with a rich set of node attributes, and
their attribute values are also naturally changing, with the emerging of new
content patterns and the fading of old content patterns. These changing
characteristics motivate us to seek an effective embedding representation to
capture network and attribute evolving patterns, which is of fundamental
importance for learning in a dynamic environment. To our best knowledge, we are
the first to tackle this problem with the following two challenges: (1) the
inherently correlated network and node attributes could be noisy and
incomplete, it necessitates a robust consensus representation to capture their
individual properties and correlations; (2) the embedding learning needs to be
performed in an online fashion to adapt to the changes accordingly. In this
paper, we tackle this problem by proposing a novel dynamic attributed network
embedding framework - DANE. In particular, DANE first provides an offline
method for a consensus embedding and then leverages matrix perturbation theory
to maintain the freshness of the end embedding results in an online manner. We
perform extensive experiments on both synthetic and real attributed networks to
corroborate the effectiveness and efficiency of the proposed framework.Comment: 10 page
- …