Efficient Time Series Processing for Transformers and State-Space Models through Token Merging
<|reference_start|>Efficient Time Series Processing for Transformers and State-Space Models through Token Merging: Transformer architectures have shown promising results in time series processing. However, despite recent advances in subquadratic attention mechanisms or state-space models, processing very long sequences still imposes significant computational requirements. Token merging, which involves replacing multiple tokens with a single one calculated as their linear combination, has shown to considerably improve the throughput of vision transformer architectures while maintaining accuracy. In this work, we go beyond computer vision and perform the first investigations of token merging in time series analysis on both time series transformers and state-space models. To effectively scale token merging to long sequences, we introduce local merging, a domain-specific token merging algorithm that selectively combines tokens within a local neighborhood, adjusting the computational complexity from linear to quadratic based on the neighborhood size. Our comprehensive empirical evaluation demonstrates that token merging offers substantial computational benefits with minimal impact on accuracy across various models and datasets. On the recently proposed Chronos foundation model, we achieve accelerations up to 5400% with only minor accuracy degradations.<|reference_end|>
@article{götz2024efficient,
    title={Efficient Time Series Processing for Transformers and State-Space Models
  through Token Merging},
    author={Leon G"otz, Marcel Kollovieh, Stephan G"unnemann, Leo Schwinn},
    journal={arXiv preprint arXiv:2405.17951},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.17951},
    primaryClass={cs.LG}
}