Learning with generalization capability by kernel methods of bounded complexity

DOI10.1016/J.JCO.2004.11.002zbMATH Open1095.68044OpenAlexW2119028526MaRDI QIDQ558012FDOQ558012

Věra Kůrková, Marcello Sanguineti

Publication date: 30 June 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: http://www.nusl.cz/ntk/nusl-34137

Recommendations

• Learning Bounds for Support Vector Machines with Learned Kernels
• Refined generalization bounds of gradient learning over reproducing kernel Hilbert spaces
• Learning Bounds for Kernel Regression Using Effective Data Dimensionality
• Multiple kernel learning with the generalization error bound of support vector machine
• Error bounds for learning the kernel
• Learnability in Hilbert spaces with reproducing kernels
• A sparsity driven kernel machine based on minimizing a generalization error bound
• scientific article; zbMATH DE number 7646022

zbMATH Keywords

GeneralizationKernel methodsMinimization of regularized empirical errorsModel complexitySupervised learningUpper bounds on rates of approximate optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Sampling theory, sample surveys (62D05) Computational learning theory (68Q32)

Cites Work

• Title not available (Why is that?)
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
• Universal approximation bounds for superpositions of a sigmoidal function
• Comparison of worst case errors in linear and neural network approximation
• Theory of Reproducing Kernels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
• On the mathematical foundations of learning
• Title not available (Why is that?)
• Metric spaces and completely monontone functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well-posed optimization problems
• Error Estimates for Approximate Optimization by the Extended Ritz Method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Some remarks on the condition number of a real random square matrix
• Title not available (Why is that?)
• Perturbations, approximations and sensitivity analysis of optimal control systems
• Title not available (Why is that?)
• On uniformly convex functionals
• An Approach to Time Series Analysis
• The geometry of ill-conditioning
• Title not available (Why is that?)
• Bounds on rates of variable-basis and neural-network approximation
• Title not available (Why is that?)

Cited In (23)

• Power series kernels
• Title not available (Why is that?)
• New insights into Witsenhausen's counterexample
• Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
• Accuracy of suboptimal solutions to kernel principal component analysis
• Estimates of variation with respect to a set and applications to optimization problems
• Learning with Boundary Conditions
• Generalization performance of multi-category kernel machines
• Title not available (Why is that?)
• The weight-decay technique in learning from data: an optimization point of view
• Complexity control in statistical learning
• Title not available (Why is that?)
• Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling
• Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
• On spectral windows in supervised learning from data
• Functional optimal estimation problems and their solution by nonlinear approximation schemes
• A recursive algorithm for nonlinear least-squares problems
• Title not available (Why is that?)
• Regularized vector field learning with sparse approximation for mismatch removal
• Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data
• Radial fuzzy systems
• Rates of minimization of error functionals over Boolean variable-basis functions
• Learning Bounds for Kernel Regression Using Effective Data Dimensionality

This page was built for publication: Learning with generalization capability by kernel methods of bounded complexity

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