TAILOR, a log parsing framework that improves template inference for rare log groups through template-preserving augmentation, is proposed and experimental results show that TAILOR improves parsing accuracy on rare log groups by 19% over the strongest baseline while maintaining competitive performance on complete datasets.
Abstract
Log parsing is essential for system log analysis because it supports tasks such as debugging, monitoring, and anomaly detection by transforming unstructured log messages into structured log templates. However, real-world log datasets exhibit highly imbalanced, long-tailed distributions, where a small number of frequent templates dominate while many rare templates appear only a few times. This imbalance causes evaluation results to be overly optimistic by allowing frequent templates to dominate benchmark metrics, while poor performance on rare yet operationally important events remains largely hidden. In this paper, we investigate the prevalence and impact of rare log groups, defined as log groups with fewer than five instances. Our empirical study on the widely used Loghub-2.0 benchmark shows that rare log groups account for nearly 20% of all templates but less than 0.01% of log messages. Because they contain only a handful of instances, all evaluated parsers experience substantial performance degradation on these groups. To address this challenge, we propose TAILOR, a log parsing framework that improves template inference for rare log groups through template-preserving augmentation. TAILOR enriches rare log groups with template- consistent log messages before template inference. The additional structural evidence helps distinguish static tokens from dynamic variables. Our experimental results show that TAILOR improves parsing accuracy on rare log groups by 19% over the strongest baseline while maintaining competitive performance on complete datasets. We further show that the proposed augmentation strategy generalizes across different LLM backbones and consistently improves existing LLM-based parsers without modifying their core architectures.
System log anomaly detection (LogAD) requires balancing detection quality, interpretability, and deployment efficiency. While deep learning approaches achieve strong performance, they often rely on large labeled datasets and lack transparency. Recent large language model (LLM)-based methods improve reasoning but introd...
Large AI models increasingly rely on distributed GPU execution, yet it remains unclear whether established anomaly detection methods transfer effectively to this setting. We introduce GF-Bench, a PyTorch-based framework and dataset for generating controlled failures in distributed GPU workloads. The framework supports...
Bo-Yuan Cui, Yu-Yang Zeng, Yi-Fang Tian et al.· Proceedings of the 1st Inter...· 0 citations
Together, these findings connect detector comparisons to the test population, preprocessing state, visible information, and measured pipeline stages, and identify the protocol fields needed alongside a score to support interpretable comparisons of log anomaly detection accuracy and resource use.
Hang Xiao, Janet Sung, Zhao-Yi Li et al.· 0 citations
A scalable framework that leverages LLMs as data translators to bridge the gap between unstructured textual resources and structured event data is proposed, and finetuning LLMs on a newly created text-to-log dataset shows that the resulting models can extract high-fidelity event logs from unstructured resources.
Maximilian Seeth, G. Tavares, Daniel Schuster· 0 citations
A survey of 50 binary type inference tools highlights recent progress, especially in learning-based methods, but also reveals ongoing limitations, which include limited scalability, lack of standardized output formats, and poor support for dynamically typed languages.
Raisul Arefin, Ryan Vrecenar, Samuel Mulder· International Conference on...· 0 citations