Linear embedding of free energy minimization
Jonathan E. Moussa

TL;DR
This paper introduces a linear programming approach to approximate free energy minimization deterministically, preserving key properties like convexity and bounds, with promising results on small systems.
Contribution
It presents a novel linear embedding method for free energy minimization that maintains important properties often lost in other approximations.
Findings
Successful preservation of convexity and bounds
Effective on small systems
Needs further development for large systems
Abstract
Exact free energy minimization is a convex optimization problem that is usually approximated with stochastic sampling methods. Deterministic approximations have been less successful because many desirable properties have been difficult to attain. Such properties include the preservation of convexity, lower bounds on free energy, and applicability to systems without subsystem structure. We satisfy all of these properties by embedding free energy minimization into a linear program over energy-resolved expectation values. Numerical results on small systems are encouraging, but a lack of size consistency necessitates further development for large systems.
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
TopicsStochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods · Complexity and Algorithms in Graphs
