On the public citation graph
Approximation and Learning of Convex Superpositions
0 signed · 53 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/0-387-34239-7openalex-snapshot
Estimation of Dependences Based on Empirical Data
inferredcites →https://doi.org/10.1007/978-1-4419-5821-1_19openalex-snapshot
Universal Donsker Classes and Metric Entropy
inferredcites →https://doi.org/10.1007/978-1-4612-5254-2openalex-snapshot
Convergence of Stochastic Processes
inferredcites →https://doi.org/10.1007/978-1-4684-0559-0openalex-snapshot
Probability in Banach Spaces 7
inferredcites →https://doi.org/10.1007/bf01303517openalex-snapshot
Discrepancy and approximations for bounded VC-dimension
inferredcites →https://doi.org/10.1016/0890-5401(92)90010-dopenalex-snapshot
Decision theoretic generalizations of the PAC model for neural net and other learning applications
inferredcites →https://doi.org/10.1016/s0022-0000(05)80062-5openalex-snapshot
Efficient distribution-free learning of probabilistic concepts
inferredcites →https://doi.org/10.1109/18.256500openalex-snapshot
Universal approximation bounds for superpositions of a sigmoidal function
inferredcites →https://doi.org/10.1109/sfcs.1993.366858openalex-snapshot
Scale-sensitive dimensions, uniform convergence, and learnability
inferredcites →https://doi.org/10.1112/jlms/s2-45.2.377openalex-snapshot
Vapnik-Chervonenkis Classes of Definable Sets
inferredcites →https://doi.org/10.1145/180139.181158openalex-snapshot
Fat-shattering and the learnability of real-valued functions
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1162/neco.1989.1.1.151openalex-snapshot
What Size Net Gives Valid Generalization?
inferredcites →https://doi.org/10.1214/aop/1176991978openalex-snapshot
Universal Donsker Classes and Metric Entropy
inferredcites →https://doi.org/10.1214/aop/1176995384openalex-snapshot
Central Limit Theorems for Empirical Measures
inferredcites →https://doi.org/10.1214/aos/1176350374openalex-snapshot
$U$-Processes: Rates of Convergence
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-4471-0123-9_2openalex-snapshot
Universality and Complexity of Approximation of Multivariable Functions by Feedforward Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-29693-3_2openalex-snapshot
From Functional Optimization to Nonlinear Programming by the Extended Ritz Method
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-642-04921-7_2openalex-snapshot
On Tractability of Neural-Network Approximation
inferred← citeshttps://doi.org/10.1007/978-3-642-21735-7_16openalex-snapshot
Bounds for Approximate Solutions of Fredholm Integral Equations Using Kernel Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-23229-9_7openalex-snapshot
Model Complexity of Neural Networks in High-Dimensional Approximation
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-6230-9_7openalex-snapshot
Tightness of Upper Bounds on Rates of Neural-Network Approximation
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.1016/j.amc.2012.01.015openalex-snapshot
Accuracy of approximations of solutions to Fredholm equations by kernel methods
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.007openalex-snapshot
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
inferred← citeshttps://doi.org/10.1016/j.jat.2006.12.009openalex-snapshot
A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
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.2023.101746openalex-snapshot
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality
inferred← citeshttps://doi.org/10.1016/j.neunet.2012.05.002openalex-snapshot
Complexity estimates based on integral transforms induced by computational units
inferred← citeshttps://doi.org/10.1016/s0021-9045(03)00072-8openalex-snapshot
Best approximation by linear combinations of characteristic functions of half-spaces
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00134-1openalex-snapshot
A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces
inferred← citeshttps://doi.org/10.1016/s0893-6080(00)00056-3openalex-snapshot
Best approximation by Heaviside perceptron networks
inferred← citeshttps://doi.org/10.1016/s0925-2312(99)00111-3openalex-snapshot
Approximation by neural networks is not continuous
inferred← citeshttps://doi.org/10.1109/18.661502openalex-snapshot
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
inferred← citeshttps://doi.org/10.1109/18.705570openalex-snapshot
Structural risk minimization over data-dependent hierarchies
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/18.971754openalex-snapshot
Comparison of worst case errors in linear and neural network approximation
inferred← citeshttps://doi.org/10.1109/69.917560openalex-snapshot
Generalization ability of folding networks
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383274openalex-snapshot
A Constructive Approach to Function Realization by Neural Stochastic Differential Equations
inferred← citeshttps://doi.org/10.1109/ijcnn.2000.857848openalex-snapshot
Comparison of rates of linear and neural network approximation
inferred← citeshttps://doi.org/10.1109/ijcnn.2000.857852openalex-snapshot
Convex geometry and nonlinear approximation
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/tnnls.2021.3049719openalex-snapshot
Efficient Approximation of High-Dimensional Functions With Neural Networks
inferred← citeshttps://doi.org/10.1137/s1052623402401233openalex-snapshot
Minimization of Error Functionals over Variable-Basis Functions
inferred← citeshttps://doi.org/10.1162/neco.2009.04-08-745openalex-snapshot
An Integral Upper Bound for Neural Network Approximation
inferred← citeshttps://doi.org/10.7551/mitpress/1113.001.0001openalex-snapshot
Advances in Large-Margin Classifiers
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.