Pith. sign in

REVIEW 1 cited by

Rethinking Non-Negative Matrix Factorization with Implicit Neural Representations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.04439 v2 pith:3JTZJSCE submitted 2024-04-05 eess.AS cs.LGcs.SD

classification eess.AScs.LGcs.SD
keywords matrixrepresentationsapplicationsdatafactorizationlikenon-negativestored
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Non-negative Matrix Factorization (NMF) is a powerful technique for analyzing regularly-sampled data, i.e., data that can be stored in a matrix. For audio, this has led to numerous applications using time-frequency (TF) representations like the Short-Time Fourier Transform. However extending these applications to irregularly-spaced TF representations, like the Constant-Q transform, wavelets, or sinusoidal analysis models, has not been possible since these representations cannot be directly stored in matrix form. In this paper, we formulate NMF in terms of learnable functions (instead of vectors) and show that NMF can be extended to a wider variety of signal classes that need not be regularly sampled.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    cs.LG 2025-07 conditional novelty 5.0 of 10

    An implicit neural network framework learns PCA or ICA decompositions directly from irregularly sampled continuous signals.

Pith tools