Adaptive Network Security Policies via Belief Aggregation and Rollout
Kim Hammar, Yuchao Li, Tansu Alpcan, Emil C. Lupu, Dimitri Bertsekas

TL;DR
This paper introduces a scalable, theoretically guaranteed method for adaptive network security policy management using belief estimation, feature-based aggregation, and rollout, which quickly adapts to system changes.
Contribution
The paper presents a novel approach combining belief estimation, offline feature-based aggregation, and online rollout for scalable, adaptive security policy computation with performance guarantees.
Findings
Outperforms state-of-the-art methods on benchmarks including CAGE-2.
Provides theoretical guarantees and efficient adaptation to system changes.
Demonstrates effectiveness through simulations and testbed results.
Abstract
Evolving security vulnerabilities and shifting operational conditions require frequent updates to network security policies. These updates include adjustments to incident response procedures and modifications to access controls, among others. Reinforcement learning methods have been proposed for automating such policy adaptations, but most methods in the research literature lack performance guarantees and adapt slowly to changes. In this paper, we address these limitations and present a method for computing security policies that is scalable, offers theoretical guarantees, and adapts quickly to changes. The method uses a model or simulator of the system, which is updated when changes occur, and combines three components: belief estimation through particle filtering, offline policy computation through feature-based aggregation, and online policy adaptation through rollout. In particular,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
