arXiv (All)
open access
Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
Recent works explore deep learning's success by examining functions or data with hierarchical structure. To study the learning complexity of functions with hierarchical structure, we study the noise stability of functions with tree hierarchical structure on independent inputs. We show that if each f
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
- Training-Free Adversarial Robustness in Computational MRI#1216139
- Coloring the Noise: Adversarial Sobolev Alignment for Faithful Image Super Resolution#228179
- Upper Bounds on the Generalization Error of Deep Learning Models via Local Robustness and Stability#280214
- Anon: Extrapolating Adaptivity Beyond SGD and Adam#1062898
- Preprocessing Failure and Adversarial Detection in Depthwise-Separable Edge Vision Systems#639611
Record · ID 1186318
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