On the public citation graph

Minimax nonparametric classification. II. Model selection for adaptation

0 signed · 37 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.1007/978-1-4612-0711-5openalex-snapshot
A Probabilistic Theory of Pattern Recognition
inferredcites →https://doi.org/10.1007/978-1-4612-1694-0_15openalex-snapshot
Information Theory and an Extension of the Maximum Likelihood Principle
inferredcites →https://doi.org/10.1007/978-1-4612-1880-7_4openalex-snapshot
From Model Selection to Adaptive Estimation
inferredcites →https://doi.org/10.1007/978-1-4612-6333-3openalex-snapshot
A Practical Guide to Splines
inferredcites →https://doi.org/10.1007/978-94-011-3222-0_42openalex-snapshot
Complexity Regularization with Application to Artificial Neural Networks
inferredcites →https://doi.org/10.1007/bf00993164openalex-snapshot
Approximation and estimation bounds for artificial neural networks
inferredcites →https://doi.org/10.1007/s004400050210openalex-snapshot
Risk bounds for model selection via penalization
inferredcites →https://doi.org/10.1016/0021-9045(73)90029-4openalex-snapshot
Spline approximation by quasiinterpolants
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.382014openalex-snapshot
Nonparametric estimation via empirical risk minimization
inferredcites →https://doi.org/10.1109/18.481777openalex-snapshot
Concept learning using complexity regularization
inferredcites →https://doi.org/10.1109/18.650993openalex-snapshot
An asymptotic property of model selection criteria
inferredcites →https://doi.org/10.1109/18.796368openalex-snapshot
Minimax nonparametric classification .I. Rates of convergence
inferredcites →https://doi.org/10.1109/18.86996openalex-snapshot
Minimum complexity density estimation
inferredcites →https://doi.org/10.1109/34.3915openalex-snapshot
Automatic pattern recognition: a study of the probability of error
inferredcites →https://doi.org/10.1109/72.661120openalex-snapshot
Radial basis function networks and complexity regularization in function learning
inferredcites →https://doi.org/10.1214/aos/1017939142openalex-snapshot
Information-theoretic determination of minimax rates of convergence
inferredcites →https://doi.org/10.1214/aos/1017939241openalex-snapshot
Adaptive model selection using empirical complexities
inferredcites →https://doi.org/10.1214/aos/1176325361openalex-snapshot
The Use of Polynomial Splines and Their Tensor Products in Multivariate Function Estimation
inferredcites →https://doi.org/10.2139/ssrn.139688openalex-snapshot
Adaptive Model Selection Using Empirical Complexities
inferredcites →https://doi.org/10.2307/2007301openalex-snapshot
Spline Functions: Basic Theory.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11503415_19openalex-snapshot
Fast Rates for Support Vector Machines
inferred← citeshttps://doi.org/10.1007/s10114-005-0880-2openalex-snapshot
Minimax Optimal Rates of Convergence for Multicategory Classifications
inferred← citeshttps://doi.org/10.1016/s0165-1684(02)00302-xopenalex-snapshot
Multidimensional signal compression using multiscale recurrent patterns
inferred← citeshttps://doi.org/10.1051/ps:2005018openalex-snapshot
Theory of Classification: a Survey of Some Recent Advances
inferred← citeshttps://doi.org/10.1109/18.796368openalex-snapshot
Minimax nonparametric classification .I. Rates of convergence
inferred← citeshttps://doi.org/10.1162/1532443041424319openalex-snapshot
10.1162/1532443041424319
inferred← citeshttps://doi.org/10.1186/1687-4153-2012-18openalex-snapshot
Optimal reference sequence selection for genome assembly using minimum description length principle
inferred← citeshttps://doi.org/10.1214/009053604000000959openalex-snapshot
Bandwidth choice for nonparametric classification
inferred← citeshttps://doi.org/10.1214/009053606000001226openalex-snapshot
Fast rates for support vector machines using Gaussian kernels
inferred← citeshttps://doi.org/10.1214/07-ejs015openalex-snapshot
Classification with minimax fast rates for classes of Bayes rules with sparse representation
inferred← citeshttps://doi.org/10.1214/19-aos1881openalex-snapshot
Asymptotic frequentist coverage properties of Bayesian credible sets for sieve priors
inferred← citeshttps://doi.org/10.3150/07-bej6044openalex-snapshot
Optimal rates of aggregation in classification under low noise assumption
inferred← citeshttps://doi.org/10.3150/15-bej709openalex-snapshot
Optimal classification and nonparametric regression for functional data
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02143openalex-snapshot
Model selection of polynomial kernel regression
inferred← citeshttps://doi.org/10.48550/arxiv.math/0507180openalex-snapshot
Fast learning rates for plug-in classifiers under the margin condition
inferred← citeshttps://doi.org/10.5555/945365.964298openalex-snapshot
On the rate of convergence of regularized boosting 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.