Bounds on rates of variable-basis and neural-network approximation
From MaRDI portal
Publication:4544714
Recommendations
Cited in
(56)- Approximation schemes for functional optimization problems
- A note on error bounds for function approximation using nonlinear networks
- Rates of convex approximation in non-Hilbert spaces
- When is approximation by Gaussian networks necessarily a linear process?
- Approximation rates for neural networks with encodable weights in smoothness spaces
- The Barron space and the flow-induced function spaces for neural network models
- High-order approximation rates for shallow neural networks with cosine and \(\mathrm{ReLU}^k\) activation functions
- Uniform approximation rates and metric entropy of shallow neural networks
- Probabilistic lower bounds for approximation by shallow perceptron networks
- The weight-decay technique in learning from data: an optimization point of view
- Super-resolution meets machine learning: approximation of measures
- Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty
- Functional optimal estimation problems and their solution by nonlinear approximation schemes
- Approximation and learning by greedy algorithms
- Weighted quadrature formulas and approximation by zonal function networks on the sphere
- Rates of minimization of error functionals over Boolean variable-basis functions
- Rates of approximation by neural networks with four layers
- Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems
- Regularization techniques and suboptimal solutions to optimization problems in learning from data
- Geometric Upper Bounds on Rates of Variable-Basis Approximation
- Value and Policy Function Approximations in Infinite-Horizon Optimization Problems
- A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
- scientific article; zbMATH DE number 1182753 (Why is no real title available?)
- Comparison of worst case errors in linear and neural network approximation
- scientific article; zbMATH DE number 1784858 (Why is no real title available?)
- Can dictionary-based computational models outperform the best linear ones?
- scientific article; zbMATH DE number 1843047 (Why is no real title available?)
- Two-Layer Neural Networks with Values in a Banach Space
- Wavelet neural networks functional approximation and application
- The ridgelet prior: a covariance function approach to prior specification for Bayesian neural networks
- Optimization of approximating networks for optimal fault diagnosis
- Geometric Rates of Approximation by Neural Networks
- Some comparisons of complexity in dictionary-based and linear computational models
- Learning with generalization capability by kernel methods of bounded complexity
- Deep learning: a statistical viewpoint
- Approximating networks and extended Ritz method for the solution of functional optimization problems
- A deep network construction that adapts to intrinsic dimensionality beyond the domain
- Characterization of the variation spaces corresponding to shallow neural networks
- Gradient descent on infinitely wide neural networks: global convergence and generalization
- The ridge function representation of polynomials and an application to neural networks
- Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
- Entropy-based convergence rates of greedy algorithms
- Weighted variation spaces and approximation by shallow ReLU networks
- Compositional function spaces for deep learning
- Enhanced feature learning via regularisation: integrating neural networks and kernel methods
- A duality framework for analyzing random feature and two-layer neural networks
- Deep learning for PDE-based inverse problems. Abstracts from the workshop held October 27 -- November 1, 2024
- Approximation by non-symmetric networks for cross-domain learning
- Approximation error estimates by noise-injected neural networks
- Function-space optimality of neural architectures with multivariate nonlinearities
- Minimax rates for learning spectral Barron functions by deep ReLU neural networks
- Approximative compactness of linear combinations of characteristic functions
- Accuracy of suboptimal solutions to kernel principal component analysis
- Lower estimation of approximation rate for neural networks
- On the tractability of multivariate integration and approximation by neural networks
- Estimates of variation with respect to a set and applications to optimization problems
This page was built for publication: Bounds on rates of variable-basis and neural-network approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544714)
