Computable Shell Decomposition Bounds
نویسندگان
چکیده
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves such as phase transitions. Here we use a variant of their ideas to derive an upper bound on the generalization error of a hypothesis computable from its training error and the histogram of training errors for the hypotheses in the class. In most cases this new bound is significantly tighter than traditional bounds computed from the training error and the cardinality of the class. Our results can also be viewed as providing a rigorous foundation for a model selection algorithm proposed by Scheffer and Joachims.
منابع مشابه
Computable backward error bounds for basic algorithms in linear algebra
Standard error estimates in numerical linear algebra are often of the form γk|R||S| where R,S are known matrices and γk := ku/(1−u) with u denoting the relative rounding error unit. Recently we showed that for a number of standard problems γk can be replaced by ku for any order of computation and without restriction on the dimension. Such problems include LUand Cholesky decomposition, triangula...
متن کاملCoefficient Bounds for Analytic bi-Bazileviv{c} Functions Related to Shell-like Curves Connected with Fibonacci Numbers
In this paper, we define and investigate a new class of bi-Bazilevic functions related to shell-like curves connected with Fibonacci numbers. Furthermore, we find estimates of first two coefficients of functions belonging to this class. Also, we give the Fekete-Szegoinequality for this function class.
متن کاملEla on Condition Numbers for the Canonical Generalized Polar Decomposition of Real Matrices
Three different kinds of condition numbers: normwise, mixed and componentwise, are discussed for the canonical generalized polar decomposition (CGPD) of real matrices. The technique used herein is different from the ones in previous literatures of the polar decomposition. With some modifications of the definition of the componentwise condition number, its application scope is extended. Explicit...
متن کاملMetastability and Dominant Eigenvalues of Transfer Operators
We prove upper and lower bounds for the metastability of a statespace decomposition for reversible Markov processes in terms of dominant eigenvalues and eigenvectors of the corresponding transfer operator. The bounds are explicitly computable and sharp. In contrast to many other approaches, the results do not rely on any asymptotic expansions in terms of some smallness parameter, but rather hol...
متن کاملImproved Upper Bounds for the Mixed
|In this paper, we take a new look at the mixed struc-tured singular value problem, a problem nding important applications in robust stability analysis. Several new upper bounds are proposed using a very simple approach which we call the multiplier approach. These new bounds are convex and computable by using linear matrix inequality (LMI) techniques. We show, most importantly, that these upper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Machine Learning Research
دوره 5 شماره
صفحات -
تاریخ انتشار 2000