Exploring Sparsity and Smoothness of Arbitrary Lp Norms in Adversarial Attacks
cs.LG, cs.AI
Submitted: 2026-02-06
Updated: 2026-09-17
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- GreedyPixel: Fine-Grained Black-Box Adversarial Attack Via Greedy Algorithm
- Should Adversarial Attacks Use Pixel p-Norm?
- DASH: A Meta-Attack Framework for Synthesizing Effective and Stealthy Adversarial Examples
- A Versatile Framework for Designing Group-Sparse Adversarial Attacks
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: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks