2006
NIPS
NeurIPS 2006
Optimal Single-Class Classification Strategies
Abstract
We consider single-class classification (SCC) as a two-person game between the learner and an adversary. In this game the target distribution is completely known to the learner and the learner's goal is to construct a classifier capable of guaranteeing a given tolerance for the false-positive error while minimizing the false negative error. We identify both "hard" and "soft" optimal classification strategies for different types of games and demonstrate that soft classification can provide a significant advantage. Our optimal strategies and bounds provide worst-case lower bounds for standard, finite-sample SCC and also motivate new approaches to solving SCC.
🚀
Conference Pioneer
— NIPS 2006
🌱
Topic Pioneer
— Adversarial Learning
🌉
Interdisciplinary Bridge
— Artificial Intelligence and Machine Learning
📈
Trend Setter
— Game AI
🧭
Keyword Pioneer
— adversarial learning
🐣
Hot Topic Early Bird
— adversarial learning
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio