Efficient Hierarchical Transformers for Representing Log Data
cs.LG, cs.AI
Submitted: 2024-08-29
Updated: 2026-10-02
License: http://creativecommons.org/licenses/by/4.0/
The gist: Transformers have gained widespread acclaim for their versatility in handling diverse data structures, yet their application to log data remains underexplored.
Terminology
Abstract
Transformers have gained widespread acclaim for their versatility in handling diverse data structures, yet their application to log data remains underexplored. Log data, characterized by its hierarchical, dictionary-like structure, poses unique challenges when processed using conventional transformer models. Traditional methods often rely on manually crafted templates for parsing logs, a process that is labor-intensive and lacks generalizability. Additionally, the linear treatment of log sequences by standard transformers neglects the rich, nested relationships within log entries, leading to suboptimal representations and excessive memory usage. To address these issues, we introduce HLogformer, a novel hierarchical transformer framework specifically designed for log data. HLogformer leverages the hierarchical structure of log entries to significantly reduce memory costs and enhance representation learning. Unlike traditional models that treat log data as flat sequences, our framework processes log entries in a manner that respects their inherent hierarchical organization. This approach ensures comprehensive encoding of both fine-grained details and broader contextual relationships. Our contributions are threefold: First, HLogformer is the first framework to design a dynamic hierarchical transformer tailored for dictionary-like log data. Second, it dramatically reduces memory costs associated with processing extensive log sequences. Third, comprehensive experiments demonstrate that HLogformer more effectively encodes hierarchical contextual information, proving to be highly effective for downstream tasks such as synthetic anomaly detection and product recommendation.
Sources
- ETC: Encoding Long and Structured Inputs in Transformers
- Longformer: The Long-Document Transformer
- Adapting Language Models to Compress Contexts
- Generating Long Sequences with Sparse Transformers
- Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context
- BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
- An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
- Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoders
- TEFM: Token-Efficient Faithful Modeling for Structured Data
- TabTransformer: Tabular Data Modeling Using Contextual Embeddings
- Reformer: The Efficient Transformer
- Hierarchical Transformers Are More Efficient Language Models
- Compressive Transformers for Long-Range Sequence Modelling
- Graph Attention Networks
- CENTILE: A Telemetry Foundation Model Evaluated by the Decisions It Drives
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks