Pages that link to "Item:Q4544714"
From MaRDI portal
The following pages link to Bounds on rates of variable-basis and neural-network approximation (Q4544714):
Displayed 35 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)
- Learning with generalization capability by kernel methods of bounded complexity (Q558012) (← links)
- The ridge function representation of polynomials and an application to neural networks (Q644645) (← links)
- Approximative compactness of linear combinations of characteristic functions (Q783713) (← links)
- Accuracy of suboptimal solutions to kernel principal component analysis (Q842769) (← links)
- Lower estimation of approximation rate for neural networks (Q848260) (← links)
- On the tractability of multivariate integration and approximation by neural networks (Q876822) (← links)
- Estimates of variation with respect to a set and applications to optimization problems (Q970575) (← links)
- Approximation schemes for functional optimization problems (Q1024253) (← links)
- When is approximation by Gaussian networks necessarily a linear process? (Q1886595) (← links)
- The Barron space and the flow-induced function spaces for neural network models (Q2117337) (← links)
- High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions (Q2118396) (← links)
- Uniform approximation rates and metric entropy of shallow neural networks (Q2157931) (← links)
- Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
- The weight-decay technique in learning from data: an optimization point of view (Q2271792) (← links)
- Super-resolution meets machine learning: approximation of measures (Q2338563) (← links)
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty (Q2450902) (← links)
- Functional optimal estimation problems and their solution by nonlinear approximation schemes (Q2471111) (← links)
- Approximation and learning by greedy algorithms (Q2477053) (← links)
- Weighted quadrature formulas and approximation by zonal function networks on the sphere (Q2496179) (← links)
- Rates of minimization of error functionals over Boolean variable-basis functions (Q2583503) (← links)
- Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems (Q3066914) (← links)
- Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data (Q3556804) (← links)
- Value and Policy Function Approximations in Infinite-Horizon Optimization Problems (Q3626047) (← links)
- Two-Layer Neural Networks with Values in a Banach Space (Q5055293) (← links)
- Wavelet neural networks functional approximation and application (Q5097861) (← links)
- (Q5159432) (← links)
- Optimization of approximating networks for optimal fault diagnosis (Q5317748) (← links)
- Geometric Rates of Approximation by Neural Networks (Q5448680) (← links)
- Deep learning: a statistical viewpoint (Q5887827) (← links)
- Approximating networks and extended Ritz method for the solution of functional optimization problems (Q5959916) (← links)
- A deep network construction that adapts to intrinsic dimensionality beyond the domain (Q6054952) (← links)
- Characterization of the variation spaces corresponding to shallow neural networks (Q6101230) (← links)
- Gradient descent on infinitely wide neural networks: global convergence and generalization (Q6200217) (← links)