Measuring the capacity of sets of functions in the analysis of ERM

DOI10.1007/978-3-319-21852-6_16MaRDI QIDQ2805728zbMATHOpenAlexFDO

Authors Ingo Steinwart

Publication date 13 May 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-21852-6_16

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Risk bounds for statistical learning
• ERM learning with unbounded sampling
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• ERM learning algorithm for multi-class classification
• Empirical minimization

Cites work

• scientific article; zbMATH DE number 44592 (Why is no real title available?)
• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• scientific article; zbMATH DE number 51427 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• scientific article; zbMATH DE number 962825 (Why is no real title available?)
• A Bennett concentration inequality and its application to suprema of empirical processes
• A distribution-free theory of nonparametric regression
• Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size
• Classification with a reject option using a hinge loss
• Combinatorial methods in density estimation
• Consistency of support vector machines for forecasting the evolution of an unknown ergodic dynamical system from observations with unknown noise
• Consistent nonparametric regression. Discussion
• Convergence of stochastic processes
• Convexity, Classification, and Risk Bounds
• Deviation inequalities for sums of weakly dependent time series
• Entropy and the combinatorial dimension
• Estimating conditional quantiles with the help of the pinball loss
• Exponential inequalities and estimation of conditional probabilities
• Fast learning from \(\alpha\)-mixing observations
• Fast rates for support vector machines using Gaussian kernels
• Gelfand numbers of operators with values in a Hilbert space
• Improving the sample complexity using global data
• Learning from dependent observations
• Minimum complexity regression estimation with weakly dependent observations
• Neural Network Learning
• New concentration inequalities in product spaces
• New dependence coefficients. Examples and applications to statistics
• Optimal aggregation of classifiers in statistical learning.
• Optimal concentration inequalities for dynamical systems
• Oracle inequalities for support vector machines that are based on random entropy numbers
• Rates of convergence for empirical processes of stationary mixing sequences
• Scale-sensitive dimensions, uniform convergence, and learnability
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Statistical performance of support vector machines
• Support Vector Machines
• The generalization performance of ERM algorithm with strongly mixing observations
• The performance bounds of learning machines based on exponentially strongly mixing sequences
• Theory of Classification: a Survey of Some Recent Advances
• Uniform Central Limit Theorems
• Uniform convergence of Vapnik-Chervonenkis classes under ergodic sampling
• Weak convergence and empirical processes. With applications to statistics

This page was built for publication: Measuring the capacity of sets of functions in the analysis of ERM

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