PERO: Efficient Robust Post-Training Foundation Models for Encrypted Traffic Classification
Not on the map. Why?
Abstract (arXiv)
Encrypted traffic classification is vital for network security, yet real-world deployments are inherently sensitive to rare but high-loss errors such as misclassification of malicious traffic. The encrypted traffic foundation model, as a promising general-purpose technique, can achieve impressive overall performance. However, employing standard objectives such as empirical risk minimization often overlooks high-risk tail events, and commonly used performance metrics hardly reflect robustness limitations in risk-sensitive scenarios. Directly applying robust optimization objectives, such as conditional value-at-risk, to post-training is computationally prohibitive for large models, as identifying high-loss samples exhausts substantial computation. To this end, we propose Pre-Evaluation Robust Optimization (PERO), an efficient robust post-training framework for encrypted traffic foundation models. PERO employs a lightweight proxy to estimate sample-wise risk and selects a subset of high-risk samples to update the foundation model, decoupling risk estimation from expensive large-model optimization. Extensive experiments on typical encrypted traffic datasets show that PERO achieves competitive or superior robustness and average performance compared to outstanding robust post-training methods, while significantly reducing computational and memory costs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 65 references that are in the map. First posted on arXiv 16 Aug 2026.
Builds on
23 of 65 references.
References · 23
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2014Optimizing the CVaR via Samplingcited by 99
- 2017Deep Packet: A Novel Approach For Encrypted Traffic Classification Using Deep Learningcited by 70
- 2022ET-BERT: A Contextualized Datagram Representation with Pre-training Transformers for Encrypted Traffic Classificationcited by 66
- 2025Can Prompt Difficulty be Online Predicted for Accelerating RL Finetuning of Reasoning Models?cited by 52
- 2025Unveiling Causal Reasoning in Large Language Models: Reality or Mirage?cited by 38
- 2025FlyLoRA: Boosting Task Decoupling and Parameter Efficiency via Implicit Rank-Wise Mixture-of-Expertscited by 35
- 2024NetMamba: Efficient Network Traffic Classification via Pre-training Unidirectional Mambacited by 24
- 2025Model Predictive Task Sampling for Efficient and Robust Adaptationcited by 21
- 2025Utility-Diversity Aware Online Batch Selection for LLM Supervised Fine-tuningcited by 15
- 2022The Effect of Diversity in Meta-Learningcited by 14
- 2023TFE-GNN: A Temporal Fusion Encoder Using Graph Neural Networks for Fine-grained Encrypted Traffic Classificationcited by 13
11 more
- 2024Robust Fast Adaptation from Adversarially Explicit Task Distribution Generationcited by 13
- 2025Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environmentscited by 12
- 2026Dynamics-Predictive Sampling for Active RL Finetuning of Large Reasoning Modelscited by 11
- 2023A Simple Yet Effective Strategy to Robustify the Meta Learning Paradigmcited by 10
- 2026TRACE: A Unified Rollout Budget Allocation Framework for Efficient Agentic Reinforcement Learningcited by 10
- 2022Machine Learning for Encrypted Malicious Traffic Detection: Approaches, Datasets and Comparative Studycited by 6
- 2024Theoretical Investigations and Practical Enhancements on Tail Task Risk Minimization in Meta Learningcited by 4
- 2025Transformer-Based Spatial-Temporal Counterfactual Outcomes Estimationcited by 4
- 2025Improved Stochastic Optimization of LogSumExpcited by 4
- 2025Breaking the Gradient Barrier: Unveiling Large Language Models for Strategic Classificationcited by 4
- 2025FastFlow: Early Yet Robust Network Flow Classification using the Minimal Number of Time-Series Packetscited by 3
Built on by
Not cited yet.