Read original
arXivFrancesco CamilliPapers84

Variational Bounds for Perceptron Learning from Structured Data

This paper studies a finite-temperature continuous-spin perceptron trained on Gaussian-mixture data. It supports a broad class of concave utilities and log-concave separable priors over the spins. Using interpolation, log-concavity, and concentration estimates, the authors derive lower and upper minimax variational bounds for the limiting quenched pressure. The bounds differ only in the order of optimizing two variational parameters. When those optimizations commute, the bounds coincide and characterize the model. The resulting potential also supplies stationarity equations and a unified route to computing ground-state energy, training loss, and generalization error.

Why it's worth reading

It is timely because it connects structured-data perceptron learning, loss, and generalization through one variational potential, while making the condition for tight bounds explicit.

Tags

感知机变分方法高斯混合统计物理泛化误差对数凹性