Sign inGet started
Paper · arXiv

Variational Bounds for Perceptron Learning from Structured Data

We introduce a variational approach to a finite-temperature continuous-spin perceptron trained on a Gaussian mixture. The model allows for a broad class of concave utilities and log-concave separable prior measures on the spins. By combining the interpolation method with log-concavity and concentration estimates, we derive lower and upper minimax variational bounds for the limiting quenched pressure. Remarkably, the two bounds differ only in the order of optimization of two variational parameters, while all remaining extrema are controlled by the concave--convex structure of the variational potential. Whenever the two optimizations commute, the two bounds match and identify the solution o...

AuthorsFrancesco Camilli, Pierluigi Contucci, Federica Gerace et al.
Primary categorycs.LG
Published5 August 2026
Last updated at source5 August 2026
cs.LGcond-mat.dis-nnmath-phstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/9b7e6e51-cb8a-493f-9bb6-5ea0750372c3" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.