HyParLyVe verifies neural Lyapunov candidates soundly and completely by modeling shallow ReLU networks as hyperplane arrangements, enabling finite vertex evaluations for positive definiteness and bounded optimization for the decrease condition.
Reachability analysis and safety verification for neural network control systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
HyParLyVe: Hyperplane Partitioning for Neural Lyapunov Verification
HyParLyVe verifies neural Lyapunov candidates soundly and completely by modeling shallow ReLU networks as hyperplane arrangements, enabling finite vertex evaluations for positive definiteness and bounded optimization for the decrease condition.