Simplified derivations for high-dimensional convex learning problems
Abstract
Statistical-physics calculations in machine learning and theoretical neuroscience often involve lengthy derivations that obscure physical interpretation. Here, we give concise, non-replica derivations of several key results and highlight their underlying similarities. In particular, using a cavity approach, we analyze three high-dimensional learning problems: perceptron classification of points, perceptron classification of manifolds, and kernel ridge regression. These problems share a common structure--a bipartite system of interacting feature and datum variables--enabling a unified analysis. Furthermore, for perceptron-capacity problems, we identify a symmetry that allows derivation of correct capacities through a naive method.
Cite
@article{arxiv.2412.01110,
title = {Simplified derivations for high-dimensional convex learning problems},
author = {David G. Clark and Haim Sompolinsky},
journal= {arXiv preprint arXiv:2412.01110},
year = {2025}
}
Comments
Submission to SciPost; 29 pages, 1 figure; revised following review by referees