An entropy-optimal path to humble AI
Davide Bassetti, Luk\'a\v{s} Posp\'i\v{s}il, Michael Groom, Terence J. O'Kane, Illia Horenko

TL;DR
This paper introduces a novel entropy-optimizing reformulation of Boltzmann machines that creates more efficient, reliable, and high-performing AI models with lower costs and data requirements, especially useful in climate prediction.
Contribution
It presents a new mathematical framework for entropy-optimized Boltzmann machines that eliminates gradient descent, ensures model uniqueness, and provides confidence measures, improving performance and efficiency.
Findings
Models are more performant and slim compared to state-of-the-art tools.
Descriptor lengths are close to intrinsic complexity bounds.
Effective in climate prediction with minimal data.
Abstract
Progress of AI has led to very successful, but by no means humble models and tools, especially regarding (i) the huge and further exploding costs and resources they demand, and (ii) the over-confidence of these tools with the answers they provide. Here we introduce a novel mathematical framework for a non-equilibrium entropy-optimizing reformulation of Boltzmann machines based on the exact law of total probability and the exact convex polytope representations. We show that it results in the highly-performant, but much cheaper, gradient-descent-free learning framework with mathematically-justified existence and uniqueness criteria, and cheaply-computable confidence/reliability measures for both the model inputs and the outputs. Comparisons to state-of-the-art AI tools in terms of performance, cost and the model descriptor lengths on a broad set of synthetic and real-world problems with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training
