REVIEW 2 cited by
ChunkFormer: Learning Long Time Series with Multi-stage Chunked Transformer
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
read the original abstract
The analysis of long sequence data remains challenging in many real-world applications. We propose a novel architecture, ChunkFormer, that improves the existing Transformer framework to handle the challenges while dealing with long time series. Original Transformer-based models adopt an attention mechanism to discover global information along a sequence to leverage the contextual data. Long sequential data traps local information such as seasonality and fluctuations in short data sequences. In addition, the original Transformer consumes more resources by carrying the entire attention matrix during the training course. To overcome these challenges, ChunkFormer splits the long sequences into smaller sequence chunks for the attention calculation, progressively applying different chunk sizes in each stage. In this way, the proposed model gradually learns both local and global information without changing the total length of the input sequences. We have extensively tested the effectiveness of this new architecture on different business domains and have proved the advantage of such a model over the existing Transformer-based models.
Forward citations
Cited by 2 Pith papers
-
Block-based Symmetric Pruning and Fusion for Efficient Vision Transformers
A block-based attention pruning and fusion method for ViTs that reports large accuracy gains at reduced FLOPs, but the gain is mostly from the chunk-attention backbone and the core symmetry claim is false.
-
Transforming NLU with Babylon: A Case Study in Development of Real-time, Edge-Efficient, Multi-Intent Translation System for Automated Drive-Thru Ordering
Babylon, an LSTM-pooled transformer that maps phoneme sequences to transcode action codes, reports 90.07% exact-match accuracy at 83 ms per order turn and 118 MB memory on edge CPUs.
Discussion (0). Continue with ORCID to comment.