Skip to content
Open access

The Linear Series Decomposition Learner (LSDL): A Multi-Geometric Theory of Signal Structure and Representation

Aug 2026 · Signals · Vol 7, pp. 83 · 0 citations · 23 references

TL;DR

By establishing recursive support localisation as a principled mechanism through which complementary signal geometries emerge, the LSDL provides a mathematically grounded framework for interpretable signal representation, structural analysis, and representation learning across diverse signal-processing applications.

Abstract

Signal representation underpins modern signal processing, yet many existing methods primarily transform signals into alternative domains without explicitly modelling how informative signal structure evolves during recursive localisation. This paper presents the Linear Series Decomposition Learner (LSDL), a multi-geometric theory of signal structure and representation founded on recursive support localisation. The LSDL is formulated as a recursive localisation operator acting on a fixed amplitude-reference domain, thereby establishing a mathematically rigorous framework for analysing the evolution of signal support across successive localisation levels. Theoretical analysis characterises the fundamental properties of the operator, including support evolution, monotonicity, finite recursion, perturbation stability, and admissible localisation, and it thereby provides a formal foundation for recursive signal decomposition. Building upon this operator-theoretic formulation, the proposed framework establishes that recursive support localisation induces multiple complementary geometries of signal structure. These comprise support geometry, which describes the organisation of retained signal support; discriminative geometry, which characterises class separability under recursive localisation; information geometry, which quantifies entropy redistribution and information concentration; persistence geometry, which models the emergence, evolution, and lifetime of localised signal structures across recursive filtrations; and spectral geometry, which describes recursion-induced reorganisation within the frequency domain. Collectively, these complementary geometries provide a coherent multi-geometric representation that captures structural, statistical, topological, and spectral characteristics within a common mathematical framework. The proposed theory is supported through analytical development and empirical evaluation using synthetic benchmark signals, real-world electromyographic (EMG) datasets, and comparative analyses against established signal representation approaches, including the short-time Fourier transform (STFT), wavelet transforms, empirical mode decomposition (EMD), variational mode decomposition (VMD), and sparse coding. Experimental results demonstrate that recursive support localisation produces interpretable multi-geometric representations while maintaining competitive classification performance and low online computational cost. By establishing recursive support localisation as a principled mechanism through which complementary signal geometries emerge, the LSDL provides a mathematically grounded framework for interpretable signal representation, structural analysis, and representation learning across diverse signal-processing applications.

Read PDF

Similar papers

Preprint Aug 2026

Convergence analysis of Parametric Probabilistic Manifold Decomposition

A coupled perturbation analysis for the entire PPMD procedure identifies how the principal errors interact and which components limit the accuracy of the nonlinear reduced order model.

Jia-Ming Guo, Dun-Hui Xiao · 0 citations
#machine learning Preprint Sep 2026

Geometry-Aware Operator Families for Structured Representation Learning

GIOF first transforms geometry-derived interaction channels into reusable generator bases, then combines them through a context-dependent selector and adaptive propagation scale, and finally realizes the selected operator through stable continuous-time propagation and a bottleneck residual layer.

Zu-Yuan Zhang, Fei Yu, Tian Lan · 0 citations
#machine learning Preprint Sep 2026

Transformation Laws in Neural Representations: Structure, Realisability, and Construction

How neural representations preserve the structure of input changes connects representation analysis with internal intervention. We study operable representational content through compatible actions of reference transformations on neural features. We characterise when a transformation descends through an encoder, and gi...

Yuan Sun · 0 citations
Preprint Aug 2026

Sparse Separable Factor Analysis in the Complex Domain with an Application to Local Field Potential Data

SSFA is developed, a latent factor model for complex-valued arrays with a separable covariance structure across modes that improves covariance estimation relative to vectorization-based methods, including complex principal component analysis.

Ian Hultman, Kirtikanth Kalapatapu, Yassine Filali et al. · 0 citations
Open access Sep 2026

A canonical entropy-based multiscale decomposition of L1 functions

This work introduces a canonical entropy-based multiscale decomposition of nonnegative L1 functions that yields both physically meaningful approximations and an injective representation and establishes the Hahn D– c decomposition as a canonical information-theoretic framework that unifies multiscale approximation and r...

Rajeev Rajaram, N. Ritchey · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.