Pages that link to "Item:Q456017"
From MaRDI portal
The following pages link to Can dictionary-based computational models outperform the best linear ones? (Q456017):
Displaying 4 items.
- A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization (Q411092) (← links)
- Accuracy of approximations of solutions to Fredholm equations by kernel methods (Q433295) (← links)
- Correlations of random classifiers on large data sets (Q2100403) (← links)
- Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
