상세 보기
Multi-Task Learning With Self-Defined Tasks for Adversarial Robustness of Deep Networks
- Hyun, Changhun;
- Park, Hyeyoung
WEB OF SCIENCE
1SCOPUS
1초록
Despite the considerable progress made in the development of deep neural networks (DNNs), their vulnerability to adversarial attacks remains a major hindrance to their practical application. Consequently, there has been a surge of interest and investment in researching adversarial attacks and defense mechanisms, with a considerable focus on comprehending the properties of adversarial robustness. Among these intriguing studies, a couple of works show that multi-task learning can enhance the adversarial robustness of DNNs. Based on the previous works, we propose an efficient way to improve the adversarial robustness of a given main task in a more practical multi-task learning scenario by leveraging self-defined auxiliary task. The core concept of our proposed approach lies not just in jointly training predefined auxiliary tasks but in manually defining auxiliary tasks based on the built-in labels of given data, which enables users to efficiently perform multi-task learning without the need for pre-defined auxiliary tasks. The newly generated self-defined tasks remain "hidden" from attackers and serve a supplementary role in improving the adversarial accuracy of the main task. In addition, the hidden auxiliary tasks also enable to build a rejection module that utilizes predictions from the auxiliary tasks to enhance the reliability of the prediction results. Through experiments conducted on five benchmark datasets, we confirmed that multi-task learning with self-defined hidden tasks can be actively employed to enhance the adversarial robustness and reliability.
키워드
- 제목
- Multi-Task Learning With Self-Defined Tasks for Adversarial Robustness of Deep Networks
- 저자
- Hyun, Changhun; Park, Hyeyoung
- 발행일
- 2024-01
- 유형
- Article
- 저널명
- IEEE Access
- 권
- 12
- 페이지
- 83248 ~ 83259
- 언어
- ENG
- 출판사
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- 발행국가
- 미국
- 분량
- 12 페이지
- ISSN
- E 2169-3536