In plain words: To prove a system of equations always settles to one steady state, they train a language model on fake examples built backward from known answers. It beat computer solvers and human mathematicians on polynomial systems and found new stability formulas for harder non-polynomial ones.
Abstract · Global Lyapunov functions: a long-standing open problem in mathematics, with symbolic transformers
Despite their spectacular progress, language models still struggle on complex reasoning tasks, such as advanced mathematics. We consider a long-standing open problem in mathematics: discovering a Lyapunov function that ensures the global stability of a dynamical system. This problem has no known general solution, and algorithmic solvers only exist for some small polynomial systems. We propose a new method for generating synthetic training samples from random solutions, and show that sequence-to-sequence transformers trained on such datasets perform better than algorithmic solvers and humans on polynomial systems, and can discover new Lyapunov functions for non-polynomial systems.
Alberto Alfarano, François Charton, Amaury Hayat
arXiv:2410.08304 · cs.LG · submitted Oct 10, 2024
abstract · pdf · html