REVIEW 2 cited by
LogLLaMA: Transformer-based log anomaly detection with LLaMA
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
LogLLaMA: Transformer-based log anomaly detection with LLaMA
read the original abstract
Log anomaly detection refers to the task that distinguishes the anomalous log messages from normal log messages. Transformer-based large language models (LLMs) are becoming popular for log anomaly detection because of their superb ability to understand complex and long language patterns. In this paper, we propose LogLLaMA, a novel framework that leverages LLaMA2. LogLLaMA is first finetuned on normal log messages from three large-scale datasets to learn their patterns. After finetuning, the model is capable of generating successive log messages given previous log messages. Our generative model is further trained to identify anomalous log messages using reinforcement learning (RL). The experimental results show that LogLLaMA outperforms the state-of-the-art approaches for anomaly detection on BGL, Thunderbird, and HDFS datasets.
Forward citations
Cited by 2 Pith papers
-
LogNEO: A GPT-Neo Reinforcement Learning Framework for Accurate Real-Time Log Anomaly Detection
LogNEO applies PPO to GPT-Neo with a partial-credit exponentially decaying position-aware reward to reach F1 scores of 0.927/0.913/0.984 on HDFS/BGL/Thunderbird while running at production speeds.
-
NLLog: Lightweight, Explainable SOC Anomaly Detection via Log-to-Language Rewriting
NLLog rewrites log templates into WHO-WHAT-SEVERITY sentences, applies TF-IDF pooling and tree-ensemble classification with TreeSHAP back-projection, and reports better performance than two reproduced baselines on HDF...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.