MIT Open Scholarship
metadata only
On the Sample Complexity of PAC-learning using Random and Chosen Examples
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
- Resource-Aware Federated Mixture-of-Experts with Adaptive Pruning for Onboard Learning in LEO Satellite Constellations#1115888
- Large deviations for random sums and random convex polygons#326181
- Tight Sampling Complexity with stochastic gradient oracles in Fixed Dimensions#1070079
- Learning De-Biased Representations for Remote-Sensing Imagery#1082918
- Evolution of noisy learning in games.#213904
Record · ID 464646
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