ATLAS-AL: Adaptive Trust-Region for Latent Adversarial Searches via Active Learning
cs.LG, cs.CR, cs.CV
Submitted: 2026-10-05
Updated: 2026-10-05
Comments: 9 pages main body, plus 10 additional pages for references and appendix
Code: https://github.com/csinva/gan-vae-pretrained-pytorch
License: http://creativecommons.org/licenses/by/4.0/
The gist: Security evaluation of learning-based systems requires more than just testing the system against a fixed collection of attacks.
Terminology
Abstract
Security evaluation of learning-based systems requires more than just testing the system against a fixed collection of attacks. It requires adaptive mechanisms that can efficiently discover sets of inputs that induce model failure. We introduce ATLAS (Adaptive Trust-Regions for Latent Adversarial Searches), which is a query-based framework that discovers adversarial input sets for black-box learning systems. ATLAS casts attack generation as an active learning level set estimation problem then combines calibrated approximations with a local-global sampling architecture to find regions of the input space that contain adversarial examples. Once discovered, ATLAS is designed to sample points within these adversarial regions to build adversarial sets that accurately represent the state of robustness of the target model. When applied on toy experiments, we find that ATLAS is able to recover more of the adversarial region under a limited query budget than does previous work. When applied to standard and adversarially trained MNIST, CIFAR, and ImageNet model targets, ATLAS produces better representative attacks than other query-based black-box attacks (NES, SignHunter, BayesOpt). ATLAS represents an automated red-teaming framework that can be used for both analyzing the robustness of learning-based systems under development and continuous auditing to see how the robustness of a system changes over time.
Sources
- Multi-Adversarial Safety Analysis for Autonomous Vehicles
- Large Scale GAN Training for High Fidelity Natural Image Synthesis
- Efficient Black-box Adversarial Attacks via Bayesian Optimization Guided by a Function Prior
- Explaining and Harnessing Adversarial Examples
- Adversarial Machine Learning at Scale
- The Attacker Moves Second: Stronger Adaptive Attacks Bypass Defenses Against Llm Jailbreaks and Prompt Injections
- High-dimensional Level Set Estimation with Trust Regions and Double Acquisition Functions
- Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks
- Fixing Data Augmentation to Improve Adversarial Robustness
- Black-box Adversarial Attacks with Bayesian Optimization
- Generating Adversarial Examples with Adversarial Networks
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks