Pages that link to "Item:Q4544781"

The following pages link to Comparison of worst case errors in linear and neural network approximation (Q4544781):

Displaying 48 items.

• Regularized vector field learning with sparse approximation for mismatch removal (Q75781) (← links)
• Kolmogorov \(n\)-widths of function classes induced by a non-degenerate differential operator: a convex duality approach (Q255181) (← links)
• Linear and nonlinear approximation of spherical radial basis function networks (Q290797) (← links)
• 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)
• Estimation of approximating rate for neural network in \(L^p_w\) spaces (Q442994) (← links)
• 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)
• Suboptimal solutions to dynamic optimization problems via approximations of the policy functions (Q613579) (← links)
• Minimizing sequences for a family of functional optimal estimation problems (Q613600) (← links)
• Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling (Q711389) (← 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)
• Error bounds for suboptimal solutions to kernel principal component analysis (Q968012) (← links)
• Estimates of variation with respect to a set and applications to optimization problems (Q970575) (← links)
• Complexity of Gaussian-radial-basis networks approximating smooth functions (Q998978) (← links)
• Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions (Q1008456) (← links)
• Approximation schemes for functional optimization problems (Q1024253) (← links)
• Provable approximation properties for deep neural networks (Q1742817) (← links)
• When is approximation by Gaussian networks necessarily a linear process? (Q1886595) (← links)
• Complexity estimates based on integral transforms induced by computational units (Q1941596) (← links)
• Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results (Q1949593) (← links)
• Uniform approximation rates and metric entropy of shallow neural networks (Q2157931) (← links)
• Probabilistic lower bounds for approximation by shallow perceptron networks (Q2181058) (← links)
• Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison (Q2271788) (← links)
• Super-resolution meets machine learning: approximation of measures (Q2338563) (← links)
• Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets (Q2381815) (← 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)
• 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)
• 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)
• Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption (Q4979399) (← links)
• (Q5053289) (← links)
• Two-Layer Neural Networks with Values in a Banach Space (Q5055293) (← links)
• Optimization of approximating networks for optimal fault diagnosis (Q5317748) (← 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)
• Approximation capabilities of neural networks on unbounded domains (Q6055159) (← links)
• Characterization of the variation spaces corresponding to shallow neural networks (Q6101230) (← links)
• Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality (Q6155895) (← links)
• Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks (Q6489780) (← links)