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

Erh-Chung Chen

dblp:286/4195 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
5since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Network and information security
1 paper
Security and privacy of machine learning · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › edge computing
edge inference
0.812024
Overload: Latency Attacks on Object Detection for Edge Devices · CVPR 2024
Security and privacy of machine learning
adversarial attack
0.812024
Overload: Latency Attacks on Object Detection for Edge Devices · CVPR 2024
Security and privacy of machine learning › adversarial attack › availability attack
latency attacks
0.812024
Overload: Latency Attacks on Object Detection for Edge Devices · CVPR 2024
Distributed systems › edge computing
edge deployment
0.212024
Overload: Latency Attacks on Object Detection for Edge Devices · CVPR 2024

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

spatial attention · 2.3optimization-based attack generation · 2.3
YearPublicationVenuePosition
2026 Data-Driven Lipschitz Continuity: A Cost-Effective Approach to Improve Adversarial Robustness
abstract
As deep neural networks (DNNs) are increasingly deployed in sensitive applications, ensuring their security and robustness has become critical. A major threat to DNNs arises from adversarial attacks, where small input perturbations can lead to incorrect predictions. Recent advances in adversarial training improve robustness by incorporating additional examples from external datasets or generative models. However, these methods often incur high computational costs, limiting their practicality and hindering real-world deployment. In this paper, we propose a cost-efficient alternative based on Lipschitz continuity that achieves robustness comparable to models trained with extensive supplementary data. Unlike conventional adversarial training, our method requires only a single pass over the dataset without gradient estimation, making it highly efficient. Furthermore, our method can integrate seamlessly with existing adversarial training frameworks and enhances the robustness of models without requiring extra generative data. Experimental results show that our approach not only reduces computational overhead but also maintains or improves the defensive capabilities of robust neural networks. This work opens a promising direction for developing practical, scalable defenses against adversarial attacks.
Erh-Chung Chen, I-Hsin Chung, Che-Rung Lee
WACV1
2026 LTD: Low Temperature Distillation for Gradient Masking-free Adversarial Training
abstract
Adversarial training is a widely adopted strategy to bolster the robustness of neural network models against adversarial attacks. This article revisits the fundamental assumptions underlying image classification and suggests that representing data as one-hot labels is a key factor that leads to vulnerabilities. However, in real-world datasets, data ambiguity often arises, with samples exhibiting characteristics of multiple classes, rendering one-hot label representations imprecise. To address this, we introduce a novel approach, Low-Temperature Distillation (LTD), designed to refine label representations. Unlike previous approaches, LTD incorporates a relatively low temperature in the teacher model, while maintaining a fixed temperature for the student model during both training and inference. This strategy not only refines assumptions about data distribution but also strengthens model robustness and avoids the gradient masking problem commonly encountered in defensive distillation. Experimental results demonstrate the efficacy of the proposed method when combined with existing frameworks, achieving robust accuracy rates of 58.19%, 31.13%, and 42.08% on the CIFAR-10, CIFAR-100, and ImageNet datasets, respectively, without the need for additional data.
Erh-Chung Chen, Che-Rung Lee
ACM Trans. Cyber Phys. Syst.1
2024 Latency Attack Resilience in Object Detectors: Insights from Computing Architecture
Erh-Chung Chen, I-Hsin Chung, Che-Rung Lee
ACCV (8)1
2024 Overload: Latency Attacks on Object Detection for Edge Devices
abstract
Nowadays, the deployment of deep learning-based applications is an essential task owing to the increasing demands on intelligent services. In this paper, we investigate latency attacks on deep learning applications. Unlike common adversarial attacks for misclassification, the goal of latency attacks is to increase the inference time, which may stop applications from responding to the requests within a reasonable time. This kind of attack is ubiquitous for various applications, and we use object detection to demonstrate how such kind of attacks work. We also design a framework named Overload to generate latency attacks at scale. Our method is based on a newly formulated optimization problem and a novel technique, called spatial attention. This attack serves to escalate the required computing costs during the inference time, consequently leading to an extended inference time for object detection. It presents a significant threat, especially to systems with limited computing resources. We conducted experiments using YOLOv5 models on Nvidia NX. Compared to existing methods, our method is simpler and more effective. The experimental results show that with latency attacks, the inference time of a single image can be increased ten times longer in reference to the normal setting. Moreover, our findings pose a potential new threat to all object detection tasks requiring non-maximum suppression (NMS), as our attack is NMS-agnostic.
Erh-Chung Chen, I-Hsin Chung, Che-Rung Lee
CVPR1
2024 Data filtering for efficient adversarial training
Erh-Chung Chen, Che-Rung Lee
Pattern Recognit.1
2020 Towards Fast and Robust Adversarial Training for Image Classification
Erh-Chung Chen, Che-Rung Lee
ACCV (3)1