Tag: algebraic

Algebraic Robustness Verification of Neural Networks arXiv:2602.06105v1 Announce Type: new Abstract: We formulate formal robustness verification of neural networks as an algebraic optimization problem. We leverage the Euclidean Distance (ED) degree, which is the generic number of complex critical points of the distance minimization problem to a classifier’s decision boundary, as an architecture-dependent measure of…