Skip to content
Log in

Author

Cheng-Yu Sie

View on Semantic Scholar

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Jul 2026

FEDA: Fast Exponential Decay Approach for Multivariate Time Series Forecasting

Multivariate time series forecasting that uses past observations to predict future data has been widely used in various application. Numerous methods have been developed, including deep learning based approaches. One of the most successful models is Mamba, which is based the state space models (SSMs). However, Mamba and its variants still face the challenges of long training times owing to its nonlinear operations. In this paper, we proposed a Fast Exponential Decay Approach (FEDA) to improve the training efficiency of Mamba. We have observed that the hidden states in the model are linear combinations of past inputs. Therefore, we attempted to use a fully connected layer to generate all the hidden states. Although a fully connected layer does not have a recurrent structure, based on the intuitive idea in multivariate time series forecasting that the influence of observations diminishes over time, we multiplied the weights of the fully connected layer by a time-dependent coefficient to emulate a recurrence-like behavior. We evaluated our model on various datasets, and the results show that our model achieves the performance comparable to the state of the art models, while significantly improving their training efficiency. More specifically, it reduces training time by 20% to 80% depending on the channels of the dataset.

Ming-Ting Zhong, Cheng-Yu Sie, Che-Rung Lee · 0 citations
Conference Jul 2026

DATT: Dimension-Augmented Tensor-Train Decomposition for Neural Network Compression

Traditional model reduction techniques for neural network compression usually leverage existing matrix/tensor decomposition methods to explore the redundancy among model parameters, which may overlook the local structures of the models. In this work, we propose a novel low-rank approximation algorithm, called Dimension-Augmented Tensor-Train (DATT) decomposition, which integrates dimension slicing with the Tensor-Train decomposition. DATT allows different partitions to be represented using distinct, non-shared spanning sets. This enables the decomposition to adapt more flexibly to localized structure, potentially achieving better compression. With the localized low-rank structures, DATT provides a more compact representation of neural network weights. We evaluated the performance of DATT with the other state-of-the-art low-rank approximation-based model compression algorithms, and demonstrated that DATT outperforms them in terms of parameter reduction and model accuracy. In particular, for compressing ResNet-20 on CIFAR-10, DATT achieves a 77.00% reduction in parameters with only a 0.37% drop in top-1 accuracy.

Yu-Chuan Tai, Cheng-Yu Sie, Che-Rung Lee · 0 citations