Delay Complexity Dimension: Learning with Delayed and Censored Labels HPEEJY1S3S
| URI | m2://res/HPEEJY1S3S |
|---|---|
| Kind | preprint |
| Creators | Madhava Gaikwad |
| Date | 2026-10-13 |
| Subjects | arxiv stat.ML, arxiv cs.IT, arxiv cs.LG, arxiv math.IT |
| Scope | border |
Expressions
e1: version, preprint
| Date | 2026-10-13 |
|---|---|
| Ids | arXiv 2610.18935 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Quantization preserves information | statement | lemma 9 | arxiv |
| Bias-variance decomposition | statement | lemma 10 | arxiv |
| Threshold policy | statement | theorem 16 | arxiv |
| Nonzero delay strictly improves | statement | theorem 20 | arxiv |
| Lifted-class complexity | statement | lemma 11 | arxiv |
| Effective sample size with random expedition | statement | theorem 15 | arxiv |
| Information-theoretic lower bound | statement | theorem 4 | arxiv |
| Limiting cases | statement | proposition 2 | arxiv |
| Delay Complexity Dimension | definition | definition 1 | arxiv |
| Phase regimes | statement | theorem 22 | arxiv |
| Oracle pseudo-label ERM upper bound | statement | theorem 7 | arxiv |
| Quantized oracle pseudo-label ERM | statement | theorem 12 | arxiv |
| Effective sample size | statement | theorem 13 | arxiv |
| Diversity benefit under per-labeler normalization | statement | theorem 21 | arxiv |
Catalogue records
- arxiv: 2610.18935 (work)