arXiv Machine Learning

Variational Bounds for Perceptron Learning from Structured Data

arXiv:2608. 04882v1 Announce Type: new Abstract: We introduce a variational approach to a finite-temperature continuous-spin perceptron trained on a Gaussian mixture.

arXiv Machine Learning
Jul 30

On the robustness of noisy solutions in non-convex neural networks

arXiv:2607. 27000v1 Announce Type: cross Abstract: Optimization in non-convex neural network models is strongly influenced by the geometry of the solution space: sparse, isolated, point-like clusters are typically algorithmically inaccessible, whereas wide and flat regions can be found efficiently despite being relatively rare.

By Enrico M. Malatesta, Alessandra Passalacqua, Riccardo Zecchina
arXiv Machine Learning
Sep 15

Bridging Control, Inference, Transport, and Thermodynamics: From Theory to Applications in Learning

The review explores how control theory, optimal transport, probabilistic inference, non‑equilibrium thermodynamics, and machine learning are interconnected through the optimization of free‑energy‑like functionals under dynamical or statistical constraints. It presents a conceptual thread linking these five fields and illustrates the ideas with applications in reinforcement learning, variational inference, and generative modeling. The article is written for readers without prior familiarity, beginning with physics principles.

By Emmy Blumenthal, Nikolas Claussen, Benjamin Eysenbach, Catherine Ji, Gautam Reddy, Colin Scheibner, Benjamin Sorkin
arXiv Machine Learning
Sep 15

Quenched Ensemble Sampling

arXiv:2609.15894v1 Announce Type: cross Abstract: Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states cha...

By David Yallup
arXiv Machine Learning
Sep 17

Curvature-aware Expected Free Energy as an Acquisition Function for Bayesian Optimization

The paper introduces a curvature‑aware Expected Free Energy (EFE) acquisition function for Bayesian optimization, designed to jointly learn and optimize an underlying function. It demonstrates that, under certain assumptions, EFE reduces to familiar criteria such as Upper Confidence Bound, Lower Confidence Bound, and Expected Information Gain, and provides unbiased convergence guarantees for concave functions. Empirical results on a Van der Pol oscillator system identification task and a two‑dimensional oscillatory benchmark show that the adaptive EFE achieves competitive performance in both regret and mean squared error, outperforming typical acquisition functions that excel in only one metric.

By Ajith Anil Meera, Wouter Kouw