Login / Signup

On the hardness of evading combinations of linear classifiers.

David StevensDaniel Lowd
Published in: AISec (2013)
Keyphrases
  • linear classifiers
  • multi class
  • linear classification
  • hyperplane
  • generalization error
  • computational complexity
  • svm classifier
  • np hard
  • worst case
  • principal components
  • multi task
  • prior knowledge
  • k nearest neighbor