mlsanityData to 14 Oct 2026

Continuous-Time Signal Decomposition: An Implicit Neural Generalization of PCA and ICA

arXiv 2507.09091 ↗First posted 12 Jul 2025cs.LG eess.SP stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We generalize the low-rank decomposition problem, such as principal and independent component analysis (PCA, ICA) for continuous-time vector-valued signals and provide a model-agnostic implicit neural signal representation framework to learn numerical approximations to solve the problem. Modeling signals as continuous-time stochastic processes, we unify the approaches to both the PCA and ICA problems in the continuous setting through a contrast function term in the network loss, enforcing the desired statistical properties of the source signals (decorrelation, independence) learned in the decomposition. This extension to a continuous domain allows the application of such decompositions to point clouds and irregularly sampled signals where standard techniques are not applicable.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 22 references that are in the map. First posted on arXiv 12 Jul 2025.

Builds on

5 of 22 references.

References · 5

  1. 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,238
  2. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
  3. 2014A Tutorial on Principal Component Analysiscited by 141
  4. 2021Point Cloud Audio Processingcited by 3
  5. 2024Rethinking Non-Negative Matrix Factorization with Implicit Neural Representationscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.