Keke Tang

dblp:162/3984 · DBLP profile ↗
← Back
6ranked-venue papers in the field
2as first author
6since 2021 · last 2023
0000-0003-0377-1022ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 4 (1 first)Data Mining & Knowledge Discovery · 1 (1 first)Information Retrieval & Web Search · 1
YearPublicationVenuePosition
2023 HEPT Attack: Heuristic Perpendicular Trial for Hard-label Attacks under Limited Query Budgets
abstract
Exploring adversarial attacks on deep neural networks (DNNs) is crucial for assessing and enhancing their adversarial robustness. Among various attack types, hard-label attacks that rely only on predicted labels offer a practical approach. This paper focuses on the challenging task of hard-label attacks within an extremely limited query budget, which is a significant achievement rarely accomplished by existing methods. To tackle this, we propose an attack framework that leverages geometric information from previous perturbation directions to form triangles and employs a heuristic perpendicular trial to effectively utilize the intermediate directions. Extensive experiments validate the effectiveness of our approach under strict query constraints and demonstrate its superiority to the state-of-the-art methods.
Qi Li 0048, Keke Tang, Peican Zhu
CIKM4
2023 Matching Words for Out-of-distribution Detection
abstract
Deep neural networks often exhibit the overconfidence issue when encountering out-of-distribution (OOD) samples. To address this, leveraging large-scale pre-trained models like CLIP has shown promise. While CLIP has the capability to encode a vast array of interconnected concepts, current OOD detection methods based on it primarily focus on ID categories and a limited set of OOD categories. In this paper, we propose a novel approach that harnesses the power of WordNet to fully exploit the rich knowledge encapsulated within CLIP, resulting in enhanced OOD detection performance. Our methodology involves constructing a word tree that includes both in-distribution (ID) words and a large set of semantically similar OOD words selected from WordNet. By matching a test image with the concepts of the words in the word tree using CLIP, we estimate the probability of the image being classified as either ID or OOD. Furthermore, we introduce a conditional random field model to effectively handle both the parent-child and the sibling-sibling conflicts in the concept matching results. Extensive experiments under various ID/OOD settings demonstrate the effectiveness of our approach and its superiority over state-of-the-art methods.
Keke Tang, Xujian Cai, Weilong Peng, Daizong Liu, Peican Zhu, Pan Zhou 0001, Zhihong Tian 0001, Wenping Wang 0001
ICDM1
2023 DBA: An Efficient Approach to Boost Transfer-Based Adversarial Attack Performance Through Information Deletion
Zepeng Fan, Peican Zhu, Chao Gao 0001, Jinbang Hong, Keke Tang
KSEM (2)5
2023 Enhancing Adversarial Robustness via Anomaly-aware Adversarial Training
Keke Tang, Tianrui Lou, Yawen Shi, Peican Zhu, Zhaoquan Gu
KSEM (1)1
2023 Unsupervised feature selection through combining graph learning and ℓ2,0-norm constraint
Peican Zhu, Keke Tang, Yang Liu 0144, Yin-Ping Zhao, Zhen Wang 0004
Inf. Sci.3
2022 GM-Attack: Improving the Transferability of Adversarial Attacks
Jinbang Hong, Keke Tang, Chao Gao 0001, Songxin Wang, Sensen Guo, Peican Zhu
KSEM (3)2