Pages that link to "Item:Q553254"
From MaRDI portal
The following pages link to Some comparisons of complexity in dictionary-based and linear computational models (Q553254):
Displaying 8 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)
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results (Q1949593) (← links)
- Correlations of random classifiers on large data sets (Q2100403) (← links)
- Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
- Smart sampling and incremental function learning for very large high dimensional data (Q2418181) (← links)
- Approximation capabilities of neural networks on unbounded domains (Q6055159) (← links)
- On decision regions of narrow deep neural networks (Q6078750) (← links)
