The reviewed record of science sign in
Pith

arxiv: 2507.09091 · v1 · pith:AG5LQXIA · submitted 2025-07-12 · cs.LG · eess.SP· stat.ML

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

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:AG5LQXIArecord.jsonopen to challenge →

classification cs.LG eess.SPstat.ML
keywords signalscontinuous-timedecompositioncontinuousimplicitneuralproblemsignal
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.