Pith. sign in

REVIEW 2 cited by

Spectral Inference Networks: Unifying Deep and Spectral Learning

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 1806.02215 v3 pith:JFEWX66L submitted 2018-06-06 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords spectralinferencenetworkslearningeigenfunctionsoperatorsfeaturelinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present Spectral Inference Networks, a framework for learning eigenfunctions of linear operators by stochastic optimization. Spectral Inference Networks generalize Slow Feature Analysis to generic symmetric operators, and are closely related to Variational Monte Carlo methods from computational physics. As such, they can be a powerful tool for unsupervised representation learning from video or graph-structured data. We cast training Spectral Inference Networks as a bilevel optimization problem, which allows for online learning of multiple eigenfunctions. We show results of training Spectral Inference Networks on problems in quantum mechanics and feature learning for videos on synthetic datasets. Our results demonstrate that Spectral Inference Networks accurately recover eigenfunctions of linear operators and can discover interpretable representations from video in a fully unsupervised manner.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Graph-regularized learning on data-augmentation graphs has transductive error ≤ C/n_L + R_DA(y), where R_DA is the graph-cut mass of augmentations crossing label boundaries.

  2. Generalizable Spectral Embedding with an Application to UMAP

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A post-processing diagonalization step turns SpectralNet's rotationally ambiguous output into the actual eigenvectors, yielding scalable, generalizable spectral embeddings and a generalizable UMAP.

Pith tools