arXiv (All)
open access
Learning Depth-3 Circuits with Polynomial Savings
We study the challenging problem of learning depth-three circuits in the mistake-bound model of (realizable) online learning, which is a more difficult model than distribution-free PAC learning. Prior algorithms for this problem, due to Servedio and Tan [ST17], could only learn polynomial-size depth
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
- Shift of Bias for Inductive Concept Learning.#478219
- Online Inference for Multiple Changepoint Problems.#1039635
- Powell-Style Model-Based Derivative-Free Optimization with Complexity Guarantees#987188
- State-Separation and Hybrid Argument for Circuit Lower Bounds: A Structural Approach Toward P̸=NP#101306
- Adaptive Multi-Branching for Shallow Decision Tree Induction#794071
Record · ID 1011861
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