paper-with-me

홈 › Papers

GAT: Guided Adversarial Training with Pareto-optimal Auxiliary Tasks

2023-02-06 · Salah Ghamizi, Jingfeng Zhang, Maxime Cordy, Mike Papadakis, Masashi Sugiyama, Yves Le Traon

While leveraging additional training data is well established to improve adversarial robustness, it incurs the unavoidable cost of data collection and the heavy computation to train models. To mitigate the costs, we propose Guided Adversarial Training (GAT), a novel adversarial training technique that exploits auxiliary tasks under a limited set of training data. Our approach extends single-task models into multi-task models during the min-max optimization of adversarial training, and drives the loss optimization with a regularization of the gradient curvature across multiple tasks. GAT leverages two types of auxiliary tasks: self-supervised tasks, where the labels are generated automatically, and domain-knowledge tasks, where human experts provide additional labels. Experimentally, GAT increases the robust AUC of CheXpert medical imaging dataset from 50% to 83% and On CIFAR-10, GAT outperforms eight state-of-the-art adversarial training and achieves 56.21% robust accuracy with Resnet-50. Overall, we demonstrate that guided multi-task learning is an actionable and promising avenue to push further the boundaries of model robustness.

📄 PDF Abstract BibTeX arXiv:2302.02907

Code (1)

yamizi/taskaugment 공식 구현 pytorch

Tasks

Adversarial RobustnessData AugmentationMulti-Task Learning

Methods 이 논문이 사용한 방법론

GAT A Graph Attention Network (GAT) is a neural network architecture that operates on graph-structured data, leveraging masked self-attentional layers to address the shortcomings…

Similar Papers 제목 키워드 기반

Towards Pareto-Optimal Tool-Integrated Agents with Pareto Ranking Policy Optimization

2026-06-15 · Junyi Li, Xiaowei Qian, Yingyi Zhang, Wenlin Zhang 외 arxiv

Recent advances in tool-integrated language agents have significantly improved their ability to solve complex reasoning tasks. However, existing alignment methods predominantly focus on maximizing task accuracy, while ov…

Pareto Regret Analyses in Multi-objective Multi-armed Bandit

2022-12-01 · Mengfan Xu, Diego Klabjan

We study Pareto optimality in multi-objective multi-armed bandit by providing a formulation of adversarial multi-objective multi-armed bandit and defining its Pareto regrets that can be applied to both stochastic and adv…

Adversarial Attack

Preference-Guided Diffusion for Multi-Objective Offline Optimization

2025-03-21 · Yashas Annadani, Syrine Belakaria, Stefano Ermon, Stefan Bauer 외

Offline multi-objective optimization aims to identify Pareto-optimal solutions given a dataset of designs and their objective values. In this work, we propose a preference-guided diffusion model that generates Pareto-opt…

Diversity

Pareto Adversarial Robustness: Balancing Spatial Robustness and Sensitivity-based Robustness

2021-11-03 · Ke Sun, Mingjie Li, Zhouchen Lin

Adversarial robustness, which primarily comprises sensitivity-based robustness and spatial robustness, plays an integral part in achieving robust generalization. In this paper, we endeavor to design strategies to achieve…

Adversarial RobustnessSensitivity

Pareto Self-Supervised Training for Few-Shot Learning

2021-04-16 · CVPR 2021 1 · Zhengyu Chen, Jixie Ge, Heshen Zhan, Siteng Huang 외

While few-shot learning (FSL) aims for rapid generalization to new concepts with little supervision, self-supervised learning (SSL) constructs supervisory signals directly computed from unlabeled data. Exploiting the com…

Auxiliary LearningFew-Shot LearningInductive BiasSelf-Supervised Learning