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

Shayan K. Azmoodeh, Krishna Subramani, Paris Smaragdis
7/12/2025
cs.LGeess.SPstat.ML

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{azmoodeh2025continuoustime,
  title  = {Continuous-Time Signal Decomposition: An Implicit Neural Generalization of PCA and ICA},
  author = {Shayan K. Azmoodeh and Krishna Subramani and Paris Smaragdis},
  year   = {2025},
  eprint = {2507.09091},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.09091v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.09091.svg)](https://codeofpaper.com/paper/2507.09091)

Discussion