(1) f3arwin requires more computational time than PGD-AT for large models (≈3× training slowdown due to population evaluation). (2) The attack may fail on models with extremely non-smooth decision boundaries where crossover becomes destructive. (3) For very high-dimensional inputs (e.g., 224×224×3), the perturbation search space remains challenging without dimensionality reduction.
$$\theta_t+1 = \theta_t - \eta \nabla_\theta \frac1 \sum \delta \in \mathcalP \textadv L(f \theta(x+\delta), y)$$ f3arwin
Integrate f3arwin with input transformations (random resizing, JPEG compression) to improve robustness to real-world distortions. Explore co-evolution of multiple models (adversarial ensemble). Reduce query budget via surrogate-assisted fitness approximation. 7. Conclusion We presented f3arwin, an evolutionary framework that unifies black-box adversarial attack and defense. By combining adaptive mutation, elite crossover, and population-based adversarial training, f3arwin achieves higher attack success rates and improved robustness compared to gradient-based and static genetic baselines. The framework underscores the value of evolutionary computation for adversarial machine learning, particularly in settings where gradients are unavailable or unreliable. f3arwin is open-sourced at https://github.com/f3arwin-lab/f3arwin (demonstration repository). References [1] Alzantot, M., Sharma, Y., Chakraborty, S., & Srivastava, M. (2019). GenAttack: Practical black-box attacks with gradient-free optimization. ACM SIGSAC Conference on Computer and Communications Security . (1) f3arwin requires more computational time than PGD-AT