HO-FMN: Hyperparameter optimization for fast minimum-norm attacks

Gradient-based attacks are a primary tool to evaluate robustness of machine-learning models. However, many attacks tend to provide overly-optimistic evaluations as they use fixed loss functions, optimizers, step-size schedulers, and default hyperparameters. In this work, we tackle these limitations by proposing a parametric variation of the well-known fast minimum-norm attack algorithm, whose loss, optimizer, step-size scheduler, and hyperparameters can be dynamically adjusted. We re-evaluate 12 robust models, showing that our attack finds smaller adversarial perturbations without requiring any additional tuning. This also enables reporting adversarial robustness as a function of the perturbation budget, providing a more complete evaluation than that offered by fixed-budget attacks, while remaining efficient. We release our open-source code at https://github.com/pralab/HO-FMN . • We improve minimum-norm attacks using different losses, optimizers, and schedulers. • We leverage hyperparameter optimization to improve the attack performance. • We compute full robustness-perturbation curves with a single, effective attack.

Authors

Institutions

Publication Details

Journal
Neurocomputing
Published
2024-11-15
DOI
https://doi.org/10.1016/j.neucom.2024.128918
Citations
3
Primary Topic
Adversarial Robustness in Machine Learning
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HO-FMN: Hyperparameter optimization for fast minimum-norm attacks

Ambra Demontis, Battista Biggio, Maura Pintor, Giorgio Piras et al.
3 citations
Neurocomputing
Adversarial Robustness in Machine Learning
1.04
article

HO-FMN: Hyperparameter optimization for fast minimum-norm attacks

Ambra Demontis, Battista Biggio, Maura Pintor, Giorgio Piras, Fabio Roli, Giorgio Giacinto, Raffaele Mura, Luca Scionis, Giuseppe Floris
article en
3 citations

Abstract

Gradient-based attacks are a primary tool to evaluate robustness of machine-learning models. However, many attacks tend to provide overly-optimistic evaluations as they use fixed loss functions, optimizers, step-size schedulers, and default hyperparameters. In this work, we tackle these limitations by proposing a parametric variation of the well-known fast minimum-norm attack algorithm, whose loss, optimizer, step-size scheduler, and hyperparameters can be dynamically adjusted. We re-evaluate 12 robust models, showing that our attack finds smaller adversarial perturbations without requiring any additional tuning. This also enables reporting adversarial robustness as a function of the perturbation budget, providing a more complete evaluation than that offered by fixed-budget attacks, while remaining efficient. We release our open-source code at https://github.com/pralab/HO-FMN . • We improve minimum-norm attacks using different losses, optimizers, and schedulers. • We leverage hyperparameter optimization to improve the attack performance. • We compute full robustness-perturbation curves with a single, effective attack.

NeurocomputingVol. 616
University of Cagliari (IT), University of Genoa (IT), Sapienza University of Rome (IT)
Climate action
Openalex Percentile: Top 18%
Adversarial Robustness in Machine Learning
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

HO-FMN: Hyperparameter optimization for fast minimum-norm attacks — Ambra Demontis, Battista Biggio, et al. · Neurocomputing (2024) | TGRS Research Map | TGRS