JMA: a General Algorithm to Craft Nearly Optimal Targeted Adversarial Example.
Benedetta TondiWei GuoMauro BarniPublished in: CoRR (2024)
Keyphrases
- dynamic programming
- worst case
- learning algorithm
- experimental evaluation
- cost function
- optimal solution
- k means
- improved algorithm
- special case
- computational complexity
- theoretical analysis
- closed form
- objective function
- significant improvement
- preprocessing
- np hard
- globally optimal
- computational cost
- search space
- optimization algorithm
- exhaustive search
- monte carlo
- computationally efficient
- neural network
- upper bound
- bayesian networks
- segmentation algorithm
- constraint satisfaction problems
- expectation maximization
- ant colony optimization
- high accuracy
- classification algorithm
- times faster
- convex hull
- feature selection
- optimal parameters
- optimal path