TL;DR
The paper introduces FLORAL (Flipping Labels for Adversarial Learning), a novel defense framework designed to protect machine learning models against malicious label poisoning attacks. By framing the defense as a non-zero-sum Stackelberg game using kernel Support Vector Machines (SVMs), FLORAL strategically counters adversaries who flip critical training labels. The method consistently outperforms standard robust baselines and foundation models like RoBERTa, maintaining high classification accuracy even under severe data corruption.
What Problem Does This Paper Address?
Modern machine learning models increasingly rely on massive, publicly sourced, or human-annotated datasets. This reliance exposes them to label poisoning attacks, where an adversary subtly flips or manipulates training labels to degrade the model's downstream performance.
While conventional adversarial training (AT) is highly effective against feature perturbations (e.g., changing pixels in an image), it falls short against label poisoning. Feature attacks typically disrupt models locally near the decision boundary. In contrast, label attacks cause widespread, global disruptions across the entire input space. Furthermore, standard zero-sum minimax defense formulations fail because they mistakenly focus on protecting outliers (points with the largest hinge loss) rather than the critical points that actually define the decision boundary.
Methods
The authors introduce FLORAL, which reformulates adversarial training against label poisoning as a bilevel optimization problem structured as a non-zero-sum Stackelberg game between the model and an attacker:
- The Attacker's Strategy (Inner Loop): Instead of guessing randomly, the attacker leverages the model's dual parameters ($\lambda$) from a kernel SVM to identify the most influential training points (the support vectors). It then applies a randomized top-$k$ rule to flip the labels of these critical boundary-defining points.
- The Model's Defense (Outer Loop): The model updates its parameters using Projected Gradient Descent (PGD) to minimize its worst-case loss on this dynamically poisoned data.
To make this computationally viable for large-scale applications, the authors develop a highly efficient projection algorithm based on a fixed-point iteration strategy (PROJECTIONVIAFIXEDPOINTITERATION), avoiding the need to solve expensive quadratic programs at every step. Additionally, FLORAL is highly adaptable; it can protect deep neural networks (like RoBERTa) by acting as a robust classifier head operating on top of extracted last-layer embeddings.
Datasets
The framework was evaluated across three distinct classification tasks:
- Moon Dataset: A synthetic 2D binary classification dataset (2,000 samples) used to visualize decision boundaries under varying poisoning levels (5% to 25%).
- IMDB Dataset: A benchmark text dataset for sentiment analysis (50,000 reviews). The authors extracted 768-dimensional embeddings from a fine-tuned RoBERTa model to evaluate FLORAL as a robust classifier head under heavy poisoning (up to 40%).
- MNIST (1vs7): A subset of the classic handwritten digits dataset focusing on distinguishing the visually similar digits
1and7(13,007 samples).
Key Insights and Ideas
- Targeting the Support Vectors: The core "aha moment" is that an effective label-poisoning defense must safeguard the decision boundary's shape. By utilizing SVM dual variables, FLORAL directly identifies and defends the exact training points that dictate this boundary.
- Implicit Data Sanitization: FLORAL does not just passively resist attacks; it actively "heals" the dataset. When trained on already corrupted data, the algorithm naturally identifies and implicitly sanitizes 25% to 35% of the poisoned labels during the training process.
- The Power of Non-Zero-Sum Games: Moving away from standard zero-sum formulations allows the framework to align more closely with the true objectives of both the attacker (maximizing classification error) and the defender (maximizing robust accuracy), leading to much more stable convergence.
Key Results
FLORAL demonstrated superior robustness compared to vanilla SVMs, standard neural networks, and specialized filtering defenses (like Curie and LS-SVM):
- Foundation Model Enhancement (IMDB): Under a massive 40% label poisoning attack, a standard fine-tuned RoBERTa model's accuracy plummeted to 77.17%. When integrated with FLORAL, the model maintained a robust test accuracy of 86.36%.
- Synthetic Clean vs. Poisoned Performance (Moon): At 25% poisoning, FLORAL achieved 80.1% peak accuracy, outperforming vanilla SVM (75.3%) and standard neural networks (69.3%), while matching clean data performance when no attack was present.
- Smoother Decision Boundaries: Qualitative evaluations showed that FLORAL preserves a smooth, generalized decision boundary under attack, whereas baseline methods suffer from severe boundary distortion.
Limitations and Future Work
The authors acknowledge a few limitations:
- White-Box Assumption: The defense formulation assumes a strong adversary with access to model parameters to compute influential points, though they note it remains effective in black-box scenarios via transferability.
- Attack Specificity: While generalizable to several prominent attacks from literature (like alfa and LFA), its defensive efficacy can still vary depending on the exact nature of an unobserved, non-adaptive attack.
Future Directions: The authors suggest exploring SVM-based transfer attacks, extending the framework to multi-class foundation model fine-tuning, and conducting deeper analyses into how FLORAL alters the geometric distribution of influential training points.
Summary updated