Pith

open record

sign in

arxiv: 2306.04998 · v3 · pith:CTEJD62G · submitted 2023-06-08 · quant-ph · cs.ET

Exploring Unsupervised Anomaly Detection with Quantum Boltzmann Machines in Fraud Detection

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:CTEJD62Grecord.jsonopen to challenge →

classification quant-ph cs.ET
keywords quantumdetectionanomalyboltzmannclassicalmachinesproblemqbms
0
0 comments X
read the original abstract

Anomaly detection in Endpoint Detection and Response (EDR) is a critical task in cybersecurity programs of large companies. With rapidly growing amounts of data and the omnipresence of zero-day attacks, manual and rule-based detection techniques are no longer eligible in practice. While classical machine learning approaches to this problem exist, they frequently show unsatisfactory performance in differentiating malicious from benign anomalies. A promising approach to attain superior generalization than currently employed machine learning techniques are quantum generative models. Allowing for the largest representation of data on available quantum hardware, we investigate Quantum Annealing based Quantum Boltzmann Machines (QBMs) for the given problem. We contribute the first fully unsupervised approach for the problem of anomaly detection using QBMs and evaluate its performance on an EDR inspired synthetic dataset. Our results indicate that QBMs can outperform their classical analog (i.e., Restricted Boltzmann Machines) in terms of result quality and training steps in special cases. When employing Quantum Annealers from D-Wave Systems, we conclude that either more accurate classical simulators or substantially more QPU time is needed to conduct the necessary hyperparameter optimization allowing to replicate our simulation results on quantum hardware.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.