Pages that link to "Item:Q3604968"

The following pages link to Geometric Upper Bounds on Rates of Variable-Basis Approximation (Q3604968):

Displaying 19 items.

• Accuracy of approximations of solutions to Fredholm equations by kernel methods (Q433295) (← 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)
• 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)
• New insights into Witsenhausen's counterexample (Q694180) (← links)
• Estimates of variation with respect to a set and applications to optimization problems (Q970575) (← links)
• Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions (Q1008456) (← 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)
• High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions (Q2118396) (← links)
• Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty (Q2450902) (← links)
• Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems (Q3066914) (← 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)
• On the approximation of functions by tanh neural networks (Q6055124) (← links)
• Approximation capabilities of neural networks on unbounded domains (Q6055159) (← links)
• Convergence rates for shallow neural networks learned by gradient descent (Q6137712) (← links)
• Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality (Q6155895) (← links)