Measuring the Capacity of Sets of Functions in the Analysis of ERM
type: Item
instance of: scholarly article
title: Measuring the Capacity of Sets of Functions in the Analysis of ERM
zbMATH Open document ID: 1336.68223
DOI: 10.1007/978-3-319-21852-6_16
author: Ingo Steinwart
published in: Measures of Complexity
publication date: 2016-05-13T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6580095
MaRDI profile type: Publication
full work available at URL: 978-3-319-21852-6 16
OpenAlex ID: W2289593790
cites work: Uniform convergence of Vapnik-Chervonenkis classes under ergodic sampling
cites work: Scale-sensitive dimensions, uniform convergence, and learnability
cites work: Neural Network Learning
cites work: Q3096172
cites work: Convexity, Classification, and Risk Bounds
cites work: Statistical performance of support vector machines
cites work: Theory of Classification: a Survey of Some Recent Advances
cites work: A Bennett concentration inequality and its application to suprema of empirical processes
cites work: Gelfand numbers of operators with values in a Hilbert space
cites work: Q3995208
cites work: Optimal concentration inequalities for dynamical systems
cites work: New dependence coefficients. Examples and applications to statistics
cites work: Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size
cites work: Combinatorial methods in density estimation
cites work: Q4881152
cites work: Uniform Central Limit Theorems
cites work: Q5690839
cites work: A distribution-free theory of nonparametric regression
cites work: Fast learning from \(\alpha\)-mixing observations
cites work: Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
cites work: Q3997990
cites work: Exponential inequalities and estimation of conditional probabilities
cites work: Improving the sample complexity using global data
cites work: Entropy and the combinatorial dimension
cites work: Minimum complexity regression estimation with weakly dependent observations
cites work: Convergence of stochastic processes
cites work: Q4001821
cites work: Oracle inequalities for support vector machines that are based on random entropy numbers
cites work: Consistency of support vector machines for forecasting the evolution of an unknown ergodic dynamical system from observations with unknown noise
cites work: Support Vector Machines
cites work: Estimating conditional quantiles with the help of the pinball loss
cites work: Fast rates for support vector machines using Gaussian kernels
cites work: Learning from dependent observations
cites work: Consistent nonparametric regression. Discussion
cites work: New concentration inequalities in product spaces
cites work: Optimal aggregation of classifiers in statistical learning.
cites work: Weak convergence and empirical processes. With applications to statistics
cites work: Q4261789
cites work: Deviation inequalities for sums of weakly dependent time series
cites work: Rates of convergence for empirical processes of stationary mixing sequences
cites work: The performance bounds of learning machines based on exponentially strongly mixing sequences
cites work: The generalization performance of ERM algorithm with strongly mixing observations
description: scientific article