Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Erling Jiang

dblp:325/9442 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
5since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Trustworthy machine learning · 55% 3D vision · 39% Time series and sequential data · 7%
Network and information security
2 papers
Security and privacy of machine learning · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
1.422024
CausalPC: Improving the Robustness of Point Cloud Classification by Causal Effect Identification · CVPR 2024
CAP: Robust Point Cloud Classification via Semantic and Structural Modeling · CVPR 2023
Computer vision › 3D vision › point cloud analysis
point cloud classification
1.422024
CausalPC: Improving the Robustness of Point Cloud Classification by Causal Effect Identification · CVPR 2024
CAP: Robust Point Cloud Classification via Semantic and Structural Modeling · CVPR 2023
Machine learning › Trustworthy machine learning › adversarial machine learning
adversarial defense
0.812024
CausalPC: Improving the Robustness of Point Cloud Classification by Causal Effect Identification · CVPR 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
CausalPC: Improving the Robustness of Point Cloud Classification by Causal Effect Identification · CVPR 2024
Computer vision › 3D vision › point cloud analysis › point cloud classification
robust point cloud classification
0.712023
CAP: Robust Point Cloud Classification via Semantic and Structural Modeling · CVPR 2023
Security and privacy of machine learning
adversarial attack
0.712023
Black-Box Adversarial Attack on Time Series Classification · AAAI 2023
Security and privacy of machine learning › adversarial attack
backdoor attack
0.612022
Towards Backdoor Attack on Deep Learning based Time Series Classification · ICDE 2022
Machine learning › Time series and sequential data › time series analysis
time series classification
0.422023
Black-Box Adversarial Attack on Time Series Classification · AAAI 2023
Towards Backdoor Attack on Deep Learning based Time Series Classification · ICDE 2022

Methods — techniques the papers use, named apart from their topics

tree search · 1.3black-box gradient estimation · 1.3iterative learning · 1.1constrained multi-objective optimization · 1.1causal modeling · 0.8causal effect identification · 0.8robustness certification · 0.7dynamic contrastive learning · 0.7attention-based pooling · 0.7
YearPublicationVenuePosition
2024 CausalPC: Improving the Robustness of Point Cloud Classification by Causal Effect Identification
abstract
Deep neural networks have demonstrated remarkable performance in point cloud classification. However, pre-vious works show they are vulnerable to adversarial per-turbations that can manipulate their predictions. Given the distinctive modality of point clouds, various attack strategies have emerged, posing challenges for existing defenses to achieve effective generalization. In this study, we for the first time introduce causal modeling to enhance the robustness of point cloud classification models. Our insight is from the observation that adversarial examples closely re-semble benign point clouds from the human perspective. In our causal modeling, we incorporate two critical variables, the structural information, (standing for the key feature leading to the classification) and the hidden confounders, (standing for the noise interfering with the classification). The resulting overall framework CausalPC consists of three sub-modules to identify the causal effect for robust classification. The framework is model-agnostic and adaptable for integration with various point cloud classifiers. Our approach significantly improves the adversarial robustness of three mainstream point cloud classification models on two benchmark datasets. For instance, the classification accuracy for DGCNN on ModelNet40 increases from 29.2% to 72.0% with CausalPC, whereas the best-performing base-line achieves only 42.4%.
Yuanmin Huang 0001, Mi Zhang 0001, Daizong Ding, Erling Jiang, Zhaoxiang Wang, Min Yang 0002
CVPR4
2024 Towards Detection-Recovery Strategy for Robust Decentralized Matrix Factorization
Yuanmin Huang 0001, Mi Zhang 0001, Daizong Ding, Erling Jiang, Qifan Xiao, Xiaoyu You, Min Yang 0002
ESORICS (1)4
2023 Black-Box Adversarial Attack on Time Series Classification
abstract
With the increasing use of deep neural network (DNN) in time series classification (TSC), recent work reveals the threat of adversarial attack, where the adversary can construct adversarial examples to cause model mistakes. However, existing researches on the adversarial attack of TSC typically adopt an unrealistic white-box setting with model details transparent to the adversary. In this work, we study a more rigorous black-box setting with attack detection applied, which restricts gradient access and requires the adversarial example to be also stealthy. Theoretical analyses reveal that the key lies in: estimating black-box gradient with diversity and non-convexity of TSC models resolved, and restricting the l0 norm of the perturbation to construct adversarial samples. Towards this end, we propose a new framework named BlackTreeS, which solves the hard optimization issue for adversarial example construction with two simple yet effective modules. In particular, we propose a tree search strategy to find influential positions in a sequence, and independently estimate the black-box gradients for these positions. Extensive experiments on three real-world TSC datasets and five DNN based models validate the effectiveness of BlackTreeS, e.g., it improves the attack success rate from 19.3% to 27.3%, and decreases the detection success rate from 90.9% to 6.8% for LSTM on the UWave dataset.
Daizong Ding, Mi Zhang 0001, Fuli Feng, Yuanmin Huang 0001, Erling Jiang, Min Yang 0002
AAAI5
2023 CAP: Robust Point Cloud Classification via Semantic and Structural Modeling
abstract
Recently, deep neural networks have shown great success on 3D point cloud classification tasks, which simultaneously raises the concern of adversarial attacks that cause severe damage to real-world applications. Moreover, defending against adversarial examples in point cloud data is extremely difficult due to the emergence of various attack strategies. In this work, with the insight of the fact that the adversarial examples in this task still preserve the same semantic and structural information as the original input, we design a novel defense framework for improving the robustness of existing classification models, which consists of two main modules: the attention-based pooling and the dynamic contrastive learning. In addition, we also develop an algorithm to theoretically certify the robustness of the proposed framework. Extensive empirical results on two datasets and three classification models show the robustness of our approach against various attacks, e.g., the averaged attack success rate of PointNet decreases from 70.2% to 2.7% on the ModelNet40 dataset under 9 common attacks.
Daizong Ding, Erling Jiang, Yuanmin Huang 0001, Mi Zhang 0001, Min Yang 0002
CVPR2
2022 Towards Backdoor Attack on Deep Learning based Time Series Classification
abstract
As a fundamental task in modern data mining, time series classification is powering mission-critical tasks including stock price prediction and network traffic analysis. Due to the non-linear structure of deep neural networks (DNN), deep learning has established as a promising solution to time series classification. However, the excessive learning capacity of DNNs may make them prone to threats of backdoor attacks, where an attacker embeds hidden functionalities (i.e., backdoor) to DNNs and activates the backdoor by specially-designed inputs (i.e., triggers). Despite extensive studies concerning backdoor attacks on image and text domains, there is little known about the vulnerability of DNN based time series classifiers against backdoor attacks. Due to the unique characteristics of time series data, most existing backdoor attack techniques fail to threaten time series classifiers. In this paper, through analyzing the key factors which influence the effectiveness of a backdoor, we systematize a list of practical principles for designing triggers on time series data. In this light, we propose a novel framework called TimeTrojan, which aims to learn to form the trigger pattern through a constrained multi-objective optimization. To solve the hereafter challenging optimization issue, we further design an iterative learning algorithm. Remarkably, the proposed framework is agnostic to a wide range of DNN classifiers. Extensive empirical results on 6 representative DNN classifiers and 6 real-world datasets validate the effectiveness of the proposed attack framework. In most cases, TimeTrojan successfully injects backdoors with 100% attack success rate without affecting the model accuracy on clean samples, which implies the complete control of the behavior of the DNN classifiers by the adversary.
Daizong Ding, Mi Zhang 0001, Yuanmin Huang 0001, Xudong Pan, Fuli Feng, Erling Jiang, Min Yang 0002
ICDE6