Generalization ability of fractional polynomial models

DOI10.1016/J.NEUNET.2013.09.009zbMATH Open1296.68133DBLPjournals/nn/LeiDD14OpenAlexW2007556383WikidataQ50714588 ScholiaQ50714588MaRDI QIDQ461189FDOQ461189

Authors: Yunwen Lei, Lixin Ding, Yiming Ding 

Publication date: 10 October 2014

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2013.09.009

Recommendations

• Bayesian fractional polynomials
• scientific article; zbMATH DE number 1977083
• Fractional polynomial model selection procedures: investigation of type i error rate
• Polynomial spline estimation for generalized partial functional linear regression models
• Approximation and estimation bounds for free knot splines

zbMATH Keywords

model selectionlearning theoryapproximation theorylearning algorithmfractional polynomial

Mathematics Subject Classification ID

Point estimation (62F10) Learning and adaptive systems in artificial intelligence (68T05) Stochastic approximation (62L20)

Cites Work

• The elements of statistical learning. Data mining, inference, and prediction
• Universal approximation bounds for superpositions of a sigmoidal function
• Theory of Reproducing Kernels
• Learning Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence of stochastic processes
• On the mathematical foundations of learning
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
• Title not available (Why is that?)
• A distribution-free theory of nonparametric regression
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Separable nonlinear least squares: the variable projection method and its applications
• Convexity, Classification, and Risk Bounds
• Title not available (Why is that?)
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Practical selection of SVM parameters and noise estimation for SVM regression
• Another look at statistical learning theory and regularization
• Title not available (Why is that?)
• 10.1162/153244302760200713
• Title not available (Why is that?)
• Title not available (Why is that?)
• The covering number in learning theory
• Optimal learning rates for least squares regularized regression with unbounded sampling
• Title not available (Why is that?)
• Model selection and error estimation
• Convergence rates of generalization errors for margin-based classification
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Generalization bounds for function approximation from scattered noisy data
• Analysis of convergence performance of neural networks ranking algorithm
• VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions
• Comparison of Model Selection for Regression

Cited In (2)

• Improving the robustness of fractional polynomial models by preliminary covariate transformation: a pragmatic approach
• Polymorphic Fractional Capabilities

Uses Software

• ElemStatLearn

This page was built for publication: Generalization ability of fractional polynomial models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q461189)