Core Concepts
Algorithms aim to ensure truthful agent behavior in online strategic classification by maximizing margin.
Abstract
The article discusses online strategic classification, focusing on agents manipulating features to achieve desired labels. New algorithms are introduced to promote truthfulness and maximize margin, outperforming previous methods.
Structure:
- Introduction to Binary Classification
- Literature Review on Strategic Agents
- Assumptions and Definitions
- Online Strategic Classification Problem
- Algorithms for Maximizing Margin and Ensuring Truthfulness
- Numerical Study Results
- Notation and Problem Setting
- Proxy Data and Algorithm Properties
Stats
The cost function takes the form cost(A, x) := c∥x − A∥
The maximum margin classifier has an optimal solution y∗ ∈ Rd \ {0}, b∗ ∈ R, and an optimal value of d* > 0.
Assumption 4: The support set for features is bounded, i.e., supA∈A ∥A∥2 < ∞.
Quotes
"Promoting truthfulness is intimately linked to obtaining adequate margin on the predictions."
"New algorithms outperform previous ones in terms of margin, number of manipulation, and number of mistakes."