A VAE-plus-Bayesian-optimization framework discovers new symbolic iterative optimization algorithms without assuming update function forms and faster than prior mathematical programming methods.
A constrained symbolic regression approach for Lyapunov function discovery
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we consider the data-driven discovery of Lyapunov functions for autonomous dynamical systems. We represent the Lyapunov function as an expression tree of fixed depth and formulate the Lyapunov discovery task as a constrained self-supervised symbolic regression problem. The constraints model the output of the Lyapunov function for a given input as well as the Lyapunov stability conditions. This modeling approach makes no a priori assumptions about the functional form of the Lyapunov function, is inherently interpretable since the function is obtained in a symbolic form, and, in principle, can be applied to any continuous dynamical system. We also develop a tailored branch-and-bound-and-check solution approach to efficiently solve the resulting learning task. Applications to several case studies show the ability of the proposed approach to discover Lyapunov functions.
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Symbolic Discovery of Iterative Algorithms: A Continuous Latent Space Bayesian Optimization Framework
A VAE-plus-Bayesian-optimization framework discovers new symbolic iterative optimization algorithms without assuming update function forms and faster than prior mathematical programming methods.