scientific article; zbMATH DE number 1182753
From MaRDI portal
Publication:4400833
zbMath0905.41011MaRDI QIDQ4400833
Publication date: 11 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Deep learning: a statistical viewpoint ⋮ Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets ⋮ A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves ⋮ Complexity estimates based on integral transforms induced by computational units ⋮ Can dictionary-based computational models outperform the best linear ones? ⋮ Some comparisons of complexity in dictionary-based and linear computational models ⋮ Learning with generalization capability by kernel methods of bounded complexity ⋮ Geometric Rates of Approximation by Neural Networks ⋮ Complexity of Gaussian-radial-basis networks approximating smooth functions ⋮ Some implications of interval approach to dimension for network complexity