A Game-Theoretic Approach to Design Secure and Resilient Distributed Support Vector Machines

TL;DR

This paper introduces a game-theoretic framework for designing secure and resilient distributed support vector machines (DSVM) capable of withstanding adversarial data manipulation in networked systems.

Contribution

It develops a novel game-theoretic approach to model adversarial interactions and guarantees convergence of distributed algorithms without restrictive assumptions.

Findings

Network topology influences DSVM security, with fewer nodes and higher degrees being more secure.

Balanced networks are less vulnerable to attacks.

The proposed algorithms converge reliably in adversarial environments.

Abstract

Distributed Support Vector Machines (DSVM) have been developed to solve large-scale classification problems in networked systems with a large number of sensors and control units. However, the systems become more vulnerable as detection and defense are increasingly difficult and expensive. This work aims to develop secure and resilient DSVM algorithms under adversarial environments in which an attacker can manipulate the training data to achieve his objective. We establish a game-theoretic framework to capture the conflicting interests between an adversary and a set of distributed data processing units. The Nash equilibrium of the game allows predicting the outcome of learning algorithms in adversarial environments, and enhancing the resilience of the machine learning through dynamic distributed learning algorithms. We prove that the convergence of the distributed algorithm is guaranteed without assumptions on the training data or network topologies. Numerical experiments are conducted to corroborate the results. We show that network topology plays an important role in the security of DSVM. Networks with fewer nodes and higher average degrees are more secure. Moreover, a balanced network is found to be less vulnerable to attacks.