mlsanityData to 7 Oct 2026

Scenario-Agnostic Zero-Trust Defense with Explainable Threshold Policy: A Meta-Learning Approach

arXiv 2303.03349 ↗First posted 6 Mar 2023cs.AI cs.CRcited by 12

Not on the map. Why?

Abstract (arXiv)

The increasing connectivity and intricate remote access environment have made traditional perimeter-based network defense vulnerable. Zero trust becomes a promising approach to provide defense policies based on agent-centric trust evaluation. However, the limited observations of the agent's trace bring information asymmetry in the decision-making. To facilitate the human understanding of the policy and the technology adoption, one needs to create a zero-trust defense that is explainable to humans and adaptable to different attack scenarios. To this end, we propose a scenario-agnostic zero-trust defense based on Partially Observable Markov Decision Processes (POMDP) and first-order Meta-Learning using only a handful of sample scenarios. The framework leads to an explainable and generalizable trust-threshold defense policy. To address the distribution shift between empirical security datasets and reality, we extend the model to a robust zero-trust defense minimizing the worst-case loss. We use case studies and real-world attacks to corroborate the results.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 8 of its 24 references that are in the map. First posted on arXiv 6 Mar 2023.

Builds on

8 of 24 references.

References · 8

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  2. 2020Meta-Learning in Neural Networks: A Surveycited by 944
  3. 2017Meta-SGD: Learning to Learn Quickly for Few-Shot Learningcited by 377
  4. 2019On the Convergence Theory of Gradient-Based Model-Agnostic Meta-Learning Algorithmscited by 132
  5. 2020Curriculum in Gradient-Based Meta-Reinforcement Learningcited by 9
  6. 2021Intelligent Zero Trust Architecture for 5G/6G Networks: Principles, Challenges, and the Role of Machine Learning in the context of O-RANcited by 9
  7. 2022Sampling Attacks on Meta Reinforcement Learning: A Minimax Formulation and Complexity Analysiscited by 5
  8. 2021Cybersecurity in Robotics: Challenges, Quantitative Modeling, and Practicecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 4; 2025: 3; 2026: 3.

12 papers.