Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research establishes mathematical bounds for the robustness of neural networks utilizing Pfaffian activation functions, specifically analyzing condition numbers in uniform and Gaussian settings. By generalizing results from algebraic geometry to smooth Pfaffian hypersurfaces, the study provides polynomial-in-width guarantees for single-hidden-layer sigmoid networks with rational weights. These findings offer a rigorous theoretical framework for understanding decision boundary stability in specialized neural architectures.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Tubular Neighbourhoods of Pfaffian Sets and Applications to Neural Networks

arXiv1 min read

arXiv:2607.08370v2 Announce Type: replace-cross Abstract: We derive bounds for the volume of tubular neighbourhoods of smooth Pfaffian hypersurfaces, generalising known results for algebraic varieties. The bounds are given in terms of the Pfaffian format of the defining functions. As an application, we obtain tail bounds on the probability distribution of a condition number measuring the robustness of neural network classifiers with Pfaffian activation functions, in both the uniform and Gaussian settings. In the special case of single-hidden-layer sigmoid networks with rational weights, we derive polynomial-in-width bounds for tubular neighbourhoods of the decision boundary.

Abstract:We derive bounds for the volume of tubular neighbourhoods of smooth Pfaffian hypersurfaces, generalising known results for algebraic varieties. The bounds are given in terms of the Pfaffian format of the defining functions. As an application, we obtain tail bounds on the probability distribution of a condition number measuring the robustness of neural network classifiers with Pfaffian activation functions, in both the uniform and Gaussian settings. In the special case of single-hidden-layer sigmoid networks with rational weights, we derive polynomial-in-width bounds for tubular neighbourhoods of the decision boundary.

Algebraic Geometry (math.AG); Machine Learning (cs.LG)

arXiv:2607.08370 [math.AG]

(or arXiv:2607.08370v2 [math.AG] for this version)

https://doi.org/10.48550/arXiv.2607.08370 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 183 words

Related coverage