arXiv (All)
open access
Tight Stochastic Sequential Covers for General VC Classes with Unknown i.i.d. Features
We study hybrid online learning with stochastic features and adversarial labels when the feature distribution is unknown. Prior work gave stochastic sequential covers of log-size $O(d\log^2 T)$ for a general VC class and logarithmic bounds only under stronger star-type structure. We show that finite
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 Sharp Dynamic Haussler Lemma#1414578
- A Sharp Dynamic Haussler Lemma#1406467
- Optimal estimates for the $\ell^p$-Lipschitz constants of deep random ReLU neural networks#1483158
- On Minimum Divergence for Distribution Reconstruction#1357527
- Fisher information and the geometry of memorization in neural networks#1327751
Record · ID 1536609
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