paper-with-me

홈 › Papers

Fast convolution algorithm for state space models

2024-11-22 · Gregory Beylkin

We present an unconditionally stable algorithm for applying matrix transfer function of a linear time invariant system (LTI) in time domain. The state matrix of an LTI system used for modeling long range dependencies in state space models (SSMs) has eigenvalues close to $1$. The standard recursion defining LTI system becomes unstable if the $m\times m$ state matrix has just one eigenvalue with absolute value even slightly greater than 1. This may occur when approximating a state matrix by a structured matrix to reduce the cost of matrix-vector multiplication from $\mathcal{O}\left(m^{2}\right)$ to $\mathcal{O}\left(m\right)$ or $\mathcal{O}\left(m\log m\right).$ We introduce an unconditionally stable algorithm that uses an approximation of the rational transfer function in the z-domain by a matrix polynomial of degree $2^{N+1}-1$, where $N$ is chosen to achieve any user-selected accuracy. Using a cascade implementation in time domain, applying such transfer function to compute $L$ states requires no more than $2L$ matrix-vector multiplications (whereas the standard recursion requires $L$ matrix-vector multiplications). However, using unconditionally stable algorithm, it is not necessary to assure that an approximate state matrix has all eigenvalues with absolute values strictly less than 1 i.e., within the desired accuracy, the absolute value of some eigenvalues may possibly exceed $1$. Consequently, this algorithm allows one to use a wider variety of structured approximations to reduce the cost of matrix-vector multiplication and we briefly describe several of them to be used for this purpose.

📄 PDF Abstract BibTeX arXiv:2411.17729

Code (0)

등록된 구현이 없습니다.

Tasks

State Space Models

Similar Papers 제목 키워드 기반

Image Reconstruction for Accelerated MR Scan with Faster Fourier Convolutional Neural Networks

2023-06-05 · Xiaohan Liu, Yanwei Pang, Xuebin Sun, Yiming Liu 외

Partial scan is a common approach to accelerate Magnetic Resonance Imaging (MRI) data acquisition in both 2D and 3D settings. However, accurately reconstructing images from partial scan data (i.e., incomplete k-space mat…

3D ReconstructionImage Reconstruction

Towards Design Space Exploration and Optimization of Fast Algorithms for Convolutional Neural Networks (CNNs) on FPGAs

2019-03-05 · Afzal Ahmad, Muhammad Adeel Pasha

Convolutional Neural Networks (CNNs) have gained widespread popularity in the field of computer vision and image processing. Due to huge computational requirements of CNNs, dedicated hardware-based implementations are be…

Fast Convolution based on Winograd Minimum Filtering: Introduction and Development

2021-11-01 · Gan Tong, Libo Huang

Convolutional Neural Network (CNN) has been widely used in various fields and played an important role. Convolution operators are the fundamental component of convolutional neural networks, and it is also the most time-c…

Fast Algorithms for Convolutional Neural Networks

2015-09-30 · CVPR 2016 6 · Andrew Lavin, Scott Gray

Deep convolutional neural networks take GPU days of compute time to train on large data sets. Pedestrian detection for self driving cars requires very low latency. Image recognition for mobile phones is constrained by li…

GPUPedestrian DetectionSelf-Driving Cars

Adaptive convolutional neural networks for k-space data interpolation in fast magnetic resonance imaging

2020-06-02 · Tianming Du, Honggang Zhang, Yuemeng Li, Hee Kwon Song 외

Deep learning in k-space has demonstrated great potential for image reconstruction from undersampled k-space data in fast magnetic resonance imaging (MRI). However, existing deep learning-based image reconstruction metho…

DecoderDeep LearningImage Reconstruction