Causal Convolutional Neural Networks as Finite Impulse Response Filters

• URL: http://arxiv.org/abs/2510.24125v1
• Date: Tue, 28 Oct 2025 06:57:14 GMT
• Title: Causal Convolutional Neural Networks as Finite Impulse Response Filters
• Authors: Kiran Bacsa, Wei Liu, Xudong Jian, Huangbin Liang, Eleni Chatzi,
• Abstract summary: Causal Convolutional Neural Networks (CNNs) capture spectral features implicitly and explicitly, offering enhanced interpretability for tasks involving dynamic systems.<n>We show that the entire network can be reduced to an equivalent single-layer filter resembling an FIR filter optimized via least-squares criteria.<n>This equivalence yields new insights into the spectral learning behavior of CNNs trained on signals with sparse frequency content.
• Score: 3.268966882982408
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study investigates the behavior of Causal Convolutional Neural Networks (CNNs) with quasi-linear activation functions when applied to time-series data characterized by multimodal frequency content. We demonstrate that, once trained, such networks exhibit properties analogous to Finite Impulse Response (FIR) filters, particularly when the convolutional kernels are of extended length exceeding those typically employed in standard CNN architectures. Causal CNNs are shown to capture spectral features both implicitly and explicitly, offering enhanced interpretability for tasks involving dynamic systems. Leveraging the associative property of convolution, we further show that the entire network can be reduced to an equivalent single-layer filter resembling an FIR filter optimized via least-squares criteria. This equivalence yields new insights into the spectral learning behavior of CNNs trained on signals with sparse frequency content. The approach is validated on both simulated beam dynamics and real-world bridge vibration datasets, underlining its relevance for modeling and identifying physical systems governed by dynamic responses.

Related papers

• Neuromorphic Wireless Split Computing with Resonate-and-Fire Neurons [69.73249913506042]
  This paper investigates a wireless split computing architecture that employs resonate-and-fire (RF) neurons to process time-domain signals directly.<n>By resonating at tunable frequencies, RF neurons extract time-localized spectral features while maintaining low spiking activity.<n> Experimental results show that the proposed RF-SNN architecture achieves comparable accuracy to conventional LIF-SNNs and ANNs.
  arXiv  Detail & Related papers  (2025-06-24T21:14:59Z)
• Dual-Frequency Filtering Self-aware Graph Neural Networks for Homophilic and Heterophilic Graphs [60.82508765185161]
  We propose Dual-Frequency Filtering Self-aware Graph Neural Networks (DFGNN) DFGNN integrates low-pass and high-pass filters to extract smooth and detailed topological features. It dynamically adjusts filtering ratios to accommodate both homophilic and heterophilic graphs.
  arXiv  Detail & Related papers  (2024-11-18T04:57:05Z)
• Exploring the Low-Pass Filtering Behavior in Image Super-Resolution [13.841859411005737]
  In this paper, we attempt to interpret the behavior of deep neural networks in image super-resolution. We propose a method named Hybrid Response Analysis (HyRA) to analyze the behavior of neural networks in ISR tasks. Finally, to quantify the injected high-frequency information, we introduce a metric for image-to-image tasks called Frequency Spectrum Distribution Similarity (FSDS)
  arXiv  Detail & Related papers  (2024-05-13T16:50:42Z)
• Widely Linear Matched Filter: A Lynchpin towards the Interpretability of Complex-valued CNNs [19.291619185044173]
  We introduce a general WLMF paradigm, provide its solution and undertake analysis of its performance. For rigor, our WLMF solution is derived without imposing any assumption on the probability density of noise. This serves to revisit the convolution-activation-pooling chain in complex-valued CNNs through the lens of matched filtering.
  arXiv  Detail & Related papers  (2024-01-30T04:01:18Z)
• How neural networks learn to classify chaotic time series [77.34726150561087]
  We study the inner workings of neural networks trained to classify regular-versus-chaotic time series. We find that the relation between input periodicity and activation periodicity is key for the performance of LKCNN models.
  arXiv  Detail & Related papers  (2023-06-04T08:53:27Z)
• Properties and Potential Applications of Random Functional-Linked Types of Neural Networks [81.56822938033119]
  Random functional-linked neural networks (RFLNNs) offer an alternative way of learning in deep structure. This paper gives some insights into the properties of RFLNNs from the viewpoints of frequency domain. We propose a method to generate a BLS network with better performance, and design an efficient algorithm for solving Poison's equation.
  arXiv  Detail & Related papers  (2023-04-03T13:25:22Z)
• The Spectral Bias of Polynomial Neural Networks [63.27903166253743]
  Polynomial neural networks (PNNs) have been shown to be particularly effective at image generation and face recognition, where high-frequency information is critical. Previous studies have revealed that neural networks demonstrate a $textitspectral bias$ towards low-frequency functions, which yields faster learning of low-frequency components during training. Inspired by such studies, we conduct a spectral analysis of the Tangent Kernel (NTK) of PNNs. We find that the $Pi$-Net family, i.e., a recently proposed parametrization of PNNs, speeds up the
  arXiv  Detail & Related papers  (2022-02-27T23:12:43Z)
• Unfolding recurrence by Green's functions for optimized reservoir computing [3.7823923040445995]
  Cortical networks are strongly recurrent, and neurons have intrinsic temporal dynamics. This sets them apart from deep feed-forward networks. We present a solvable recurrent network model that links to feed forward networks.
  arXiv  Detail & Related papers  (2020-10-13T09:17:10Z)
• Liquid Time-constant Networks [117.57116214802504]
  We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system's dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations.
  arXiv  Detail & Related papers  (2020-06-08T09:53:35Z)
• Volterra Neural Networks (VNNs) [24.12314339259243]
  We propose a Volterra filter-inspired Network architecture to reduce the complexity of Convolutional Neural Networks. We show an efficient parallel implementation of this Volterra Neural Network (VNN) along with its remarkable performance. The proposed approach is evaluated on UCF-101 and HMDB-51 datasets for action recognition, and is shown to outperform state of the art CNN approaches.
  arXiv  Detail & Related papers  (2019-10-21T19:22:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.