Aston Publications Explorer
metadata only
The Exact Sample Complexity of PAC-Learning Problems with Unit VC Dimension
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
- A Statistical Approach to Estimating Sample Size of Machine Learning Models#987286
- Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails#926419
- The Davis Duality of Approximation and Obstruction: Why Machine Learning Works, Why the Vacuum Has Mass, and the Universal Law of Flat Failure#181370
- A general sample size framework for developing or updating a predictive algorithm: with application to clinical prediction models.#220960
- Approximate pushforward designs and image bounds on approximations#617905
Record · ID 230058
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