arXiv (All)
open access
Delay Complexity Dimension: Learning with Delayed and Censored Labels
We study PAC learning of binary classifiers when labels arrive after random delays and are censored beyond an observation window $W$. How many samples does this observation model require? We propose a distribution-dependent answer, the Delay Complexity Dimension (DCD). The DCD combines the VC dimens
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
- Information-Theoretic Foundations of the AaroNet Multi-Scale Detector#237194
- Bagging Robustly Learns VC Classes with Linear Sample Complexity#451279
- Falsification and future performance#697812
- Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants#620563
- Convex Networks Remain Hard to Certify: Dimension-Accuracy Barriers for Lipschitz Constants#618884
Record · ID 1344758
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