arXiv (All)
open access
Networks with Finite VC Dimension: Pro and Contra
Approximation and learning of classifiers of large data sets by neural networks in terms of high-dimensional geometry and statistical learning theory are investigated. The influence of the VC dimension of sets of input-output functions of networks on approximation capabilities is compared with its i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Statistical Learning Theory and Applications#67000
- Statistical Learning Theory and Applications#3506
- A Borel Concept Class of VC Dimension One with a Non-PAC Consistent Learner in ZFC#799462
- A Borel Concept Class of VC Dimension One with a Non-PAC Consistent Learner in ZFC#798039
- Low Rank Based Subspace Inference for the Laplace Approximation of Bayesian Neural Networks#131285
Record · ID 1248246
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive