Pages that link to "Item:Q1370865"
From MaRDI portal
The following pages link to Approximation and learning of convex superpositions (Q1370865):
Displaying 10 items.
- Accuracy of approximations of solutions to Fredholm equations by kernel methods (Q433295) (← links)
- Approximative compactness of linear combinations of characteristic functions (Q783713) (← links)
- Best approximation by linear combinations of characteristic functions of half-spaces. (Q1395802) (← links)
- Complexity estimates based on integral transforms induced by computational units (Q1941596) (← links)
- Depth separations in neural networks: what is actually being separated? (Q2117335) (← links)
- Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets (Q2381815) (← links)
- Rates of minimization of error functionals over Boolean variable-basis functions (Q2583503) (← links)
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves (Q2643849) (← links)
- An Integral Upper Bound for Neural Network Approximation (Q3399370) (← links)
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality (Q6155895) (← links)
