On the public citation graph

Bounds on rates of variable-basis and neural-network approximation

0 signed · 118 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jath.1996.0031openalex-snapshot
Random Approximants and Neural Networks
inferredcites →https://doi.org/10.1006/jath.1997.3217openalex-snapshot
Uniform Approximation by Neural Networks
inferredcites →https://doi.org/10.1006/jcss.1997.1506openalex-snapshot
Approximation and Learning of Convex Superpositions
inferredcites →https://doi.org/10.1007/978-1-4612-1996-5_16openalex-snapshot
Dimension-Independent Rates of Approximation by Neural Networks
inferredcites →https://doi.org/10.1007/978-1-4612-2018-3_9openalex-snapshot
Constructive Function Approximation: Theory and Practice
inferredcites →https://doi.org/10.1007/978-3-662-41583-2openalex-snapshot
Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces
inferredcites →https://doi.org/10.1007/978-3-7091-6230-9_7openalex-snapshot
Tightness of Upper Bounds on Rates of Neural-Network Approximation
inferredcites →https://doi.org/10.1007/bf01183158openalex-snapshot
A note on error bounds for approximation in inner product spaces
inferredcites →https://doi.org/10.1007/bf01910941openalex-snapshot
Approximation of functions of several variables by trigonometric polynomials with given number of harmonics, and estimates of ε-entropy
inferredcites →https://doi.org/10.1007/bfb0078887openalex-snapshot
Direct and converse theorems for spline and rational approximation and besov spaces
inferredcites →https://doi.org/10.1007/bfb0087405openalex-snapshot
A constructive theory for approximation by splines with an arbitrary sequence of knot sets
inferredcites →https://doi.org/10.1007/s00041-001-4021-8openalex-snapshot
Nonlinear Approximation by Trigonometric Sums
inferredcites →https://doi.org/10.1016/s0893-6080(98)00039-2openalex-snapshot
Representations and rates of approximation of real-valued Boolean functions by neural networks
inferredcites →https://doi.org/10.1023/a:1013662124879openalex-snapshot
Approximating Networks and Extended Ritz Method for the Solution of Functional Optimization Problems
inferredcites →https://doi.org/10.1109/18.256500openalex-snapshot
Universal approximation bounds for superpositions of a sigmoidal function
inferredcites →https://doi.org/10.1109/18.971754openalex-snapshot
Comparison of worst case errors in linear and neural network approximation
inferredcites →https://doi.org/10.1109/72.728390openalex-snapshot
Neural approximations for infinite-horizon optimal control of nonlinear stochastic systems
inferredcites →https://doi.org/10.1109/9.802912openalex-snapshot
The unreasonable effectiveness of neural network approximation
inferredcites →https://doi.org/10.1109/tac.2001.911437openalex-snapshot
Comments on "The unreasonable effectiveness of neural network approximation
inferredcites →https://doi.org/10.1109/tac.2001.911438openalex-snapshot
Author's reply: comments on "the unreasonable effectiveness of neural network approximation"
inferredcites →https://doi.org/10.1145/168304.168357openalex-snapshot
Rate of approximation results motivated by robust neural network learning
inferredcites →https://doi.org/10.1147/rd.383.0277openalex-snapshot
Dimension-independent bounds on the degree of approximation by neural networks
inferredcites →https://doi.org/10.1162/neco.1995.7.2.219openalex-snapshot
Regularization Theory and Neural Networks Architectures
inferredcites →https://doi.org/10.1214/aos/1176348546openalex-snapshot
A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training
inferredcites →https://doi.org/10.1515/9781400827268.784openalex-snapshot
Compression of wavelet decompositions
inferredcites →https://doi.org/10.2307/2316932openalex-snapshot
Introductory Real Analysis.
inferredcites →https://doi.org/10.2307/2374796openalex-snapshot
Compression of Wavelet Decompositions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/2013wr014700openalex-snapshot
Many‐objective reservoir policy identification and refinement to reduce policy inertia and myopia in water management
inferred← citeshttps://doi.org/10.1002/acs.746openalex-snapshot
Bounds on the complexity of neural‐network models and comparison with linear methods
inferred← citeshttps://doi.org/10.1002/mma.10288openalex-snapshot
Approximation error estimates by noise‐injected neural networks
inferred← citeshttps://doi.org/10.1007/3-540-44668-0_40openalex-snapshot
Tight Bounds on Rates of Neural-Network Approximation
inferred← citeshttps://doi.org/10.1007/978-1-4471-0123-9_2openalex-snapshot
Universality and Complexity of Approximation of Multivariable Functions by Feedforward Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0241-4_2openalex-snapshot
The Extended Ritz Method in Stochastic Functional Optimization: An example of Dynamic Routing in Traffic Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-29693-3_1openalex-snapshot
The Basic Infinite-Dimensional or Functional Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-29693-3_3openalex-snapshot
Some Families of FSP Functions and Their Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-03206-1_7openalex-snapshot
Accuracy of Surrogate Solutions of Integral Equations by Feedforward Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_47openalex-snapshot
Geometric Rates of Approximation by Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04003-0_6openalex-snapshot
Regularization and Suboptimal Solutions in Learning from Data
inferred← citeshttps://doi.org/10.1007/978-3-642-36657-4_5openalex-snapshot
Approximating Multivariable Functions by Feedforward Neural Nets
inferred← citeshttps://doi.org/10.1007/978-3-7091-0646-4_11openalex-snapshot
Neural network learning as approximate optimization
inferred← citeshttps://doi.org/10.1007/978-3-7091-6230-9_7openalex-snapshot
Tightness of Upper Bounds on Rates of Neural-Network Approximation
inferred← citeshttps://doi.org/10.1007/s00041-019-09693-xopenalex-snapshot
Super-Resolution Meets Machine Learning: Approximation of Measures
inferred← citeshttps://doi.org/10.1007/s00365-021-09549-yopenalex-snapshot
The Barron Space and the Flow-Induced Function Spaces for Neural Network Models
inferred← citeshttps://doi.org/10.1007/s00365-023-09626-4openalex-snapshot
Characterization of the Variation Spaces Corresponding to Shallow Neural Networks
inferred← citeshttps://doi.org/10.1007/s10114-011-9407-1openalex-snapshot
The ridge function representation of polynomials and an application to neural networks
inferred← citeshttps://doi.org/10.1007/s10208-022-09595-3openalex-snapshot
Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
inferred← citeshttps://doi.org/10.1007/s10287-008-0072-5openalex-snapshot
The weight-decay technique in learning from data: an optimization point of view
inferred← citeshttps://doi.org/10.1007/s10589-007-9108-yopenalex-snapshot
Accuracy of suboptimal solutions to kernel principal component analysis
inferred← citeshttps://doi.org/10.1007/s10589-013-9614-zopenalex-snapshot
Approximate dynamic programming for stochastic N-stage optimization with application to optimal consumption under uncertainty
inferred← citeshttps://doi.org/10.1007/s10852-005-1625-zopenalex-snapshot
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions
inferred← citeshttps://doi.org/10.1007/s10957-007-9229-6openalex-snapshot
Functional Optimal Estimation Problems and Their Solution by Nonlinear Approximation Schemes
inferred← citeshttps://doi.org/10.1007/s10957-008-9471-6openalex-snapshot
Approximation Schemes for Functional Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-009-9620-6openalex-snapshot
Estimates of Variation with Respect to a Set and Applications to Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11063-022-10956-wopenalex-snapshot
Batch Gradient Training Method with Smoothing Group $$L_0$$ Regularization for Feedfoward Neural Networks
inferred← citeshttps://doi.org/10.1007/s11432-009-0027-7openalex-snapshot
Lower estimation of approximation rate for neural networks
inferred← citeshttps://doi.org/10.1007/s40687-022-00346-yopenalex-snapshot
Uniform approximation rates and metric entropy of shallow neural networks
inferred← citeshttps://doi.org/10.1016/b978-008044967-8/50006-3openalex-snapshot
Water reservoirs management under uncertainty by approximating networks and learning from data
inferred← citeshttps://doi.org/10.1016/j.acha.2021.12.005openalex-snapshot
High-order approximation rates for shallow neural networks with cosine and ReLU activation functions
inferred← citeshttps://doi.org/10.1016/j.acha.2024.101713openalex-snapshot
Weighted variation spaces and approximation by shallow ReLU networks
inferred← citeshttps://doi.org/10.1016/j.jat.2020.105435openalex-snapshot
Approximative compactness of linear combinations of characteristic functions
inferred← citeshttps://doi.org/10.1016/j.jco.2003.11.004openalex-snapshot
On the tractability of multivariate integration and approximation by neural networks
inferred← citeshttps://doi.org/10.1016/j.jco.2004.11.002openalex-snapshot
Learning with generalization capability by kernel methods of bounded complexity
inferred← citeshttps://doi.org/10.1016/j.jco.2005.10.003openalex-snapshot
Weighted quadrature formulas and approximation by zonal function networks on the sphere
inferred← citeshttps://doi.org/10.1016/j.neunet.2004.04.001openalex-snapshot
When is approximation by Gaussian networks necessarily a linear process?
inferred← citeshttps://doi.org/10.1016/j.neunet.2010.10.002openalex-snapshot
Some comparisons of complexity in dictionary-based and linear computational models
inferred← citeshttps://doi.org/10.1016/j.neunet.2011.05.014openalex-snapshot
Can dictionary-based computational models outperform the best linear ones?
inferred← citeshttps://doi.org/10.1016/j.neunet.2017.04.003openalex-snapshot
Probabilistic lower bounds for approximation by shallow perceptron networks
inferred← citeshttps://doi.org/10.1016/j.neunet.2019.11.006openalex-snapshot
Dimension independent bounds for general shallow networks
inferred← citeshttps://doi.org/10.1016/j.neunet.2020.08.018openalex-snapshot
A direct approach for function approximation on data defined manifolds
inferred← citeshttps://doi.org/10.1016/j.neunet.2021.06.004openalex-snapshot
A deep network construction that adapts to intrinsic dimensionality beyond the domain
inferred← citeshttps://doi.org/10.1016/j.neunet.2025.107282openalex-snapshot
Approximation by non-symmetric networks for cross-domain learning
inferred← citeshttps://doi.org/10.1016/j.neunet.2026.108841openalex-snapshot
An approximation theory perspective on machine learning
inferred← citeshttps://doi.org/10.1016/s0166-3615(03)00131-3openalex-snapshot
Fault diagnosis for nonlinear systems using a bank of neural estimators
inferred← citeshttps://doi.org/10.1017/s0962492921000027openalex-snapshot
Deep learning: a statistical viewpoint
inferred← citeshttps://doi.org/10.1023/a:1013662124879openalex-snapshot
Approximating Networks and Extended Ritz Method for the Solution of Functional Optimization Problems
inferred← citeshttps://doi.org/10.1080/02331930902863665openalex-snapshot
Optimization based on quasi-Monte Carlo sampling to design state estimators for non-linear systems
inferred← citeshttps://doi.org/10.1080/10556780512331318245openalex-snapshot
Optimization of approximating networks for optimal fault diagnosis
inferred← citeshttps://doi.org/10.1080/10556780802328900openalex-snapshot
The extended Ritz method for functional optimization: overview and applications to single-person and team optimal decision problems
inferred← citeshttps://doi.org/10.1080/1726037x.2008.10698552openalex-snapshot
Value and Policy Function Approximations in Infinite-Horizon Optimization Problems
inferred← citeshttps://doi.org/10.1109/18.971754openalex-snapshot
Comparison of worst case errors in linear and neural network approximation
inferred← citeshttps://doi.org/10.1109/72.991413openalex-snapshot
Optimization-based learning with bounded error for feedforward neural networks
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184775openalex-snapshot
Optimized feedforward neural networks for on-line identification of nonlinear models
inferred← citeshttps://doi.org/10.1109/cdc.2006.377136openalex-snapshot
Design of Parameterized State Observers and Controllers for a Class of Nonlinear Continuous-Time Systems
inferred← citeshttps://doi.org/10.1109/msp.2023.3286988openalex-snapshot
Deep Learning Meets Sparse Regularization: A signal processing perspective
inferred← citeshttps://doi.org/10.1109/tit.2008.2006383openalex-snapshot
Geometric Upper Bounds on Rates of Variable-Basis Approximation
inferred← citeshttps://doi.org/10.1109/tit.2010.2090198openalex-snapshot
On a Variational Norm Tailored to Variable-Basis Approximation Schemes
inferred← citeshttps://doi.org/10.1109/tit.2011.2169531openalex-snapshot
Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
inferred← citeshttps://doi.org/10.1109/tit.2022.3147984openalex-snapshot
Optimal Convergence Rates for the Orthogonal Greedy Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2022.3208653openalex-snapshot
Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks
inferred← citeshttps://doi.org/10.1109/tit.2025.3564227openalex-snapshot
Sharp Convergence Rates for Matching Pursuit
inferred← citeshttps://doi.org/10.1109/tnn.2006.883015openalex-snapshot
Design of Asymptotic Estimators: An Approach Based on Neural Networks and Nonlinear Programming
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2888517openalex-snapshot
Classification by Sparse Neural Networks
inferred← citeshttps://doi.org/10.1137/21m1458144openalex-snapshot
Two-Layer Neural Networks with Values in a Banach Space
inferred← citeshttps://doi.org/10.1137/23m1620971openalex-snapshot
Function-Space Optimality of Neural Architectures with Multivariate Nonlinearities
inferred← citeshttps://doi.org/10.1137/24m1686693openalex-snapshot
Approximation Rates for Shallow ReLU\(^k\) Neural Networks on Sobolev Spaces via the Radon Transform
inferred← citeshttps://doi.org/10.1137/25m1802948openalex-snapshot
Compositional Function Spaces for Deep Learning
inferred← citeshttps://doi.org/10.1137/s1052623402401233openalex-snapshot
Minimization of Error Functionals over Variable-Basis Functions
inferred← citeshttps://doi.org/10.1137/s1052623403426507openalex-snapshot
Error Estimates for Approximate Optimization by the Extended Ritz Method
inferred← citeshttps://doi.org/10.1142/9789812562531_0002openalex-snapshot
MAPPINGS BETWEEN HIGH-DIMENSIONAL REPRESENTATIONS IN CONNECTIONISTIC SYSTEMS
inferred← citeshttps://doi.org/10.1142/s0218202524500143openalex-snapshot
Entropy-based convergence rates of greedy algorithms
inferred← citeshttps://doi.org/10.1142/s0219530524400013openalex-snapshot
Tractability of approximation by general shallow networks
inferred← citeshttps://doi.org/10.1142/s0219691321500600openalex-snapshot
Wavelet neural networks functional approximation and application
inferred← citeshttps://doi.org/10.1162/neco.2009.05-08-786openalex-snapshot
Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data
inferred← citeshttps://doi.org/10.1214/009053607000000631openalex-snapshot
Approximation and learning by greedy algorithms
inferred← citeshttps://doi.org/10.1214/25-aos2492openalex-snapshot
A duality framework for analyzing random feature and two-layer neural networks
inferred← citeshttps://doi.org/10.12988/imf.2007.07056openalex-snapshot
Input-output stability for optimal estimation problems
inferred← citeshttps://doi.org/10.1360/zf2009-39-8-809openalex-snapshot
神经网络逼近速度下界估计
inferred← citeshttps://doi.org/10.23919/acc.2004.1383829openalex-snapshot
Design of observers for continuous-time nonlinear systems using neural networks
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.01962openalex-snapshot
Universal approximators for direct policy search in multi-purpose water reservoir management: A comparative analysis
inferred← citeshttps://doi.org/10.3389/fams.2018.00012openalex-snapshot
Deep Nets for Local Manifold Learning
inferred← citeshttps://doi.org/10.3390/math10132207openalex-snapshot
Approximate Methods for Solving Problems of Mathematical Physics on Neural Hopfield Networks
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2012.00786openalex-snapshot
Approximation of Function Defined on Full Axis of Real by a Class of Neural Networks: Density, Complexity and Constructive Algorithm
inferred← citeshttps://doi.org/10.4171/icm2022/121openalex-snapshot
Gradient descent on infinitely wide neural networks: global convergence and generalization
inferred← citeshttps://doi.org/10.4171/owr/2024/48openalex-snapshot
Deep Learning for PDE-based Inverse Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1412.8690openalex-snapshot
Breaking the Curse of Dimensionality with Convex Neural Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2002.02208openalex-snapshot
Global Convergence of Frank Wolfe on One Hidden Layer Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2106.14997openalex-snapshot
Sharp Lower Bounds on the Approximation Rate of Shallow Neural Networks
inferred← citeshttps://doi.org/10.70675/4e709ad5z7ef2z4bd9za506zb21ef44109a3openalex-snapshot
A dynamical analysis of infinitely wide neural networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.