Erzeugungsgrad, VC-dimension and neural networks with rational activation function.
Saved in:
| Title: | Erzeugungsgrad, VC-dimension and neural networks with rational activation function. |
|---|---|
| Authors: | Pardo, Luis Miguel1 (AUTHOR) luis.m.pardo@gmail.com, Sebastián, Daniel2 (AUTHOR) danielsesan@gmail.com |
| Source: | Applicable Algebra in Engineering, Communication & Computing. Mar2026, Vol. 37 Issue 2, p389-471. 83p. |
| Subjects: | Artificial neural networks, Intersection theory, Algebraic varieties, Computational learning theory |
| Abstract: | The notion of Erzeugungsgrad was introduced by Joos Heintz in (Theoret Comput Sci 24:239–277, 1983) to bound the number of non-empty cells occurring after a process of quantifier elimination. We extend this notion and the combinatorial bounds of Theorem 2 in Heintz (1983) using the degree for constructible sets defined in Pardo and Sebastián (J Complex 68:101588, 2022). We show that the Erzeugungsgrad is the key ingredient to connect affine Intersection Theory over algebraically closed fields and the VC-Theory of Computational Learning Theory for families of classifiers given by parameterized families of constructible sets. In particular, we prove that the VC-dimension and the Krull dimension are linearly related up to logarithmic factors based on Intersection Theory. Using this relation, we study the density of correct test sequences in evasive varieties. We apply these ideas to analyze parameterized families of neural networks with rational activation function. [ABSTRACT FROM AUTHOR] |
| Copyright of Applicable Algebra in Engineering, Communication & Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 192963932 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Erzeugungsgrad, VC-dimension and neural networks with rational activation function. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Pardo%2C+Luis+Miguel%22">Pardo, Luis Miguel</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> luis.m.pardo@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Sebastián%2C+Daniel%22">Sebastián, Daniel</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> danielsesan@gmail.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Applicable+Algebra+in+Engineering%2C+Communication+%26+Computing%22">Applicable Algebra in Engineering, Communication & Computing</searchLink>. Mar2026, Vol. 37 Issue 2, p389-471. 83p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Artificial+neural+networks%22">Artificial neural networks</searchLink><br /><searchLink fieldCode="DE" term="%22Intersection+theory%22">Intersection theory</searchLink><br /><searchLink fieldCode="DE" term="%22Algebraic+varieties%22">Algebraic varieties</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+learning+theory%22">Computational learning theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: The notion of Erzeugungsgrad was introduced by Joos Heintz in (Theoret Comput Sci 24:239–277, 1983) to bound the number of non-empty cells occurring after a process of quantifier elimination. We extend this notion and the combinatorial bounds of Theorem 2 in Heintz (1983) using the degree for constructible sets defined in Pardo and Sebastián (J Complex 68:101588, 2022). We show that the Erzeugungsgrad is the key ingredient to connect affine Intersection Theory over algebraically closed fields and the VC-Theory of Computational Learning Theory for families of classifiers given by parameterized families of constructible sets. In particular, we prove that the VC-dimension and the Krull dimension are linearly related up to logarithmic factors based on Intersection Theory. Using this relation, we study the density of correct test sequences in evasive varieties. We apply these ideas to analyze parameterized families of neural networks with rational activation function. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Applicable Algebra in Engineering, Communication & Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192963932 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s00200-025-00723-4 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 83 StartPage: 389 Subjects: – SubjectFull: Artificial neural networks Type: general – SubjectFull: Intersection theory Type: general – SubjectFull: Algebraic varieties Type: general – SubjectFull: Computational learning theory Type: general Titles: – TitleFull: Erzeugungsgrad, VC-dimension and neural networks with rational activation function. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Pardo, Luis Miguel – PersonEntity: Name: NameFull: Sebastián, Daniel IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 09381279 Numbering: – Type: volume Value: 37 – Type: issue Value: 2 Titles: – TitleFull: Applicable Algebra in Engineering, Communication & Computing Type: main |
| ResultId | 1 |