Optimal mistake bound learning is hard (Q1271479)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal mistake bound learning is hard |
scientific article; zbMATH DE number 1220704
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal mistake bound learning is hard |
scientific article; zbMATH DE number 1220704 |
Statements
Optimal mistake bound learning is hard (English)
0 references
23 May 2000
0 references
The authors have suggested and established the fact that a combinatorial function \(K\) can be constructed in polynomial time for a given optimal MB learning algorithm as subroutine. It is also same as the reverse reduction theorem of Little Stone. Subsequently, the authors have established that the \(k\)-dimension problem and optimal MB learning have the same time complexity.
0 references
MB learning
0 references
