Pages that link to "Item:Q2643849"
From MaRDI portal
The following pages link to A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves (Q2643849):
Displaying 11 items.
- Can dictionary-based computational models outperform the best linear ones? (Q456017) (← links)
- Some comparisons of complexity in dictionary-based and linear computational models (Q553254) (← links)
- Comparing fixed and variable-width Gaussian networks (Q889280) (← links)
- Complexity estimates based on integral transforms induced by computational units (Q1941596) (← links)
- Approximation rates for neural networks with general activation functions (Q1982446) (← links)
- Approximation of Sobolev classes by polynomials and ridge functions (Q2389529) (← links)
- Neural network with unbounded activation functions is universal approximator (Q2399647) (← links)
- Complexity of Shallow Networks Representing Finite Mappings (Q2814145) (← links)
- An Integral Upper Bound for Neural Network Approximation (Q3399370) (← links)
- Minimization of Error Functionals over Perceptron Networks (Q3539962) (← links)
- Integral representations of shallow neural network with Rectified Power Unit activation function (Q6386309) (← links)