Sample size lower bounds in PAC learning by Algorithmic Complexity Theory (Q1274920)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sample size lower bounds in PAC learning by Algorithmic Complexity Theory |
scientific article |
Statements
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory (English)
0 references
12 January 1999
0 references
computational learning
0 references
Kolmogorov complexity
0 references
sample complexity
0 references
0 references
0 references
0 references
