PAC-Bayesian bounds for early-exit networks depend on expected depth E[D] and exit-depth entropy H(D), with sample complexity O((E[D] · d + H(D))/ε²) and provable advantages over fixed-depth networks under stated conditions.
Pac-bayes bounds for supervised classification
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
When Do Early-Exit Networks Generalize? A PAC-Bayesian Theory of Adaptive Depth
PAC-Bayesian bounds for early-exit networks depend on expected depth E[D] and exit-depth entropy H(D), with sample complexity O((E[D] · d + H(D))/ε²) and provable advantages over fixed-depth networks under stated conditions.