Can dictionary-based computational models outperform the best linear ones? (Q456017)
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: Can dictionary-based computational models outperform the best linear ones? |
scientific article; zbMATH DE number 6097859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Can dictionary-based computational models outperform the best linear ones? |
scientific article; zbMATH DE number 6097859 |
Statements
Can dictionary-based computational models outperform the best linear ones? (English)
0 references
23 October 2012
0 references
dictionary-based approximation
0 references
linear approximation
0 references
rates of approximation
0 references
worst-case error
0 references
Kolmogorov width
0 references
perceptron networks
0 references
0 references
0 references
0.8157113194465637
0 references
0.7107170820236206
0 references
0.7070746421813965
0 references
0.7026780247688293
0 references
