Spectral Indistinguishability and Learning-Curve Identifiability in Quadratic Networks

We study what spectral summaries and scalar learning curves reveal about centered quadratic networks. We construct analytic positive input densities with exactly Gaussian one- and two-coordinate marginals.