A Way to Explore the Lower Bound of Adversarial Perturbation.
Keji HanYuxuan BaiYun LiPublished in: BigComp (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- np hard
- lower and upper bounds
- branch and bound
- objective function
- perturbation method
- website
- multi agent
- database systems
- search engine
- data mining
- lower bounding
- sufficiently accurate
- database
- search algorithm
- active learning
- learning algorithm
- lagrangian relaxation
- competitive ratio