Cited by 4Software System Performance and ReliabilityTopic ModelingSoftware Engineering Research

The Effectiveness of Compact Fine-Tuned LLMs in Log Parsing

Mehrabi, Maryam, Hamou-Lhadj, Abdelwahab, Moosavi, Hossein·2024·2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)

Abstract

Log parsing is defined as the process of extracting structured information from unstructured log data. It is an important step prior to many log analytics tasks. The emergence of Large Language Models (LLMs), like Generative Pre-trained Transformers (GPTs), has driven the development of novel log parsing methods. Existing studies have examined the effectiveness of large-scale general-purpose LLMs in log parsing. In this paper, we argue that the long-term adoption of such LLMs pose challenges of data privacy, cost, and tool integration. To address these challenges, we explore the viability of supervised fine-tuning of an open-source compact LLM for log parsing as a prospective alternative. To this end, we fine-tune the Mistral-7B-Instruct LLM on a diverse set of log files and evaluate its performance, in terms of both accuracy and robustness, against OpenAI's GPT-4-Turbo using different configuration settings. We apply two evaluation approaches, namely metric-based and LLM-based. Our overall findings show that fine-tuning a compact LLM such as Mistral-7B provides similar and sometimes better results than using a large-scale LLM, in our case GPT-4-Turbo. These findings are important because they enable companies to use a smaller LLM that they can readily adapt to parsing their log data, and integrate into their log analytics tools, without the need to rely on third-party LLM providers.

Integrity signals

Registry

Crossref · 10.1109/icsme58944.2024.00047

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Heuristic parsing methods such as regular expressions are brittle, error-prone, and require frequent updates as systems evolve.

    “While heuristic parsing methods such as regular expressions have traditionally been employed to segment log entries into templates, they are brittle, errorprone, and require frequent updates as systems evolve [16].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Mehrabi, M., Hamou-Lhadj, A., & Moosavi, H.
Affiliations
  • Concordia University (CA)
  • Concordia University,ECE,Montreal,QC,Canada
  • Cisco Systems (Canada) (CA)
Venue
2024 IEEE International Conference on Software Maintenance and Evolution (ICSME)
Publisher
IEEE
Published
2024-10-06
Pages
438-448
ISSN
1063-6773 (ISSN-L)
OpenAlex
W4405601572
Cited by
4
References
7
Citations by year
2026: 2 · 2025: 2
FWCI
1.75
Type
conference paper
Language
en
Open access
closed
Locations
IEEE International Conference on Software Maintenance (ICSM) (publishedVersion)
Funders
  • Canadian Department of National Defence
  • Natural Sciences and Engineering Research Council of Canada
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
Keywords
log parsing, log analysis, supervised fine-tuning, Mistral-7B-Instruct, GPT-4 Turbo, structured data extraction, LLM-based evaluation, data privacy, tool integration

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review