Challenge: Existing large language models (LLMs) exhibit hallucinations when analyzing logs due to the implicit knowledge and rules in logs that LLMs cannot capture.
Approach: They propose a lightweight log analysis framework that generates and utilizes rules through LLMs.
Outcome: The proposed framework outperforms LLM-based methods in log parsing and anomaly detection tasks and achieves better performance compared to case-based approaches.

Similar Papers

Can LLMs Reason with Rules? Logic Scaffolding for Stress-Testing and Improving LLMs (2024.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) have impressive human-like performance across various reasoning tasks, but their mastery of underlying inferential rules falls short of human capabilities.
Approach: They propose a logic scaffolding inferential rule generation framework to construct an infer- ential rule base, ULogic, comprising both primitive and compositional rules across five domains.
Outcome: The proposed model improves the ability to generate accurate, complex and abstract conclusions and premises and improves various commonsense reasoning tasks.
GPT-Fathom: Benchmarking Large Language Models to Decipher the Evolutionary Path towards GPT-4 and Beyond (2024.findings-naacl)

Copied to clipboard

Challenge: Existing LLM leaderboards often reference scores reported in other papers without consistent settings and prompts, which may encourage cherry-picking favored settings and for better results.
Approach: They propose an open-source and reproducible LLM evaluation suite built on top of OpenAI Evals that systematically evaluates 10+ leading LLMs and OpenAI’s legacy models on 20+ curated benchmarks across 7 capability categories.
Outcome: The evaluation suite is built on top of OpenAI Evals and evaluates 10+ leading LLMs and OpenAI’s legacy models on 20+ curated benchmarks across 7 capability categories.
Demystifying the Power of Large Language Models in Graph Generation (2025.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have been used for graph discriminative tasks, but their potential for graph structure generation remains unexplored.
Approach: They propose to use LLMs to generate graphs that optimize network properties by injecting domain expertise from network science into the code.
Outcome: The proposed model generates graphs satisfying each property in different domains and compares it with established graph generative models across multiple domains.
Current Advances in LLM Reasoning (2026.acl-tutorials)

Copied to clipboard

Challenge: This tutorial examines comprehensive evaluation strategies to assess the reasoning abilities of large language models (LLMs) advanced inference time methods and post-training methods that aim to make LLMs think more like humans are discussed in this tutorial.
Approach: This tutorial explores comprehensive evaluation strategies to assess the reasoning abilities of large language models (LLMs) and discusses two types of methods to improve models’ reasoning: advanced inference time methods, structured and self-improvement inference methods, and post-training methods, such as RLHF, DPO, and GRPO.
Outcome: This tutorial examines evaluation strategies to assess the reasoning abilities of large language models and discusses two types of methods to improve models’ reasoning.
Evaluating Large Language Models via Linguistic Profiling (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) undergo extensive evaluation against various benchmarks collected in established leaderboards to assess their performance across multiple tasks.
Approach: They propose a new evaluation methodology to test LLMs' sentence generation abilities under specific linguistic constraints.
Outcome: The proposed evaluation methodology is based on the 'linguistic profiling' approach and is not intended to be a task-oriented evaluation.
Struc-Bench: Are Large Language Models Good at Generating Complex Structured Tabular Data? (2024.naacl-short)

Copied to clipboard

Challenge: Large Language Models (LLMs) have advanced capabilities but produce complex structured data.
Approach: They propose a structure-aware fine-tuning method to bolster LLMs' performance by crafting format-specific instructions from the intended outputs.
Outcome: The proposed method outperforms LLMs on all three formats and spans text tables, HTML, and LaTeX formats.
GALLa: Graph Aligned Large Language Models for Improved Source Code Understanding (2025.acl-long)

Copied to clipboard

Challenge: Programming languages have rich semantics that are represented by graphs and not available from the surface form of source code.
Approach: They propose to use graph neural networks and cross-modal alignment technologies to inject structural information of code into LLMs as an auxiliary task during finetuning.
Outcome: The proposed framework improves on five code tasks with six different baseline LLMs, while incurring no cost at inference time.
StrucText-Eval: Evaluating Large Language Model’s Reasoning Ability in Structure-Rich Text (2025.acl-long)

Copied to clipboard

Challenge: Structured data has been central to corporate data strategies for decades . however, with the advancement of large language models (LLMs), there has been a significant shift towards the effective utilization of unstructured data.
Approach: They propose an automatic evaluation data generation method to assess LLMs’ reasoning capabilities on structure-rich text.
Outcome: The proposed method supports 8 structured languages and 29 tasks, generating data with adjustable complexity through controllable nesting and structural width.
LLMBox: A Comprehensive Library for Large Language Models (2024.acl-demos)

Copied to clipboard

Challenge: a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented.
Approach: They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs).
Outcome: The proposed library is based on extensive experiments in a variety of evaluation settings.
LLM-induced Rationales for More Compact Explainable Style Classification Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for extracting explanations from complex models are based on discovering a large number of features, and this affects interpretability.
Approach: They propose a model that leverages Large Language Models and clustering algorithms to discover a compact set of interpretable features.
Outcome: The proposed model reduces the number of features on 3 Style Classification tasks by 85–99% while reducing the number by 85.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations