arXiv (All)
open access
The optimal information complexity of VC learning
Steinke and Zakynthinou(2020) introduces the Conditional Mutual Information (CMI) framework of analyzing the information complexity of learning algorithms based on algorithm-dependent information-theoretic quantities. We study one of these quantities, the evaluated Conditional Mutual Information (eC
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
- Generalization Bounds for Markov Algorithms through Entropy Flow Computations#819215
- Generalization Bounds for Markov Algorithms through Entropy Flow Computations#809223
- Constant-Loss Round-Preserving Direct Sums for Information Complexity#1326627
- Recursive Coordination Information Theory: Decision Sufficiency, Consequence Sufficiency, and Recursive Closure#1348407
- Informational Actualism and the Foundation G: From Metaphysics to Computable Facts#170106
Record · ID 1247527
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