Neural network verification has become a key tool for providing formal guarantees on the behaviour of neural networks. However, many verification problems remain computationally intractable in the worst case: even for common adversarial robustness specifications, verification is NP-complete. Here, we explore the applic...
Annelot W. Bosman, Ming-Hao Liu, Marta Z. Kwiatkowska et al.· 0 citations
It is discovered that TabPFN is more robust than all baselines on synthetic data under single-step FGSM attacks for moderate-to-large perturbation budgets, but that this advantage largely disappears under iterative PGD, suggesting that TabPFN’s gradient landscape obstructs single-step attacks.
W. Scholten, J. V. van Rijn, Holger H. Hoos· 0 citations
This work presents LACE, an AutoML framework that instead searches over complete executable pipeline programs: an evolutionary loop maintains a population of scikit-learn-compatible Python classes, and a large language model acts as the variation operator.
Sofoklis Kitharidis, C. Veenman, J. V. van Rijn et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.