FreSH: Frequency-Segmented Hierarchical Multi-Expert Framework for Multivariate Time Series Classification
Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 2861-2869.
https://doi.org/10.24963/ijcai.2026/318
Keywords
- Data Mining: Mining spatial and/or temporal data
- Machine Learning: Classification
Abstract
Multivariate Time Series Classification (MTSC) demands models that can effectively capture complex temporal patterns across multiple scales while remaining computationally efficient. However, existing approaches generally struggle to reconcile fine-grained representation learning, especially under class imbalance and real-world constraints. In this paper, we present FreSH, a Frequency-Segmented Hierarchical Multi-Expert Framework designed to address these challenges. FreSH introduces a new perspective for MTSC by enabling adaptive, multi-scale analysis of temporal signals, allowing different aspects of the data to be modeled in a complementary and coordinated manner. By combining localized specialization with holistic context modeling, FreSH achieves strong representational capacity without incurring excessive computational overhead. An adaptive fusion strategy further enhances flexibility, enabling the model to dynamically emphasize the most informative components of the input. In addition, we incorporate a more robust optimization objective that improves learning stability across varying sample difficulties and class distributions. Extensive evaluations on 30 UEA benchmark datasets and real-world vibration data demonstrate that FreSH consistently outperforms state-of-the-art methods in classification accuracy, while substantially reducing model size and efficiency. The implementation code is publicly available at https://github.com/Wangmy2120/FreSH00.
- [An et al., 2023] Qi An, Saifur Rahman, Jingwen Zhou, and James Jin Kang. A comprehensive review on machine learning in healthcare industry: classification, restrictions, opportunities and challenges. Sensors, 23(9):4178, 2023.
- [Bagnall et al., 2018] Anthony Bagnall, Hoang Anh Dau, Ja- son Lines, Michael Flynn, James Large, Aaron Bostrom, Paul Southam, and Eamonn Keogh. The uea multivari- ate time series classification archive, 2018. arXiv preprint arXiv:1811.00075, 2018.
- [Cai et al., 2024] Wanlin Cai, Yuxuan Liang, Xianggen Liu, Jianshuai Feng, and Yuankai Wu. Msgnet: Learning multi- scale inter-series correlations for multivariate time series forecasting. In Proceedings of the AAAI conference on ar- tificial intelligence, volume 38, pages 11141-11149, 2024.
- [Cui et al., 2016] Zhicheng Cui, Wenlin Chen, and Yixin Chen. Multi-scale convolutional neural networks for time series classification. arXiv preprint arXiv:1603.06995, 2016.
- [Farahani et al., 2023] Mojtaba A Farahani, MR Mc- Cormick, Robert Gianinny, Frank Hudacheck, Ramy Harik, Zhichao Liu, and Thorsten Wuest. Time-series pattern recognition in smart manufacturing systems: A literature review and ontology. Journal of Manufacturing Systems, 69:208-241, 2023.
- [Gu et al., 2021] Albert Gu, Karan Goel, and Christopher Ré. Efficiently modeling long sequences with structured state spaces. arXiv preprint arXiv:2111.00396, 2021.
- [He et al., 2015] Guoliang He, Yong Duan, Rong Peng, Xi- aoyuan Jing, Tieyun Qian, and Lingling Wang. Early clas- sification on multivariate time series. Neurocomputing, 149:777-787, 2015.
- [Ismail Fawaz et al., 2019] Hassan Ismail Fawaz, Germain Forestier, Jonathan Weber, Lhassane Idoumghar, and Pierre-Alain Muller. Deep learning for time series classi- fication: a review. Data mining and knowledge discovery, 33(4):917-963, 2019.
- [Karim et al., 2017] Fazle Karim, Somshubra Majumdar, Houshang Darabi, and Shun Chen. Lstm fully convolu- tional networks for time series classification. IEEE access, 6:1662-1669, 2017.
- [Karim et al., 2019] Fazle Karim, Somshubra Majumdar, Houshang Darabi, and Samuel Harford. Multivariate lstm-fcns for time series classification. Neural networks, 116:237-245, 2019.
- [Lai et al., 2018] Guokun Lai, Wei-Cheng Chang, Yiming Yang, and Hanxiao Liu. Modeling long-and short-term temporal patterns with deep neural networks. In The 41st international ACM SIGIR conference on research & devel- opment in information retrieval, pages 95-104, 2018.
- [Leng et al., 2022] Zhaoqi Leng, Mingxing Tan, Chenxi Liu, Ekin Dogus Cubuk, Xiaojie Shi, Shuyang Cheng, and Dragomir Anguelov. Polyloss: A polynomial expansion perspective of classification loss functions. arXiv preprint arXiv:2204.12511, 2022.
- [Li et al., 2021] Guozhong Li, Byron Choi, Jianliang Xu, Sourav S Bhowmick, Kwok-Pan Chun, and Grace Lai- Hung Wong. Shapenet: A shapelet-neural network ap- proach for multivariate time series classification. In Pro- ceedings of the AAAI conference on artificial intelligence, volume 35, pages 8375-8383, 2021.
- [Li et al., 2023] Yang Li, Guanci Yang, Zhidong Su, Shaobo Li, and Yang Wang. Human activity recognition based on multienvironment sensor data. Information Fusion, 91:47- 63, 2023.
- [Lin et al., 2017] Tsung-Yi Lin, Priya Goyal, Ross Girshick, Kaiming He, and Piotr Dollár. Focal loss for dense ob- ject detection. In Proceedings of the IEEE international conference on computer vision, pages 2980-2988, 2017.
- [Liu et al., 2022] Minhao Liu, Ailing Zeng, Muxi Chen, Zhi- jian Xu, Qiuxia Lai, Lingna Ma, and Qiang Xu. Scinet: Time series modeling and forecasting with sample convo- lution and interaction. Advances in Neural Information Processing Systems, 35:5816-5828, 2022.
- [Luo and Wang, 2024] Donghao Luo and Xue Wang. Mod- erntcn: A modern pure convolution structure for general time series analysis. In The twelfth international confer- ence on learning representations, pages 1-43, 2024.
- [Luo et al., 2023] Dongsheng Luo, Wei Cheng, Yingheng Wang, Dongkuan Xu, Jingchao Ni, Wenchao Yu, Xuchao Zhang, Yanchi Liu, Yuncong Chen, Haifeng Chen, et al. Time series contrastive learning with information-aware augmentations. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 4534-4542, 2023.
- [Mu et al., 2025] Yang Mu, Muhammad Shahzad, and Xiao Xiang Zhu. Mptsnet: Integrating multiscale peri- odic local patterns and global dependencies for multivari- ate time series classification. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 39, pages 19572-19580, 2025.
- [Nie et al., 2022] Yuqi Nie, Nam H Nguyen, Phanwadee Sinthong, and Jayant Kalagnanam. A time series is worth 64 words: Long-term forecasting with transformers. arXiv preprint arXiv:2211.14730, 2022.
- [Ruiz et al., 2021] Alejandro Pasos Ruiz, Michael Flynn, James Large, Matthew Middlehurst, and Anthony Bag- nall. The great multivariate time series classification bake off: a review and experimental evaluation of recent algo- rithmic advances. Data mining and knowledge discovery, 35(2):401-449, 2021.
- [Tang et al., 2020] Wensi Tang, Guodong Long, Lu Liu, Tianyi Zhou, Michael Blumenstein, and Jing Jiang. Omni- scale cnns: a simple and effective kernel size config- uration for time series classification. arXiv preprint arXiv:2002.10061, 2020.
- [Tian et al., 2020] Yonglong Tian, Chen Sun, Ben Poole, Dilip Krishnan, Cordelia Schmid, and Phillip Isola. What makes for good views for contrastive learning? Advances in neural information processing systems, 33:6827-6839, 2020.
- [Tian et al., 2025] Tian Tian, Chunyan Miao, and Hang- wei Qian. Frera: A frequency-refined augmentation for contrastive learning on time series classification. arXiv preprint arXiv:2505.23181, 2025.
- [Tonekaboni et al., 2021] Sana Tonekaboni, Danny Eytan, and Anna Goldenberg. Unsupervised representation learn- ing for time series with temporal neighborhood coding. arXiv preprint arXiv:2106.00750, 2021.
- [Wang et al., 2017] Zhiguang Wang, Weizhong Yan, and Tim Oates. Time series classification from scratch with deep neural networks: A strong baseline. In 2017 Interna- tional joint conference on neural networks (IJCNN), pages 1578-1585. IEEE, 2017.
- [Wang et al., 2023] Huiqiang Wang, Jian Peng, Feihu Huang, Jince Wang, Junhui Chen, and Yifei Xiao. Micn: Multi-scale local and global context modeling for long- term series forecasting. In The eleventh international con- ference on learning representations, 2023.
- [Wen et al., 2022] Qingsong Wen, Tian Zhou, Chaoli Zhang, Weiqi Chen, Ziqing Ma, Junchi Yan, and Liang Sun. Transformers in time series: A survey. arXiv preprint arXiv:2202.07125, 2022. IJCAI
- [Wu et al., 2021] Haixu Wu, Jiehui Xu, Jianmin Wang, and Mingsheng Long. Autoformer: Decomposition transform- ers with auto-correlation for long-term series forecast- ing. Advances in neural information processing systems, 34:22419-22430, 2021.
- [Wu et al., 2022a] Haixu Wu, Tengge Hu, Yong Liu, Hang Zhou, Jianmin Wang, and Mingsheng Long. Timesnet: Temporal 2d-variation modeling for general time series analysis. arXiv preprint arXiv:2210.02186, 2022.
- [Wu et al., 2022b] Haixu Wu, Jialong Wu, Jiehui Xu, Jian- min Wang, and Mingsheng Long. Flowformer: Lineariz- ing transformers with conservation flows. arXiv preprint arXiv:2202.06258, 2022.
- [Yi et al., 2023] Kun Yi, Qi Zhang, Wei Fan, Shoujin Wang, Pengyang Wang, Hui He, Ning An, Defu Lian, Long- bing Cao, and Zhendong Niu. Frequency-domain mlps are more effective learners in time series forecasting. Advances in Neural Information Processing Systems, 36:76656-76679, 2023.
- [Yue et al., 2022] Zhihan Yue, Yujing Wang, Juanyong Duan, Tianmeng Yang, Congrui Huang, Yunhai Tong, and Bixiong Xu. Ts2vec: Towards universal representation of time series. In Proceedings of the AAAI conference on ar- tificial intelligence, volume 36, pages 8980-8987, 2022.
- [Zeng et al., 2023] Ailing Zeng, Muxi Chen, Lei Zhang, and Qiang Xu. Are transformers effective for time series fore- casting? In Proceedings of the AAAI conference on artifi- cial intelligence, volume 37, pages 11121-11128, 2023.
- [Zhang and Yan, 2023] Yunhao Zhang and Junchi Yan. Crossformer: Transformer utilizing cross-dimension de- pendency for multivariate time series forecasting. In The eleventh international conference on learning representa- tions, 2023.
- [Zhang et al., 2017] Hongyi Zhang, Moustapha Cisse, Yann N Dauphin, and David Lopez-Paz. mixup: Be- yond empirical risk minimization. arXiv preprint arXiv:1710.09412, 2017.
- [Zhang et al., 2020] Xuchao Zhang, Yifeng Gao, Jessica Lin, and Chang-Tien Lu. Tapnet: Multivariate time se- ries classification with attentional prototypical network. In Proceedings of the AAAI conference on artificial intelli- gence, volume 34, pages 6845-6852, 2020.
- [Zheng et al., 2014] Yi Zheng, Qi Liu, Enhong Chen, Yong Ge, and J Leon Zhao. Time series classification using multi-channels deep convolutional neural networks. In In- ternational conference on web-age information manage- ment, pages 298-310. Springer, 2014.
- [Zheng et al., 2023] Xu Zheng, Tianchun Wang, Wei Cheng, Aitian Ma, Haifeng Chen, Mo Sha, and Dongsheng Luo. Auto tcl: Automated time series contrastive learning with adaptive augmentations. In Proc. 32nd Int. Joint Conf. Ar- tif. Intell.(IJCAI), pages 1-19, 2023.
- [Zhou et al., 2021] Haoyi Zhou, Shanghang Zhang, Jieqi Peng, Shuai Zhang, Jianxin Li, Hui Xiong, and Wan- cai Zhang. Informer: Beyond efficient transformer for long sequence time-series forecasting. In Proceedings of the AAAI conference on artificial intelligence, volume 35, pages 11106-11115, 2021.
- [Zhou et al., 2022a] Tian Zhou, Ziqing Ma, Qingsong Wen, Liang Sun, Tao Yao, Wotao Yin, Rong Jin, et al. Film: Fre- quency improved legendre memory model for long-term time series forecasting. Advances in neural information processing systems, 35:12677-12690, 2022.
- [Zhou et al., 2022b] Tian Zhou, Ziqing Ma, Qingsong Wen, Xue Wang, Liang Sun, and Rong Jin. Fedformer: Fre- quency enhanced decomposed transformer for long-term series forecasting. In International conference on machine learning, pages 27268-27286. PMLR, 2022.
- [Zuo et al., 2023] Rundong Zuo, Guozhong Li, Byron Choi, Sourav S Bhowmick, Daphne Ngar-yin Mah, and Grace LH Wong. Svp-t: A shape-level variable-position transformer for multivariate time series classification. In Proceedings of the AAAI Conference on Artificial Intelli- gence, volume 37, pages 11497-11505, 2023.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
1 Introduction
Multivariate time series classification has attracted significant attention due to its broad applications in healthcare [An et al., 2023], industrial equipment fault diagnosis [Farahani et al., 2023], and human action recognition [Li et al., 2023]. Accurate time series classification provides crucial support and insights for decision-makers. However, inherent properties of time series data, such as complex dynamics, noise, and class imbalance, make MTSC a particularly challenging task [Ismail Fawaz et al., 2019].

Traditional MTSC algorithms, such as DTW [Wang et al., 2017], primarily rely on feature statistics or signal processing techniques. As datasets become more complex, these methods struggle to scale to modern, high-dimensional time series and fail to generalize across diverse application scenarios [Ruiz et al., 2021]. Recently, deep learning has emerged as the dominant paradigm for MTSC. CNN-based methods, such as OS-CNN [Tang et al., 2020], excel in learning spatial hierarchical features through convolutional filters but are limited in comprehensively modeling global features, often requiring additional designs to compensate for this shortcoming. RNN-based [Karim et al., 2017] methods face challenges in capturing long-term dependencies due to vanishing gradients. Transformer-based models [Wen et al., 2022; Zuo et al., 2023] propose to handle long-range dependencies through self-attention mechanisms but fall short in extracting local pattern features at adjacent time points.
Despite the promising progress achieved by existing methods in time series classification, several key limitations hinder their performance and practicality. First, existing models often struggle to effectively capture the intricate, multiscale nature of time series data. They typically process either time-domain data directly [He et al., 2015] or a holistic frequency-domain [Yi et al., 2023], thereby failing to distinguish and analyze the distinct information carried by different frequency bands. The diversity of the MTSC dataset poses challenges for existing models in balancing differences between datasets and across categories. As shown in Figure 1, different models exhibit significant performance variations on different types of UEA datasets, and their accuracy is markedly affected by the number of samples in different categories, with performance improvements accompanied by considerable overhead. Furthermore, recent complex models, particularly those leveraging global self-attention mechanisms [Zhou et al., 2021], suffer from high computational costs and poor scalability, making them unsuitable for realtime applications or large-scale datasets. Simultaneously, these models lack the adaptability to specialize their processing based on the local characteristics of the data. Finally, conventional loss functions in MTSC, such as CrossEntropy [Wu et al., 2022a] and Focal Loss [Lin et al., 2017], present a dilemma: the former is often dominated by majority classes, while the latter can over-correct for difficult samples. This makes them suboptimal for handling the joint challenges of class imbalance and varying sample difficulty, which are common in real-world time series datasets.
Motivated by these challenges, we propose a FrequencySegmented Hierarchical Multi-Expert Framework for time series classification, i.e., FreSH. Our main goal is to go beyond a single-view approach by using the frequency domain and proposing a segmentation strategy that allows us to specifically analyze different frequency components. To fix the lack of flexibility and high costs of current models, we design an efficient and adaptive hierarchical multi-expert system. This architecture uses dedicated local experts for specific data segments while a global expert provides overall context, all within a lightweight framework that avoids complex and slow mechanisms like global attention. An adaptive gating mechanism fuses these outputs, dynamically weighting local frequency bands and global frequency spectrum. We also aim for a better optimization strategy by introducing a polynomial Loss as an alternative to standard loss functions, which we believe can create a better balance when optimizing for both easy and difficult samples, as well as majority and minority classes. Our major contributions can be summarized as follows:
- We propose a frequency-aware modeling paradigm that adaptively captures the multi-scale and multi-band characteristics of multivariate time series, offering a principled alternative to single-view time- or frequency-domain approaches for time series classification.
- We design FreSH, a lightweight frequency-segmented hierarchical multi-expert framework that enables adaptive specialization across frequency components by integrating local and global experts, achieving effective multi-scale representation with low computational overhead.
- Extensive experiments on 30 UEA benchmark datasets validate the effectiveness and generalization capability of our FreSH. Our method outperforms diverse state-of-the-art baselines while achieving advanced efficiency.

2 Methodology
2.1 ProblemFormulation
Let X = {Xi}n1 represent a multivariate time series dataset, where each sample Xi ∈ Rd×l represents the observations of d variables over l time steps, the goal of multivariate time series classification is to learn a classifier fθ to accurately predict the corresponding label, i.e., Xi ∈ Rd×l fθ -→ ˆ Yi ∈ Rc .
2.2 Framework Overview
We propose FreSH, a frequency-domain expert framework for multivariate time series classification, which integrates localized and global modeling within a mixture-of-experts network. The working pipeline is shown in Figure 2 (a). We conduct mixup for different samples to enrich the data diversity first, and then transform the data into the frequency domain and process it by a Hierarchical Frequency-Informed MoE (HiFiMoE) module, shown in Figure 2 (b). The output is fed to the prediction layer for classification.
2.3 Data Preprocessing
Given an input multivariate time series sample Xi ∈ Rd×l , where d is the number of variables and l is the sequence length, we first conduct mixup [Zhang et al., 2017] to enrich data diversity. We transform it into the frequency domain using the Fast Fourier Transform:
where s = ⌊ l2 ⌋ + 1. This frequency-domain representation allows the model to exploit periodic patterns and frequencyspecific information that are difficult to capture in the time domain. The resulting signal F is then zero-padded to a fixed length spadded to ensure divisibility and consistency across samples.
2.4 Frequency Segment Division
To capture the unevenly distributed information in the frequency domain, we divide the spectrum into multiple segments. This segmentation allows specialized experts to focus on specific bands, enabling more targeted feature learning and preparing for adaptive fusion later. Specifically, we divide the entire frequency spectrum into K equal-length segments:
where each segment F(k) ∈ Cd×lk corresponds to a specific frequency band, and lk×K = spadded. This segment division operation offers the opportunity for the specific utilization of individual frequency components that may carry unique patterns relevant for time series classification.
2.5 Hierarchical Frequency-InformedMoE
Multi-Segment Expert Module
For each frequency segment F(k) , we design a dedicated multi-segment expert module consisting of M parallel local experts {E(k) m (·)}Mm=1 , each implemented by a lightweight MLP. These experts are intended to capture diverse, potentially complementary representations of the intra-segment features. Specifically, the generated hidden representation of the m-th expert and k-th frequency segment H(k) m is:
When M = 1, the output of the single expert is directly used. For M > 1, the outputs of all experts are averaged to yield the representation of the k-th frequency segment H(k) :
H(k) processes a single frequency band F(k) and integrates the output results of M expert networks by averaging, thereby fully leveraging the collaborative advantages of multiple expert networks to significantly enhance overall performance. This design can balance expressiveness and computational efficiency, avoiding intra-segment gating while still allowing for ensemble effects among experts.
Global Expert Module
While segment-wise experts focus on local frequency bands, it is equally important to model global dependencies that span the entire frequency spectrum. To this end, we incorporate N global experts {Ui(·)}Ni=1 , each processing the complete frequency spectrum signal F ∈ Cd×spadded to extract holistic representations:
To adaptively weight the contributions of different global experts based on the input, we introduce a global gate
σglobal(·), which is implemented as a simple linear layer followed by a softmax:
where F is the input full-spectrum frequency representation, and λ provides the normalized weights for all N global experts. The final global representationHglobal is then computed as a weighted sum of all the experts:
where Hglobal ∈ Cd×spadded . This mechanism allows the model to dynamically adjust which global experts to emphasize, providing flexibility to adapt to varying signal characteristics.
Adaptive Gating Mechanism
Beyond global expert fusion, we also introduce a segmentlevel gating mechanism to adaptively combine segment-wise representations. The original full frequency domain information F is fed into a segment gate σsegment(·), which directly produces normalized weights β for each segment:
The local representation is then computed as a weighted combination of segment outputs:
where Hlocal ∈ Cd×spadded and βk provides the softmaxnormalized importance weights for segment k, enabling the model to dynamically balance contributions from different frequency bands.
We have achieved global frequency spectrum representation Hglobal and fused representation from individual frequency segments Hlocal. Then, we leverage a gate network σreweight for global representationHglobal to adaptivelymodulate the channel in the complete frequency spectrum. Finally, to yield a comprehensive representation, we combine the original frequency-domain signal F, the adaptively fused local representation Hlocal, and the adaptively fused global representation Hglobal :
Here, γ is a learnable scalar obtained through the local and global two-path features, and ˆα denotes the adaptive gating weight.
2.6 Prediction Layer
The final frequency-domain representationH∗ is transformed back into the time domain using the inverse FFT:
This reconstructed time-domain signal is passed through a fully connected classification layer and a softmax activation to produce class probabilities ˆ y:
where W and b represent the weight and bias of the linear layer. This end-to-end pipeline enables the model to predict the class label based on frequency-aware representations.
| Dataset | DTWD | TapNet | ShapeNet | TNC | TS2Vec | InfoMin | InfoTS | AutoTCL | MPTSNet | FreRA | Ours |
|---|---|---|---|---|---|---|---|---|---|---|---|
| ArticularyWordRecognition | 98.7 | 98.7 | 98.7 | 97.3 | 98.7 | 91.3 | 98.7 | 98.3 | 97.7 | 99.0 | 99.3 |
| AtrialFibrillation | 20.0 | 33.3 | 40.0 | 13.3 | 20.0 | 26.7 | 20.0 | 46.7 | 53.3 | 46.7 | 73.3 |
| BasicMotions | 97.5 | 100.0 | 100.0 | 97.5 | 97.5 | 100.0 | 97.5 | 100.0 | 100.0 | 100.0 | 100.0 |
| CharacterTrajectories | 98.9 | 99.7 | 98.0 | 96.7 | 99.5 | 99.0 | 97.4 | 97.6 | - | 99.1 | 99.2 |
| Cricket | 100.0 | 95.8 | 98.6 | 95.8 | 97.2 | 95.8 | 98.6 | 100.0 | 94.4 | 100.0 | 98.3 |
| DuckDuckGeese | 60.0 | 57.5 | 72.5 | 46.0 | 68.0 | 70.0 | 54.0 | 70.0 | 68.0 | 76.0 | 68.0 |
| EigenWorms | 61.8 | 57.5 | 72.5 | 84.0 | 84.7 | 79.4 | 73.3 | 90.1 | - | 86.3 | 55.7 |
| Epilepsy | 96.4 | 97.1 | 98.7 | 95.7 | 96.4 | 92.0 | 97.1 | 97.8 | 97.1 | 99.3 | 87.0 |
| EthanolConcentration | 32.3 | 32.3 | 31.2 | 85.2 | 30.8 | 24.3 | 28.1 | 35.4 | 43.3 | 32.3 | 33.5 |
| ERing | 13.3 | 13.3 | 13.3 | 29.7 | 87.4 | 90.4 | 94.9 | 94.4 | 94.4 | 91.9 | 97.4 |
| FaceDetection | 52.9 | 55.6 | 60.2 | 53.6 | 50.1 | 56.0 | 53.4 | 58.1 | 69.8 | 58.1 | 70.1 |
| FingerMovements | 53.0 | 53.0 | 58.9 | 47.0 | 48.0 | 50.0 | 63.0 | 64.0 | 64.0 | 61.0 | 68.0 |
| HandMovementDirection | 23.1 | 37.8 | 33.8 | 32.4 | 33.8 | 32.4 | 39.2 | 43.2 | 63.5 | 51.4 | 68.9 |
| Handwriting | 60.7 | 35.7 | 45.1 | 24.9 | 51.5 | 56.9 | 45.2 | 38.4 | 34.4 | 59.3 | 36.5 |
| Heartbeat | 71.7 | 75.1 | 75.6 | 74.6 | 68.3 | 73.7 | 72.2 | 78.5 | 75.6 | 78.5 | 79.0 |
| JapaneseVowels | 94.9 | 96.5 | 98.4 | 97.8 | 98.4 | 93.8 | 98.4 | 98.4 | 98.6 | 96.5 | 99.2 |
| Libras | 87.2 | 85.0 | 85.6 | 81.7 | 86.7 | 80.0 | 88.3 | 83.3 | 87.2 | 91.1 | 91.7 |
| LSST | 55.1 | 56.8 | 59.0 | 59.5 | 53.7 | 47.3 | 59.1 | 55.4 | 60.4 | 49.4 | 39.0 |
| MotorImagery | 50.0 | 59.0 | 61.0 | 50.0 | 51.0 | 53.0 | 63.0 | 57.0 | 65.0 | 55.0 | 64.0 |
| NATOPS | 88.3 | 93.9 | 88.3 | 91.1 | 92.8 | 82.2 | 93.3 | 94.4 | 94.4 | 90.0 | 97.2 |
| PEMS-SF | 71.1 | 75.1 | 75.1 | 69.9 | 68.2 | 69.9 | 75.1 | 83.8 | 94.2 | 74.6 | 93.6 |
| PenDigits | 97.7 | 98.0 | 97.7 | 97.9 | 98.9 | 97.0 | 99.0 | 98.4 | 98.9 | 97.3 | 98.9 |
| PhonemeSpectra | 15.1 | 17.5 | 29.8 | 20.7 | 23.3 | 24.0 | 24.9 | 21.8 | 14.4 | 27.4 | 14.4 |
| RacketSports | 80.3 | 86.8 | 88.2 | 77.6 | 85.5 | 82.2 | 85.5 | 91.4 | 87.5 | 88.8 | 90.8 |
| SelfRegulationSCP1 | 77.5 | 65.2 | 78.2 | 79.9 | 81.2 | 86.7 | 87.4 | 89.1 | 92.8 | 90.8 | 92.8 |
| SelfRegulationSCP2 | 53.9 | 55.0 | 57.8 | 55.0 | 57.8 | 62.0 | 57.8 | 57.8 | 57.2 | 62.2 | 59.4 |
| SpokenArabicDigits | 96.3 | 98.3 | 97.5 | 93.4 | 93.2 | 98.1 | 94.7 | 92.5 | 99.5 | 98.4 | 99.8 |
| StandWalkJump | 20.0 | 40.0 | 53.3 | 40.0 | 46.7 | 33.3 | 46.7 | 53.3 | 53.3 | 66.7 | 60.0 |
| UWaveGestureLibrary | 90.3 | 89.4 | 90.6 | 75.9 | 88.4 | 87.2 | 88.4 | 89.3 | 88.1 | 90.0 | 90.6 |
| InsectWingbeat | - | 20.8 | 25.0 | 46.9 | 46.6 | 44.3 | 47.0 | 48.8 | - | 46.2 | 56.8 |
| Top-1 count ↑ | 2 | 2 | 3 | 1 | 0 | 1 | 1 | 4 | 5 | 6 | 15 |
| Avg. Acc. (%) ↑ | 63.9 | 66.0 | 69.4 | 67.0 | 70.1 | 69.3 | 74.2 | 68.2 | 75.4 | 76.1 | |
| Avg. Rank ↓ | 7.6 | 6.3 | 5.0 | 8.2 | 6.6 | 7.5 | 71.4 5.4 | 4.1 | 4.7 | 3.8 | 3.2 |
2.7 Optimization Objective Function
In MTSC tasks, data distributions are complex, class imbalance is common, and datasets differ significantly. Cross Entropy-Loss, which is widely used in prior work, struggles with class imbalance and fails to distinguish between easy and hard samples, leading to poor handling of minority classes and complex instances. To address this, we propose adopting Polynomial Loss [Leng et al., 2022] for time series classification.
Polynomial Loss was initially proposed to improve optimization and calibration performance in general classification tasks. However, the original Polynomial Loss introduces high-order terms and multiple hyperparameters, which may complicate the optimization process in MTSC scenarios. In this case, we simplify and customize it into an improved loss function called P-Loss.
We propose P-Loss to optimize the original formula by retaining only the core second-order adjustment term while preserving the stability and robustness advantages. The secondorder formulation is adopted because it provides nonlinear gradient corrections with negligible computational overhead, effectively optimizing the classification boundaries for multichannel data without introducing the noise associated with higher-order terms. Specifically, given N samples, where ˆ yi represents the predicted probability of the true class for the i-th sample, P-Loss is defined as:
The first term is the negative log-likelihood, maximizing the predicted probability ˆ yi, part of the standard cross-entropy loss. The second term is a second-order adjustment that penalizes deviations from the true label, with λP controlling its weight.
We also incorporate mixup with a simple adaptive adjustment. If the loss stagnates after several training rounds, the mixing ratio is dynamically reduced to bring the mixed samples closer to the original ones, improving generalization without harming baseline performance. Combined with P-Loss, this design simplifies optimization while preserving model stability and robustness, ultimately demonstrating stronger generalization on diverse MTSC benchmarks.
| Dataset | LSTNet SIG'18 | LSSL ICLR'22 | FEDf. ICLR'22 | Flowf. ICLR'22 | SCINet NIPS'22 | Dlinear AAAI'23 | PatchTST ICLR'23 | MICN ICLR'23 | TimesNet ICLR'23 | Crossf. ICLR'23 | M.TCN ICLR'24 | Ours |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| EthanolConcentration | 39.9 | 31.1 | 31.2 | 33.8 | 34.4 | 36.2 | 32.8 | 35.3 | 35.7 | 38.0 | 36.3 | 33.5 |
| FaceDetection | 65.7 | 66.7 | 66.0 | 67.6 | 68.9 | 68.0 | 68.3 | 65.2 | 68.6 | 68.7 | 70.8 | 70.1 |
| Handwriting | 25.8 | 24.6 | 28.0 | 33.8 | 23.6 | 27.0 | 29.6 | 25.5 | 32.1 | 28.8 | 30.6 | 36.5 |
| Heartbeat | 77.1 | 72.7 | 73.7 | 77.6 | 77.5 | 75.1 | 74.9 | 74.7 | 78.0 | 77.6 | 77.2 | 79.0 |
| JapaneseVowels | 98.1 | 98.4 | 98.4 | 98.9 | 96.0 | 96.2 | 97.5 | 94.6 | 98.4 | 99.1 | 98.8 | 99.2 |
| PEMS-SF | 86.7 | 86.1 | 80.9 | 86.0 | 83.8 | 75.1 | 89.3 | 85.5 | 89.6 | 85.9 | 89.1 | 93.6 |
| SelfReglationSCP1 | 84.0 | 90.8 | 88.7 | 92.5 | 92.5 | 87.3 | 90.7 | 86.0 | 91.8 | 92.1 | 93.4 | 92.8 |
| SelfReglationSCP2 | 52.8 | 52.2 | 54.4 | 56.1 | 57.2 | 50.5 | 57.8 | 53.6 | 57.2 | 58.3 | 60.3 | 59.4 |
| SpokenArabicDigits | 100 | 100 | 100 | 98.8 | 98.1 | 81.4 | 98.3 | 97.1 | 99.0 | 97.9 | 98.7 | 99.8 |
| UWaveGestureLibrary | 87.8 | 85.9 | 85.3 | 86.6 | 85.1 | 82.1 | 85.8 | 82.8 | 85.3 | 85.3 | 86.7 | 90.6 |
| Top-1 count ↑ | 2 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 3 | 5 |
| Avg. Acc. (%) ↑ | 71.8 | 70.9 | 70.7 | 73.2 | 71.7 | 67.9 | 72.5 | 70.0 | 73.6 | 73.2 | 74.2 | 75.5 |
| Avg. Rank ↓ | 6.6 | 7.9 | 8.0 | 5.1 | 7.5 | 9.5 | 6.8 | 10.1 | 4.5 | 5.0 | 3.4 | 2.4 |
2.8 Computational Complexity Analysis
Most operations in FreSH, except for the frequency-domain transformation, are linear in the sequence length, which makes the framework computationally efficient. The overall computational complexity of a single forward pass through FreSH can be expressed as O(dn log n+mhn+ghn), where d is the number of channels (variables) in the multivariate time series, n is the frequency-domain vector length of the input, m is the number of experts per frequency segment, g is the number of global experts, and h is the hidden dimension of each expert. The O(dn logn) term comes from the FFT and inverse FFT transformations applied across d channels, which dominate for large n. The segment-wise expert networks contribute O(mhn), as each of the k segments independently applies m small MLPs on n/k elements. Similarly, the global experts contribute O(ghn) by processing the full n-dimensional vector through g MLPs. Since d, m, g, and h are small constants compared to n in practice, the computational complexity grows approximately as O(dn logn), making the model efficient and scalable for long multivariate time series.
3 Experiments
3.1 Experimental Setups
We conduct experimental comparison on the UEA MTSC benchmarks [Bagnall et al., 2018], which span applications such as human activity recognition, speech processing, medical EEG, and audio analysis. The datasets differ substantially in sequence length, dimensionality, and train/test sizes, enabling a robust assessment of generalization.
To systematically evaluate the effectiveness of our proposed FreSH, we conduct comprehensive comparisons against a wide range of state-of-the-art baselines.
On one hand, our main experiments focus on comparisons with dedicated multivariate time series classification methods. Specifically, we consider both traditional and recent MTSC approaches, including DTWD, ShapeNet [Li et al., 2021], TapNet [Zhang et al., 2020], TNC [Tonekaboni et al., 2021], TS2Vec [Yue et al., 2022], InfoMin [Tian et al., 2020], InfoTS [Luo et al., 2023], AutoTCL [Zheng et al., 2023], MPTSNet [Mu et al., 2025], and FreRA [Tian et al., 2025]. These methods are evaluated on 30 UEA multivariate time series datasets, providing a thorough and fair comparison with existing MTSC models.
On the other hand, to comprehensively position our proposed FreSH, we compare FreSH with representative time series representation models, including LSTNet [Lai et al., 2018], LSSL [Gu et al., 2021], TimesNet [Wu et al., 2022a], PatchTST [Nie et al., 2022], FlowFormer [Wu et al., 2022b], FEDformer [Zhou et al., 2022b], SCINet [Liu et al., 2022], DLinear [Zeng et al., 2023], Crossformer [Zhang and Yan, 2023], MICN [Wang et al., 2023], and ModernTCN [Luo and Wang, 2024]. Following the general setting [Mu et al., 2025], we conduct the comparison on 10 UEA datasets. All experiments are conducted on an NVIDIA A100. We report average accuracy (Avg. Acc.), average rank (Avg. Rank), and the number of best-accuracy datasets (Top-1 count) to evaluate MTSC performance and enable fair comparisons with baseline methods.
3.2 Experimental Results
Table 1 presents an extensive empirical evaluation of FreSH against 10 state-of-the-art Multivariate Time Series Classification (MTSC) baselines across a diverse collection of 30 UEA datasets. The quantitative results demonstrate the overwhelming superiority and robustness of our proposed method.
In terms of overall performance across all 30 datasets, FreSH establishes a new state-of-the-art benchmark. It achieves the highest average accuracy of 76.1% and the best (lowest) average rank of 3.4 among all compared methods. When compared to the second-best performer, FreRA, FreSH not only improves the average accuracy by 0.7% (76.1% vs.
75.4%) but also demonstrates greater consistency, surpassing FreRA by a margin of 0.6 in average ranking (3.2 vs. 3.8). This indicates that FreSH maintains high performance stability across varying data domains.
A deeper analysis of the specific 10 MTSC datasets (Table 2) further highlights the model's adaptability. In this challenging subset, the performance gap between FreSH and existing methods becomes even more pronounced. Compared to the strong baseline ModernTCN, which ranks second in both metrics, FreSH delivers a substantial improvement: it boosts the average accuracy by 1.3% and advances the average ranking by a full position (1.0).
Beyond the average metrics, the ranking distribution across datasets further confirms the core advantages of our method. In the evaluation of the complete UEA dataset, FreSH achieved the highest number of Top-1 results, significantly surpassing the next best model. Furthermore, in the evaluation setting across 10 datasets, FreSH achieved best accuracy on 5 datasets and second best accuracy on 4 datasets.
Overall, this outstanding performance across multiple metrics and settings demonstrates that FreSH is an excellent model capable of handling complex temporal patterns, significantly outperforming both traditional and recently proposed MTSC models, with remarkable adaptability and effectiveness.
3.3 Ablation Study
| Model | Avg. Acc. (%) |
|---|---|
| w/o-GlobalExperts | 73.3 |
| w/o-SegmentsExperts | 73.1 |
| w/o-P-loss | 72.9 |
| w/o-Mixup | 74.6 |
| w/o-β | 73.4 |
| w/o-λ | 74.3 |
| FreSH | 76.1 |
We conduct a comprehensive ablation study to investigate the contributions of the key components in our model.
- w/o-GlobalExperts: Remove the global experts and only rely on segment-wise experts for feature extraction.
- w/o-SegmentExperts: Remove the segment-wise experts, relying solely on global experts.
- w/o-P-Loss: Replace the P-loss with cross-entropy loss.
- w/o-Mixup: Disable the adaptive mixup data augmentation.
- w/o-β: Disable adaptive gating fusion for Segment experts.
- w/o-λ: Disable adaptive gating fusion for Global experts.
The ablation study confirms that all components of the FreSH framework are critical to its performance. The largest drop in accuracy occurs when removing P-Loss (76.1% to 72.9%), a strong indicator of its central role in achieving robust optimization for imbalanced and difficult samples. The hierarchical multi-expert framework is also essential, as removing either the global experts (76.1% to 73.3%) or the segment experts (76.1% to 73.1%) significantly degrades performance, validating the synergy between local feature analysis and global information integration. While the mixup augmentation also contributes, its removal leads to a comparatively smaller drop (76.1% to 74.6%), showing it is a valuable but supplementary component. Under the premise of retaining the linear expert, ablation experiments were conducted on the adaptive gated fusion of local (β) and global (λ) experts. Although the removal of this fusion module led to a decrease in average accuracy (2.7% and 1.8%), its performance still significantly outperformed the setting where all experts were removed simultaneously, with dual comparisons validating that the linear expert provides a stable baseline and the adaptive fusion further achieves effective collaboration among experts.
3.4 Efficiency Comparison
To assess the prediction precision and computational efficiency in realistic settings, we benchmark all models on a real-world vibration dataset. We report model parameter volume, average batch latency, total test time, and classification accuracy to characterize the trade-off between computational cost and predictive performance.
| Model | #Params↓ | Batch (ms)↓ | Test (s)↓Acc. | (%)↑ |
|---|---|---|---|---|
| Autoformer | 933,507 | 23.5 | 8.518 | 85.06 |
| TimesNet | 653,651 | 32.5 | 11.754 | 84.16 |
| Informer | 1,139,338 | 9.2 | 3.314 | 90.10 |
| FEDformer | 1,531,402 | 48.1 | 17.407 | 91.10 |
| PatchTST | 466,947 | 2.8 | 0.976 | 94.34 |
| DLinear | 3,927,003 | 0.66 | 0.187 | 44.89 |
| Crossformer | 2,843,059 | 25.3 | 1.468 | 90.30 |
| Transformer | 936,195 | 63.9 | 23.131 | 89.30 |
| LightTS | 2,026,909 | 1.2 | 0.372 | 88.27 |
| MPTSNet | 88,181,371 | 101.4 | 123.325 | 84.51 |
| FreRA | 516,299,712 | 8.8 | 0.966 | 81.45 |
| FreSH | 54,243 | 1.2 | 0.344 | 94.37 |
Table 4 shows large efficiency gaps. DLinear is extremely fast (0.66 ms/batch; 0.187 s total) but underfits vibration signals, yielding low accuracy (44.89%). In contrast, TimesNet, Crossformer, and other Transformer-based models achieve competitive accuracy at much higher cost (25.3-63.9 ms/batch). MPTSNet further demonstrates diminishing returns: despite strong capacity, its > 88M parameters lead to prohibitive latency (101.4 ms/batch; > 123 s total), limiting practicality. By contrast, our proposed FreSH achieves the best balance between performance and efficiency. With only 54,243 parameters, it remains fast (1.2 ms/batch; 0.344 s total) while achieving 94.37% accuracy.
These results indicate that FreSH effectively reconciles efficiency and accuracy, making it well-suited for real-world vibration analysis where both are critical.

3.5 Hyper-Parameter Analysis
We conduct quantitative experiments to evaluate the contributions of different components of FreSH. Figure 3 shows average accuracy on 30 UEA datasets under various hyperparameter settings. Figure 3 (a) tests the number of frequency segments. Figure 3 (b) examines experts per segment and analyzes global experts.
Experimental results shown in Figure 3 highlight the critical role of structural design in our framework. Specifically, segmenting the frequency spectrum into 3 bands strikes a balance between capturing fine-grained local patterns and preserving sufficient global context. Likewise, assigning 3 experts enables diverse feature extraction within each band without introducing unnecessary redundancy.
In contrast, overly fine segmentation fragments the spectrum and dilutes useful information, while too many experts per segment increases the risk of overfitting and leads to unstable representations.
These findings confirm that carefully calibrating the segmentation granularity and expert allocation is essential for effectively modeling both local and global dependencies in multivariate time series classification.
4 RelatedWork
4.1 Time-DomainMTSCMethods
A substantial portion of multivariate time series classification research has concentrated on modeling signals directly in the time domain. Notably, the MC-DCNN [Zheng et al., 2014] applies one-dimensional convolutions to capture intervariable relations, pairing them with fully connected layers for classification purposes. Building on this, the Multiscale Convolutional Neural Network (MSCNN) designs convolution kernels of multiple sizes to extract multiscale features [Cui et al., 2016]. Hybrid architectures have also been explored, such as LSTM-FCN [Karim et al., 2017], which leverages LSTM layers for short- and long-term dependency capture while CNN layers extract salient time series patterns. Its enhanced version MLSTM-FCN [Karim et al., 2019] further refines this combination for performance gains. More recent developments like TimesNet [Wu et al., 2022a] disentangle complex temporal variations into intraand inter-period components for improved local and global feature modeling, whereas MS-GNet [Cai et al., 2024] integrates graph convolution for inter-series correlation alongside multi-head attention for intra-series feature learning. Likewise, PatchTST [Nie et al., 2022] partitions sequences into local patches to capture hierarchical patterns, while Autoformer [Wu et al., 2021] proposes a novel auto-correlation mechanism that captures long-range dependencies by calculating the periodic similarity of time series.
Compared with this line of methods, our FreSH's hierarchical multi-expert architecture allows us to specifically extract the crucial frequency characteristics, achieving superior computational efficiency and adaptability.
4.2 Frequency-DomainMTSCMethods
In parallel, a growing body of work has sought to harness frequency-domain representations for MTSC, leveraging spectral analysis to uncover new optimization pathways. For instance, the Frequency-improved Legendre Memory Model [Zhou et al., 2022a] augments Legendre memory structures with spectral components, markedly improving long-term sequence classification. CrossFormer [Zhang and Yan, 2023] unifies frequency-domain decomposition with Transformer architectures to jointly refine local and global feature extraction, while MPTSNet [Mu et al., 2025] explicitly utilizes amplitude information to detect salient periodicities for rapid feature localization. Other methods bypass the time domain entirely: FreTS [Yi et al., 2023] demonstrates the compactness of spectral information and constructs a frequency-domain MLP to achieve state-of-the-art performance, and FreRA [Tian et al., 2025] proposes a parameterized augmentation strategy with time-frequency consistency constraints for robust training.
Existing frequency-domain methods typically perform a single, global analysis of the entire spectrum, which overlooks the unique information contained in different frequency bands. Our FreSH addresses this by segmenting the spectrum and using an adaptive expert system to process each segment individually, enabling a fine-grained and specialized analysis of each frequency band.
5 Conclusion
To advance multivariate time series classification, we propose FreSH, which combines frequency-domain analysis with an adaptive expert system.
FreSH transforms time series into the frequency domain and applies spectral segmentation: segment experts capture band-specific features, global experts model full-spectrum context, and adaptive gating fuses them into a more balanced representation.
FreSH further introduces P-Loss to address the limitations of cross-entropy and focal loss, and incorporates an adaptive mixup strategy to improve robustness and generalization.
Extensive experiments on a broad range of UEA benchmarks and a real-world vibration dataset demonstrate that FreSH consistently achieves superior or competitive accuracy compared to state-of-the-art methods, while maintaining high computational efficiency and a compact parameter footprint. The strong performance across diverse datasets underscores the framework's practical applicability and robustness, highlighting its potential for real-world deployment scenarios where both accuracy and efficiency are essential.
Acknowledgements
This work was supported by Jilin Province Industrial Key Core Technology Tackling Project (20230201085GX). Zijian Zhang is supported by the China Postdoctoral Science Foundation (2025M771587) and the Open Funding Programs of State Key Laboratory of AI Safety (2025-09). Hao Miao is supported by SCRI, The Hong Kong Polytechnic University (No. Q-CDDG). Qingliang Li is supported by the National Natural Science Foundation of China(42575159, 42275155, 62206028).
@inproceedings{ijcai2026p318,
title = {FreSH: Frequency-Segmented Hierarchical Multi-Expert Framework for Multivariate Time Series Classification},
author = {Liu, Pingping and Wang, Muyao and Zhang, Zijian and Zhang, Tongshun and Miao, Hao and Xie, Guorui and Li, Qingliang and Zhou, Qiuzhan},
booktitle = {Proceedings of the Thirty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-26}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Diego Calvanese},
pages = {2861--2869},
year = {2026},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2026/318},
url = {https://doi.org/10.24963/ijcai.2026/318},
}
TY - CPAPER TI - FreSH: Frequency-Segmented Hierarchical Multi-Expert Framework for Multivariate Time Series Classification AU - Liu, Pingping AU - Wang, Muyao AU - Zhang, Zijian AU - Zhang, Tongshun AU - Miao, Hao AU - Xie, Guorui AU - Li, Qingliang AU - Zhou, Qiuzhan T2 - Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26 PB - International Joint Conferences on Artificial Intelligence Organization PY - 2026 SP - 2861 EP - 2869 DO - 10.24963/ijcai.2026/318 UR - https://doi.org/10.24963/ijcai.2026/318 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: