Category: math.AG
-
Algebraic Robustness Verification of Neural Networks
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…
-
Singular leaning coefficients and efficiency in learning theory
Singular leaning coefficients and efficiency in learning theory arXiv:2501.12747v1 Announce Type: new Abstract: Singular learning models with non-positive Fisher information matrices include neural networks, reduced-rank regression, Boltzmann machines, normal mixture models, and others. These models have been widely used in the development of learning machines. However, theoretical analysis is still in its early stages. In…