On the public citation graph
On the Degree of Approximation by Manifolds of Finite Pseudo-Dimension
0 signed · 52 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.1006/jcom.1997.0459openalex-snapshot
On the Value of Partial Information for Learning from Examples
inferredcites →https://doi.org/10.1007/0-387-34239-7openalex-snapshot
Estimation of Dependences Based on Empirical Data
inferredcites →https://doi.org/10.1007/3-540-62685-9_6openalex-snapshot
Generalization of the PAC-model for learning with partial information
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1016/0097-3165(95)90052-7openalex-snapshot
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis 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.1070/sm1967v002n03abeh002343openalex-snapshot
PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
inferredcites →https://doi.org/10.1137/1126059openalex-snapshot
Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jath.1998.3304openalex-snapshot
On Best Approximation by Ridge Functions
inferred← citeshttps://doi.org/10.1006/jcom.2001.0579openalex-snapshot
Non-linear Approximations Using Sets of Finite Cardinality or Finite Pseudo-dimension
inferred← citeshttps://doi.org/10.1006/jcss.1998.1604openalex-snapshot
On the Learnability of Rich Function Classes
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_26openalex-snapshot
RBF Neural Networks and Descartes’ Rule of Signs
inferred← citeshttps://doi.org/10.1007/s00025-020-01239-8openalex-snapshot
On Sharpness of Error Bounds for Univariate Approximation by Single Hidden Layer Feedforward Neural Networks
inferred← citeshttps://doi.org/10.1007/s00365-024-09679-zopenalex-snapshot
Optimal Rates of Approximation by Shallow ReLU$$^k$$ Neural Networks and Applications to Nonparametric Regression
inferred← citeshttps://doi.org/10.1007/s00780-013-0204-9openalex-snapshot
Quantitative error estimates for a least-squares Monte Carlo algorithm for American option pricing
inferred← citeshttps://doi.org/10.1007/s10114-005-0921-xopenalex-snapshot
Non-Linear Approximation of Functions with Mixed Smoothness by Sets of Finite Pseudo-Dimension
inferred← citeshttps://doi.org/10.1007/s10444-009-9140-9openalex-snapshot
Optimal adaptive sampling recovery
inferred← citeshttps://doi.org/10.1007/s10915-026-03235-6openalex-snapshot
Approximating Functions with Additive Ridge Features by Deep $$\text {ReLU}^k$$ Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1007/s11006-005-0102-3openalex-snapshot
On the Orders of Nonlinear Approximations for Classes of Functions of Given Form
inferred← citeshttps://doi.org/10.1007/s11587-020-00549-xopenalex-snapshot
On sharpness of error bounds for multivariate neural network approximation
inferred← citeshttps://doi.org/10.1007/s40306-016-0175-yopenalex-snapshot
Adaptive Sampling Recovery of Functions with Bounded Modulus of Smoothness
inferred← citeshttps://doi.org/10.1016/j.acha.2023.03.004openalex-snapshot
Approximation bounds for norm constrained neural networks with applications to regression and GANs
inferred← citeshttps://doi.org/10.1016/j.jco.2016.02.003openalex-snapshot
Linear and nonlinear approximation of spherical radial basis function networks
inferred← citeshttps://doi.org/10.1016/j.jco.2018.09.003openalex-snapshot
Nonparametric regression using needlet kernels for spherical data
inferred← citeshttps://doi.org/10.1016/j.neunet.2022.06.013openalex-snapshot
Approximation in shift-invariant spaces with deep ReLU neural networks
inferred← citeshttps://doi.org/10.1016/s0021-9045(02)00011-4openalex-snapshot
On best approximation of classes by radial functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00015-8openalex-snapshot
The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
inferred← citeshttps://doi.org/10.1023/a:1018993908478openalex-snapshot
On the near optimality of the stochastic approximation of smooth functions by neural networks
inferred← citeshttps://doi.org/10.1070/im2009v073n02abeh002448openalex-snapshot
Widths related to pseudo-dimension
inferred← citeshttps://doi.org/10.1070/im2010v074n01abeh002482openalex-snapshot
Widths of some classes of convex functions and bodies
inferred← citeshttps://doi.org/10.1080/10020070612331343222openalex-snapshot
Antisense expression of a rice cellular apoptosis susceptibility gene (OsCAs) alters the height of transgenic rice
inferred← citeshttps://doi.org/10.1109/18.923738openalex-snapshot
Lower bounds for multivariate approximation by affine-invariant dictionaries
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/tit.2022.3151753openalex-snapshot
Universal Consistency of Deep Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1109/tnnls.2018.2868980openalex-snapshot
Generalization and Expressivity for Deep Nets
inferred← citeshttps://doi.org/10.1109/tnnls.2019.2951788openalex-snapshot
Realizing Data Features by Deep Nets
inferred← citeshttps://doi.org/10.1111/mafi.12125openalex-snapshot
CONVERGENCE OF A LEAST‐SQUARES MONTE CARLO ALGORITHM FOR AMERICAN OPTION PRICING WITH DEPENDENT SAMPLE DATA
inferred← citeshttps://doi.org/10.1142/s0219530519400074openalex-snapshot
Deep neural networks for rotation-invariance approximation and learning
inferred← citeshttps://doi.org/10.1142/s0219530523500227openalex-snapshot
Nonlinear approximation of functions by sets of finite pseudo-dimension in the probabilistic and average case settings
inferred← citeshttps://doi.org/10.1162/089976602760805386openalex-snapshot
Descartes' Rule of Signs for Radial Basis Function Neural Networks
inferred← citeshttps://doi.org/10.1216/rmjm/1181069739openalex-snapshot
Approximation of Sobolev-Type Classes with Quasi-Seminorms
inferred← citeshttps://doi.org/10.21538/0134-4889-2017-23-3-3-21openalex-snapshot
Оценки наилучших приближений функций класса логарифмической гладкости в пространстве Лоренца
inferred← citeshttps://doi.org/10.3934/math.20221045openalex-snapshot
On the uniform approximation estimation of deep ReLU networks via frequency decomposition
inferred← citeshttps://doi.org/10.4153/cmb-2008-025-6openalex-snapshot
Kolmogorov, Linear and Pseudo-Dimensional Widths of Classes of s-Monotone Functions in 𝕃p, 0 < p < 1
inferred← citeshttps://doi.org/10.4213/im2648openalex-snapshot
Поперечники, связанные с псевдоразмерностью
inferred← citeshttps://doi.org/10.4213/im2757openalex-snapshot
Поперечники некоторых классов выпуклых функций и тел
inferred← citeshttps://doi.org/10.4213/mzm2565openalex-snapshot
О порядках нелинейных приближений классов функций заданной формы
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3540openalex-snapshot
Adaptive algorithms in sampling recovery
inferred← citeshttps://doi.org/10.48550/arxiv.1811.05199openalex-snapshot
On Sharpness of Error Bounds for Single Hidden Layer Feedforward Neural Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1911.10558openalex-snapshot
Fast Polynomial Kernel Classification for Massive Data
inferred← citeshttps://doi.org/10.5705/ss.202014.0068openalex-snapshot
Prediction-based Termination Rule for Greedy Learning with Massive Data
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.