Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (115)
- Software Engineering (76)
- Artificial Intelligence and Robotics (37)
- Engineering (35)
- Computer Engineering (33)
-
- Graphics and Human Computer Interfaces (28)
- Information Security (23)
- Digital Communications and Networking (14)
- Theory and Algorithms (14)
- Social and Behavioral Sciences (13)
- Public Affairs, Public Policy and Public Administration (10)
- Transportation (9)
- Computer and Systems Architecture (7)
- Systems Architecture (6)
- Business (5)
- Numerical Analysis and Scientific Computing (5)
- Programming Languages and Compilers (5)
- Data Storage Systems (4)
- Communication (2)
- Management Information Systems (2)
- Medicine and Health Sciences (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Public Health (2)
- Social Media (2)
- Applied Mathematics (1)
- Asian Studies (1)
- Data Science (1)
- Keyword
-
- Neural networks (12)
- Graph neural networks (10)
- Reinforcement learning (9)
- Task analysis (8)
- Training (8)
-
- Deep learning (7)
- Deep learning testing (5)
- Deep neural networks (5)
- Graph Neural Networks (5)
- Network embedding (5)
- Security (5)
- Adaptive Resonance Theory (4)
- Categorization (4)
- Cloud computing (4)
- Clustering (4)
- Computer architecture (4)
- Networks (4)
- Neural Networks (4)
- Neural network (4)
- Neurons (4)
- Supervised learning (4)
- Uncertainty (4)
- Adaptive resonance theory (3)
- Adaptive systems (3)
- Adversarial attack (3)
- Attention mechanisms (3)
- Data models (3)
- Deep Learning (3)
- Deep neural network (3)
- Embeddings (3)
Articles 121 - 150 of 322
Full-Text Articles in OS and Networks
Claim: Curriculum Learning Policy For Influence Maximization In Unknown Social Networks, Dexun Li, Meghna Lowalekar, Pradeep Varakantham
Claim: Curriculum Learning Policy For Influence Maximization In Unknown Social Networks, Dexun Li, Meghna Lowalekar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Influence maximization is the problem of finding a small subset of nodes in a network that can maximize the diffusion of information. Recently, it has also found application in HIV prevention, substance abuse prevention, micro-finance adoption, etc., where the goal is to identify the set of peer leaders in a real-world physical social network who can disseminate information to a large group of people. Unlike online social networks, real-world networks are not completely known, and collecting information about the network is costly as it involves surveying multiple people. In this paper, we focus on this problem of network discovery for …
Bias Field Poses A Threat To Dnn-Based X-Ray Recognition, Bingyu Tian, Qing Guo, Felix Juefei-Xu, Wen Le Chan, Yupeng Cheng, Xiaohong Li, Xiaofei Xie, Shengchao Qin
Bias Field Poses A Threat To Dnn-Based X-Ray Recognition, Bingyu Tian, Qing Guo, Felix Juefei-Xu, Wen Le Chan, Yupeng Cheng, Xiaohong Li, Xiaofei Xie, Shengchao Qin
Research Collection School Of Computing and Information Systems
Chest X-ray plays a key role in screening and diagnosis of many lung diseases including the COVID-19. Many works construct deep neural networks (DNNs) for chest X-ray images to realize automated and efficient diagnosis of lung diseases. However, bias field caused by the improper medical image acquisition process widely exists in the chest X-ray images while the robustness of DNNs to the bias field is rarely explored, posing a threat to the X-ray-based automated diagnosis system. In this paper, we study this problem based on the adversarial attack and propose a brand new attack, i.e., adversarial bias field attack where …
Multi-View Collaborative Network Embedding, Sezin Kircali Ata, Yuan Fang, Min Wu, Jiaqi Shi, Chee Keong Kwoh, Xiaoli Li
Multi-View Collaborative Network Embedding, Sezin Kircali Ata, Yuan Fang, Min Wu, Jiaqi Shi, Chee Keong Kwoh, Xiaoli Li
Research Collection School Of Computing and Information Systems
Real-world networks often exist with multiple views, where each view describes one type of interaction among a common set of nodes. For example, on a video-sharing network, while two user nodes are linked, if they have common favorite videos in one view, then they can also be linked in another view if they share common subscribers. Unlike traditional single-view networks, multiple views maintain different semantics to complement each other. In this article, we propose Multi-view collAborative Network Embedding (MANE), a multi-view network embedding approach to learn low-dimensional representations. Similar to existing studies, MANE hinges on diversity and collaboration—while diversity enables …
Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun
Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun
Research Collection School Of Computing and Information Systems
Class-Incremental Learning (CIL) aims to learn a classification model with the number of classes increasing phase-by-phase. An inherent problem in CIL is the stability-plasticity dilemma between the learning of old and new classes, i.e., high-plasticity models easily forget old classes, but high-stability models are weak to learn new classes. We alleviate this issue by proposing a novel network architecture called Adaptive Aggregation Networks (AANets) in which we explicitly build two types of residual blocks at each residual level (taking ResNet as the baseline architecture): a stable block and a plastic block. We aggregate the output feature maps from these two …
Contextual Transformation Networks For Online Continual Learning, Quang Pham, Chenghao Liu, Doyen Sahoo, Steve C. H. Hoi
Contextual Transformation Networks For Online Continual Learning, Quang Pham, Chenghao Liu, Doyen Sahoo, Steve C. H. Hoi
Research Collection School Of Computing and Information Systems
Continual learning methods with fixed architectures rely on a single network to learn models that can perform well on all tasks. As a result, they often only accommodate common features of those tasks but neglect each task's specific features. On the other hand, dynamic architecture methods can have a separate network for each task, but they are too expensive to train and not scalable in practice, especially in online settings. To address this problem, we propose a novel online continual learning method named ``Contextual Transformation Networks” (CTN) to efficiently model the \emph{task-specific features} while enjoying neglectable complexity overhead compared to …
Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Shankaramurthy Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar
Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Shankaramurthy Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar
Research Collection School Of Computing and Information Systems
Modeling vessel movement in a maritime environment is an extremely challenging task given the complex nature of vessel behavior. Several existing multiagent maritime decision making frameworks require access to an accurate traffic simulator. We develop a system using electronic navigation charts to generate realistic and high fidelity vessel traffic data using Generative Adversarial Networks (GANs). Our proposed Ship-GAN uses a conditional Wasserstein GAN to model a vessel’s behavior. The generator can simulate the travel time of vessels across different maritime zones conditioned on vessels’ speeds and traffic intensity. Furthermore, it can be used as an accurate simulator for prior decision …
Learning Network-Based Multi-Modal Mobile User Interface Embeddings, Gary Ang, Ee-Peng Lim
Learning Network-Based Multi-Modal Mobile User Interface Embeddings, Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Rich multi-modal information - text, code, images, categorical and numerical data - co-exist in the user interface (UI) design of mobile applications. UI designs are composed of UI entities supporting different functions which together enable the application. To support effective search and recommendation applications over mobile UIs, we need to be able to learn UI representations that integrate latent semantics. In this paper, we propose a novel unsupervised model - Multi-modal Attention-based Attributed Network Embedding (MAAN) model. MAAN is designed to capture both multi-modal and structural network information. Based on the encoder-decoder framework, MAAN aims to learn UI representations that …
Practical Server-Side Wifi-Based Indoor Localization: Addressing Cardinality & Outlier Challenges For Improved Occupancy Estimation, Anuradha Ravi, Archan Misra
Practical Server-Side Wifi-Based Indoor Localization: Addressing Cardinality & Outlier Challenges For Improved Occupancy Estimation, Anuradha Ravi, Archan Misra
Research Collection School Of Computing and Information Systems
Server-side WiFi-based indoor localization offers a compelling approach for passive occupancy estimation (i.e., without requiring active participation by client devices, such as smartphones carried by visitors), but is known to suffer from median error of 6–8 meters. By analyzing the characteristics of an operationally-deployed, WiFi-based passive indoor location system, based on the classical RADAR algorithm, we identify and tackle 2 practical challenges for accurate individual device localization. The first challenge is the low-cardinality issue, whereby only the associated AP generates sufficiently frequent RSSI reports, causing a client to experience large localization error due to the absence of sufficient measurements from …
Breaking Neural Reasoning Architectures With Metamorphic Relation-Based Adversarial Examples, Alvin Chan, Lei Ma, Felix Juefei-Xu, Yew-Soon Ong, Xiaofei Xie, Minhui Xue, Yang Liu
Breaking Neural Reasoning Architectures With Metamorphic Relation-Based Adversarial Examples, Alvin Chan, Lei Ma, Felix Juefei-Xu, Yew-Soon Ong, Xiaofei Xie, Minhui Xue, Yang Liu
Research Collection School Of Computing and Information Systems
The ability to read, reason, and infer lies at the heart of neural reasoning architectures. After all, the ability to perform logical reasoning over language remains a coveted goal of Artificial Intelligence. To this end, models such as the Turing-complete differentiable neural computer (DNC) boast of real logical reasoning capabilities, along with the ability to reason beyond simple surface-level matching. In this brief, we propose the first probe into DNC's logical reasoning capabilities with a focus on text-based question answering (QA). More concretely, we propose a conceptually simple but effective adversarial attack based on metamorphic relations. Our proposed adversarial attack …
Deep Learning For Anomaly Detection: Challenges, Methods, And Opportunities, Guansong Pang, Longbing Cao, Charu Aggarwal
Deep Learning For Anomaly Detection: Challenges, Methods, And Opportunities, Guansong Pang, Longbing Cao, Charu Aggarwal
Research Collection School Of Computing and Information Systems
In this tutorial we aim to present a comprehensive survey of the advances in deep learning techniques specifically designed for anomaly detection (deep anomaly detection for short). Deep learning has gained tremendous success in transforming many data mining and machine learning tasks, but popular deep learning techniques are inapplicable to anomaly detection due to some unique characteristics of anomalies, e.g., rarity, heterogeneity, boundless nature, and prohibitively high cost of collecting large-scale anomaly data. Through this tutorial, audiences would gain a systematic overview of this area, learn the key intuitions, objective functions, underlying assumptions, advantages and disadvantages of different categories of …
Deepis: Susceptibility Estimation On Social Networks, Wenwen Xia, Yuchen Li, Jun Wu, Shenghong Li
Deepis: Susceptibility Estimation On Social Networks, Wenwen Xia, Yuchen Li, Jun Wu, Shenghong Li
Research Collection School Of Computing and Information Systems
Influence diffusion estimation is a crucial problem in social network analysis. Most prior works mainly focus on predicting the total influence spread, i.e., the expected number of influenced nodes given an initial set of active nodes (aka. seeds). However, accurate estimation of susceptibility, i.e., the probability of being influenced for each individual, is more appealing and valuable in real-world applications. Previous methods generally adopt Monte Carlo simulation or heuristic rules to estimate the influence, resulting in high computational cost or unsatisfactory estimation error when these methods are used to estimate susceptibility. In this work, we propose to leverage graph neural …
Neural Architecture Search As Sparse Supernet, Y. Wu, A. Liu, Zhiwu Huang, S. Zhang, Gool L. Van
Neural Architecture Search As Sparse Supernet, Y. Wu, A. Liu, Zhiwu Huang, S. Zhang, Gool L. Van
Research Collection School Of Computing and Information Systems
This paper aims at enlarging the problem of Neural Architecture Search (NAS) from Single-Path and Multi-Path Search to automated Mixed-Path Search. In particular, we model the NAS problem as a sparse supernet using a new continuous architecture representation with a mixture of sparsity constraints. The sparse supernet enables us to automatically achieve sparsely-mixed paths upon a compact set of nodes. To optimize the proposed sparse supernet, we exploit a hierarchical accelerated proximal gradient algorithm within a bi-level optimization framework. Extensive experiments on Convolutional Neural Network and Recurrent Neural Network search demonstrate that the proposed method is capable of searching for …
Decision-Guided Weighted Automata Extraction From Recurrent Neural Networks, Xiyue Zhang, Xiaoning Du, Xiaofei Xie, Lei Ma, Yang Liu, Meng Sun
Decision-Guided Weighted Automata Extraction From Recurrent Neural Networks, Xiyue Zhang, Xiaoning Du, Xiaofei Xie, Lei Ma, Yang Liu, Meng Sun
Research Collection School Of Computing and Information Systems
Recurrent Neural Networks (RNNs) have demonstrated their effectiveness in learning and processing sequential data (e.g., speech and natural language). However, due to the black-box nature of neural networks, understanding the decision logic of RNNs is quite challenging. Some recent progress has been made to approximate the behavior of an RNN by weighted automata. They provide better interpretability, but still suffer from poor scalability. In this paper, we propose a novel approach to extracting weighted automata with the guidance of a target RNN’s decision and context information. In particular, we identify the patterns of RNN’s step-wise predictive decisions to instruct the …
Learning To Pre-Train Graph Neural Networks, Yuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan Shi
Learning To Pre-Train Graph Neural Networks, Yuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan Shi
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) have become the de facto standard for representation learning on graphs, which derive effective node representations by recursively aggregating information from graph neighborhoods. While GNNs can be trained from scratch, pre-training GNNs to learn transferable knowledge for downstream tasks has recently been demonstrated to improve the state of the art. However, conventional GNN pre-training methods follow a two-step paradigm: 1) pre-training on abundant unlabeled data and 2) fine-tuning on downstream labeled data, between which there exists a significant gap due to the divergence of optimization objectives in the two steps. In this paper, we conduct an …
Treecaps: Tree-Based Capsule Networks For Source Code Processing, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang
Treecaps: Tree-Based Capsule Networks For Source Code Processing, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Recently program learning techniques have been proposed to process source code based on syntactical structures (e.g., Abstract Syntax Trees) and/or semantic information (e.g., Dependency Graphs). While graphs may be better at capturing various viewpoints of code semantics than trees, constructing graph inputs from code need static code semantic analysis that may not be accurate and introduces noise during learning. On the other hand, syntax trees are precisely defined according to the language grammar and easier to construct and process than graphs. We propose a new tree-based learning technique, named TreeCaps, by fusing capsule networks with tree-based convolutional neural networks, to …
Scalable Verification Of Quantized Neural Networks, Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic
Scalable Verification Of Quantized Neural Networks, Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic
Research Collection School Of Computing and Information Systems
Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, …
Unsupervised Representation Learning By Predicting Random Distances, Hu Wang, Guansong Pang, Chunhua Shen, Congbo Ma
Unsupervised Representation Learning By Predicting Random Distances, Hu Wang, Guansong Pang, Chunhua Shen, Congbo Ma
Research Collection School Of Computing and Information Systems
Deep neural networks have gained great success in a broad range of tasks due to its remarkable capability to learn semantically rich features from high-dimensional data. However, they often require large-scale labelled data to successfully learn such features, which significantly hinders their adaption in unsupervised learning tasks, such as anomaly detection and clustering, and limits their applications to critical domains where obtaining massive labelled data is prohibitively expensive. To enable unsupervised learning on those domains, in this work we propose to learn features without using any labelled data by training neural networks to predict data distances in a randomly projected …
Technical Q8a Site Answer Recommendation Via Question Boosting, Zhipeng Gao, Xin Xia, David Lo, John Grundy
Technical Q8a Site Answer Recommendation Via Question Boosting, Zhipeng Gao, Xin Xia, David Lo, John Grundy
Research Collection School Of Computing and Information Systems
Software developers have heavily used online question and answer platforms to seek help to solve their technical problems. However, a major problem with these technical Q&A sites is "answer hungriness" i.e., a large number of questions remain unanswered or unresolved, and users have to wait for a long time or painstakingly go through the provided answers with various levels of quality. To alleviate this time-consuming problem, we propose a novel DeepAns neural network-based approach to identify the most relevant answer among a set of answer candidates. Our approach follows a three-stage process: question boosting, label establishment, and answer recommendation. Given …
Theory-Inspired Path-Regularized Differential Network Architecture Search, Pan Zhou, Caiming Xiong, Richard Socher, Steven C. H. Hoi
Theory-Inspired Path-Regularized Differential Network Architecture Search, Pan Zhou, Caiming Xiong, Richard Socher, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Despite its high search efficiency, differential architecture search (DARTS) often selects network architectures with dominated skip connections which lead to performance degradation. However, theoretical understandings on this issue remain absent, hindering the development of more advanced methods in a principled way. In this work, we solve this problem by theoretically analyzing the effects of various types of operations, e.g. convolution, skip connection and zero operation, to the network optimization. We prove that the architectures with more skip connections can converge faster than the other candidates, and thus are selected by DARTS. This result, for the first time, theoretically and explicitly …
Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E
Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E
Research Collection School Of Computing and Information Systems
It is not clear yet why ADAM-alike adaptive gradient algorithms suffer from worse generalization performance than SGD despite their faster training speed. This work aims to provide understandings on this generalization gap by analyzing their local convergence behaviors. Specifically, we observe the heavy tails of gradient noise in these algorithms. This motivates us to analyze these algorithms through their Lévy-driven stochastic differential equations (SDEs) because of the similar convergence behaviors of an algorithm and its SDE. Then we establish the escaping time of these SDEs from a local basin. The result shows that (1) the escaping time of both SGD …
Watch Out! Motion Is Blurring The Vision Of Your Deep Neural Networks, Qing Guo, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jian Wang, Bing Yu, Wei Feng, Yang Liu
Watch Out! Motion Is Blurring The Vision Of Your Deep Neural Networks, Qing Guo, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jian Wang, Bing Yu, Wei Feng, Yang Liu
Research Collection School Of Computing and Information Systems
The state-of-the-art deep neural networks (DNNs) are vulnerable to adversarial examples with additive random noise-like perturbations. While such examples are hardly found in the physical world, the image blurring effect caused by object motion, on the other hand, commonly occurs in practice, making the study of which greatly important especially for the widely adopted real-time image processing tasks (e.g., object detection, tracking). In this paper, we initiate the first step to comprehensively investigate the potential hazards of blur effect for DNN, caused by object motion. We propose a novel adversarial attack method that can generate visually natural motion-blurred adversarial examples, …
Sadt: Syntax-Aware Differential Testing Of Certificate Validation In Ssl/Tls Implementations, Lili Quan, Qianyu Guo, Hongxu Chen, Xiaofei Xie, Xiaohong Li, Yang Liu, Jing Hu
Sadt: Syntax-Aware Differential Testing Of Certificate Validation In Ssl/Tls Implementations, Lili Quan, Qianyu Guo, Hongxu Chen, Xiaofei Xie, Xiaohong Li, Yang Liu, Jing Hu
Research Collection School Of Computing and Information Systems
The security assurance of SSL/TLS critically depends on the correct validation of X.509 certificates. Therefore, it is important to check whether a certificate is correctly validated by the SSL/TLS implementations. Although differential testing has been proven to be effective in finding semantic bugs, it still suffers from the following limitations: (1) The syntax of test cases cannot be correctly guaranteed. (2) Current test cases are not diverse enough to cover more implementation behaviours. This paper tackles these problems by introducing SADT, a novel syntax-aware differential testing framework for evaluating the certificate validation process in SSL/TLS implementations. We first propose a …
Audee: Automated Testing For Deep Learning Frameworks, Qianyu Guo, Xiaofei Xie, Yi Li, Xiaoyu Zhang, Yang Liu, Xiaohong Li, Chao Shen
Audee: Automated Testing For Deep Learning Frameworks, Qianyu Guo, Xiaofei Xie, Yi Li, Xiaoyu Zhang, Yang Liu, Xiaohong Li, Chao Shen
Research Collection School Of Computing and Information Systems
Deep learning (DL) has been applied widely, and the quality of DL system becomes crucial, especially for safety-critical applications. Existing work mainly focuses on the quality analysis of DL models, but lacks attention to the underlying frameworks on which all DL models depend. In this work, we propose Audee, a novel approach for testing DL frameworks and localizing bugs. Audee adopts a search-based approach and implements three different mutation strategies to generate diverse test cases by exploring combinations of model structures, parameters, weights and inputs. Audee is able to detect three types of bugs: logical bugs, crashes and Not-a-Number (NaN) …
Deepsonar: Towards Effective And Robust Detection Of Ai-Synthesized Fake Voices, Run Wang, Felix Juefei-Xu, Yihao Huang, Qing Guo, Xiaofei Xie, Lei Ma, Yang Liu
Deepsonar: Towards Effective And Robust Detection Of Ai-Synthesized Fake Voices, Run Wang, Felix Juefei-Xu, Yihao Huang, Qing Guo, Xiaofei Xie, Lei Ma, Yang Liu
Research Collection School Of Computing and Information Systems
With the recent advances in voice synthesis, AI-synthesized fake voices are indistinguishable to human ears and widely are applied to produce realistic and natural DeepFakes, exhibiting real threats to our society. However, effective and robust detectors for synthesized fake voices are still in their infancy and are not ready to fully tackle this emerging threat. In this paper, we devise a novel approach, named DeepSonar, based on monitoring neuron behaviors of speaker recognition (SR) system, i.e., a deep neural network (DNN), to discern AI-synthesized fake voices. Layer-wise neuron behaviors provide an important insight to meticulously catch the differences among inputs, …
Peer-Inspired Student Performance Prediction In Interactive Online Question Pools With Graph Neural Network, Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin. Qu
Peer-Inspired Student Performance Prediction In Interactive Online Question Pools With Graph Neural Network, Haotian Li, Huan Wei, Yong Wang, Yangqiu Song, Huamin. Qu
Research Collection School Of Computing and Information Systems
Student performance prediction is critical to online education. It can benefit many downstream tasks on online learning platforms, such as estimating dropout rates, facilitating strategic intervention, and enabling adaptive online learning. Interactive online question pools provide students with interesting interactive questions to practice their knowledge in online education. However, little research has been done on student performance prediction in interactive online question pools. Existing work on student performance prediction targets at online learning platforms with predefined course curriculum and accurate knowledge labels like MOOC platforms, but they are not able to fully model knowledge evolution of students in interactive online …
Towards Locality-Aware Meta-Learning Of Tail Node Embeddings On Networks, Zemin Liu, Wentao Zhang, Yuan Fang, Xinming Zhang, Steven C. H. Hoi
Towards Locality-Aware Meta-Learning Of Tail Node Embeddings On Networks, Zemin Liu, Wentao Zhang, Yuan Fang, Xinming Zhang, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Network embedding is an active research area due to the prevalence of network-structured data. While the state of the art often learns high-quality embedding vectors for high-degree nodes with abundant structural connectivity, the quality of the embedding vectors for low-degree or tail nodes is often suboptimal due to their limited structural connectivity. While many real-world networks are long-tailed, to date little effort has been devoted to tail node embedding. In this paper, we formulate the goal of learning tail node embeddings as a few-shot regression problem, given the few links on each tail node. In particular, since each node resides …
Amora: Black-Box Adversarial Morphing Attack, Run Wang, Felix Juefei-Xu, Qing Guo, Yihao Huang, Xiaofei Xie, Lei Ma, Yang Liu
Amora: Black-Box Adversarial Morphing Attack, Run Wang, Felix Juefei-Xu, Qing Guo, Yihao Huang, Xiaofei Xie, Lei Ma, Yang Liu
Research Collection School Of Computing and Information Systems
Nowadays, digital facial content manipulation has become ubiquitous and realistic with the success of generative adversarial networks (GANs), making face recognition (FR) systems suffer from unprecedented security concerns. In this paper, we investigate and introduce a new type of adversarial attack to evade FR systems by manipulating facial content, called adversarial morphing attack (a.k.a. Amora). In contrast to adversarial noise attack that perturbs pixel intensity values by adding human-imperceptible noise, our proposed adversarial morphing attack works at the semantic level that perturbs pixels spatially in a coherent manner. To tackle the black-box attack problem, we devise a simple yet effective …
Cats Are Not Fish: Deep Learning Testing Calls For Out-Of-Distribution Awareness, David Berend, Xiaofei Xie, Lei Ma, Lingjun Zhou, Yang Liu, Chi Xu, Jianjun Zhao
Cats Are Not Fish: Deep Learning Testing Calls For Out-Of-Distribution Awareness, David Berend, Xiaofei Xie, Lei Ma, Lingjun Zhou, Yang Liu, Chi Xu, Jianjun Zhao
Research Collection School Of Computing and Information Systems
As Deep Learning (DL) is continuously adopted in many industrial applications, its quality and reliability start to raise concerns. Similar to the traditional software development process, testing the DL software to uncover its defects at an early stage is an effective way to reduce risks after deployment. According to the fundamental assumption of deep learning, the DL software does not provide statistical guarantee and has limited capability in handling data that falls outside of its learned distribution, i.e., out-of-distribution (OOD) data. Although recent progress has been made in designing novel testing techniques for DL software, which can detect thousands of …
Social Influence Attentive Neural Network For Friend-Enhanced Recommendation, Yuanfu Lu, Ruobing Xie, Chuan Shi, Yuan Fang, Wei Wang, Xu Zhang, Leyu Lin
Social Influence Attentive Neural Network For Friend-Enhanced Recommendation, Yuanfu Lu, Ruobing Xie, Chuan Shi, Yuan Fang, Wei Wang, Xu Zhang, Leyu Lin
Research Collection School Of Computing and Information Systems
With the thriving of online social networks, there emerges a new recommendation scenario in many social apps, called FriendEnhanced Recommendation (FER) in this paper. In FER, a user is recommended with items liked/shared by his/her friends (called a friend referral circle). These friend referrals are explicitly shown to users. Different from conventional social recommendation, the unique friend referral circle in FER may significantly change the recommendation paradigm, making users to pay more attention to enhanced social factors. In this paper, we first formulate the FER problem, and propose a novel Social Influence Attentive Neural network (SIAN) solution. In order to …
Marble: Model-Based Robustness Analysis Of Stateful Deep Learning Systems, Xiaoning Du, Yi Li, Xiaofei Xie, Lei Ma, Yang Liu, Jianjun Zhao
Marble: Model-Based Robustness Analysis Of Stateful Deep Learning Systems, Xiaoning Du, Yi Li, Xiaofei Xie, Lei Ma, Yang Liu, Jianjun Zhao
Research Collection School Of Computing and Information Systems
State-of-the-art deep learning (DL) systems are vulnerable to adversarial examples, which hinders their potential adoption in safetyand security-critical scenarios. While some recent progress has been made in analyzing the robustness of feed-forward neural networks, the robustness analysis for stateful DL systems, such as recurrent neural networks (RNNs), still remains largely uncharted. In this paper, we propose Marble, a model-based approach for quantitative robustness analysis of real-world RNN-based DL systems. Marble builds a probabilistic model to compactly characterize the robustness of RNNs through abstraction. Furthermore, we propose an iterative refinement algorithm to derive a precise abstraction, which enables accurate quantification of …