AI RESEARCH
Quadratic Characterizations for Reachability Analysis of Neural Networks
arXiv CS.LG
•
ArXi:2605.20482v1 Announce Type: new Quadratic constraints (QCs) are widely used to characterize nonlinearities and uncertainties, but generic analytical characterizations can be conservative on bounded domains. This paper develops a framework for constructing verified quadratic characterizations of scalar relations in the two-dimensional real plane. Candidate quadratic inequalities are locally generated by solving convex quadratic programs using samples from the relation and exterior sample points.