On the public citation graph
A note on error bounds for approximation in inner product spaces
0 signed · 19 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-79119-2_8openalex-snapshot
Regularization Theory, Radial Basis Functions and Networks
inferredcites →https://doi.org/10.1007/bf02551274openalex-snapshot
Approximation by superpositions of a sigmoidal function
inferredcites →https://doi.org/10.1109/18.256500openalex-snapshot
Universal approximation bounds for superpositions of a sigmoidal function
inferredcites →https://doi.org/10.1109/81.296334openalex-snapshot
General structures for classification
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-2018-3_9openalex-snapshot
Constructive Function Approximation: Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-1-4615-5725-8_14openalex-snapshot
Constructive Function Approximation
inferred← citeshttps://doi.org/10.1007/bf01201501openalex-snapshot
A note on error bounds for function approximation using nonlinear networks
inferred← citeshttps://doi.org/10.1007/s00607-004-0081-3openalex-snapshot
Regularized Greedy Algorithms for Network Training with Data Noise
inferred← citeshttps://doi.org/10.1016/j.jat.2006.03.016openalex-snapshot
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
inferred← citeshttps://doi.org/10.1016/j.jat.2008.11.003openalex-snapshot
Learning a function from noisy samples at a finite sparse set of points
inferred← citeshttps://doi.org/10.1109/18.945285openalex-snapshot
Bounds on rates of variable-basis and neural-network approximation
inferred← citeshttps://doi.org/10.1109/72.728357openalex-snapshot
Efficient algorithms for function approximation with piecewise linear sigmoidal networks
inferred← citeshttps://doi.org/10.1109/72.839004openalex-snapshot
On the optimality of neural-network approximation using incremental algorithms
inferred← citeshttps://doi.org/10.1109/9.802912openalex-snapshot
The unreasonable effectiveness of neural network approximation
inferred← citeshttps://doi.org/10.1109/cdc.1997.652472openalex-snapshot
Fast converging algorithms for neural network approximation
inferred← citeshttps://doi.org/10.1109/icsmc.1997.638160openalex-snapshot
The unreasonable effectiveness of neural network approximation
inferred← citeshttps://doi.org/10.1109/mwscas.1997.662307openalex-snapshot
A note on error bounds for function approximation using nonlinear networks
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93955openalex-snapshot
Learning with Feed-forward Neural Networks: Three Schemes to Deal with the Bias/Variance Trade-off
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.