Structured neural Lyapunov functions guarantee positive definiteness by design, and PLNet reaches the largest certified region on the inverted pendulum
For known nonlinear discrete-time systems, a controller and a control Lyapunov function can be trained jointly while positive definiteness of the candidate no longer rests on penalties at sampled states. Input convex neural networks and Polyak-Łojasiewicz networks, which carry lower and upper quadratic bounds and are therefore positive definite by construction, satisfy positivity and radial unboundedness directly, leaving only the closed-loop decrease condition for formal verification. On an inverted pendulum and a path-tracking benchmark, the PLNet attains the largest base and expanded certified regions on the inverted pendulum, and all five seeds certify in a single round.