Robust Online Learning against Malicious Manipulation with Application to Network Flow Classification
Yupeng Li, Ben Liang, Ali Tizghadam
Abstract
Malicious data manipulation reduces the effectiveness of machine learning techniques, which rely on accurate knowledge of the input data. Motivated by real-world applications in network flow classification, we address the problem of robust online learning with delayed feedback in the presence of malicious data generators that attempt to gain favorable classification outcome by manipulating the data features. We propose online algorithms termed ROLC-NC and ROLC-C when the malicious data generators are non-clairvoyant and clairvoyant, respectively. We derive regret bounds for both algorithms and show that they are sub-linear under mild conditions. We further evaluate the proposed algorithms in network flow classification via extensive experiments using real-world data traces. Our experimental results demonstrate that both algorithms can approach the performance of an optimal static offline classifier that is not under attack, while outperforming the same offline classifier when tested with a mixture of normal and manipulated data.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- Unconstrained Robust Online Convex OptimizationJiujia Zhang, Ashok CutkoskyICML 2025
- Online Strategic Classification With Noise and Partial FeedbackTianrun Zhao, Xiaojie Mao, Yong LiangNeurIPS 2025 · 1 citation
- Augment Online Linear Optimization with Arbitrarily Bad Machine-Learned PredictionsDacheng Wen, Yupeng Li, Francis C. M. LauINFOCOM 2024 · 5 citations
- Near-Optimal Online Learning with Non-Stochastic and Unbounded Erroneous FeedbackDacheng Wen, Yupeng Li, Francis C. M. Lau, Tian Wang et al.INFOCOM 2026
- Strategic Littlestone Dimension: Improved Bounds on Online Strategic ClassificationSaba Ahmadi, Kunhe Yang, Hanrui ZhangNeurIPS 2024 · 9 citations
