mlsanityData to 13 Oct 2026

Bayesian adversarial multi-node bandit for optimal smart grid protection against cyber attacks

arXiv 2104.02774 ↗First posted 20 Feb 2021cs.CR cs.LG cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

The cybersecurity of smart grids has become one of key problems in developing reliable modern power and energy systems. This paper introduces a non-stationary adversarial cost with a variation constraint for smart grids and enables us to investigate the problem of optimal smart grid protection against cyber attacks in a relatively practical scenario. In particular, a Bayesian multi-node bandit (MNB) model with adversarial costs is constructed and a new regret function is defined for this model. An algorithm called Thompson-Hedge algorithm is presented to solve the problem and the superior performance of the proposed algorithm is proven in terms of the convergence rate of the regret function. The applicability of the algorithm to real smart grid scenarios is verified and the performance of the algorithm is also demonstrated by numerical examples.

Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 6 of its 31 references that are in the map. First posted on arXiv 20 Feb 2021.

Builds on

6 of 31 references.

References · 6

  1. 2019Introduction to Multi-Armed Banditscited by 479
  2. 2013Learning to Optimize Via Posterior Samplingcited by 253
  3. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  4. 2014Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewardscited by 42
  5. 2015The Emerging Internet of Things Marketplace From an Industrial Perspective: A Surveycited by 3
  6. 2016Distributed sampled-data control of nonholonomic multi-robot systems with proximity networkscited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.