Geometric Upper Bounds on Rates of Variable-Basis Approximation
DOI10.1109/TIT.2008.2006383zbMATH Open1319.68177OpenAlexW2099706683MaRDI QIDQ3604968FDOQ3604968
Authors: Věra Kůrková, Marcello Sanguineti 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.2006383
Recommendations
- Total variation error bounds for geometric approximation
- Non-uniform bounds for geometric approximation
- Approximation by Polynomials with Locally Geometric Rates
- Efficient and accurate computation of upper bounds of approximation errors
- Bounds on rates of variable-basis and neural-network approximation
- Geometric bounds for convergence rates of averaging algorithms
- Geometric asymptotic approximation of value functions
- A non uniform bound on geometric approximation with \(w\)-functions
- scientific article; zbMATH DE number 125062
model complexityneural networksrates of approximationvariable-basis approximationApproximation from a dictionary
Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cited In (22)
- Minimization of Error Functionals over Variable-Basis Functions
- Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems
- Convergence rates for shallow neural networks learned by gradient descent
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Minimizing sequences for a family of functional optimal estimation problems
- New insights into Witsenhausen's counterexample
- Can dictionary-based computational models outperform the best linear ones?
- Value and Policy Function Approximations in Infinite-Horizon Optimization Problems
- Some comparisons of complexity in dictionary-based and linear computational models
- Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
- High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
- On the approximation of functions by tanh neural networks
- Estimates of variation with respect to a set and applications to optimization problems
- Accuracy of approximations of solutions to Fredholm equations by kernel methods
- Bounds on rates of variable-basis and neural-network approximation
- Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption
- Approximation capabilities of neural networks on unbounded domains
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality
- Title not available (Why is that?)
- Complexity estimates based on integral transforms induced by computational units
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
This page was built for publication: Geometric Upper Bounds on Rates of Variable-Basis Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604968)
