generalization bounds
On Ranking and Generalization Bounds
... similar bounds to ...get generalization bounds with ”fast rates” for the excess risk in ranking? They gave a positive answer (Cl´emenc¸on et ...obtain generalization bounds with better ...
20
Algorithm dependent generalization bounds for multi task learning
... algorithm-dependent generalization bounds, we analyze the performance of one partic- ular task as well as the average performance over all of the multiple tasks for the MTL algorithms, which employ learning ...
49
Generalization Bounds and Complexities Based on Sparsity and Clustering for Convex Combinations of Functions from Random Classes
... new generalization data dependent bounds for several classes of algorithms explored in the existing literature by different ...property. Generalization bounds are derived for convex ...
34
Generalization Bounds for Ranking Algorithms via Algorithmic Stability
... study generalization properties of ranking algorithms in a more general setting of the ranking problem than has been considered previously, and that arises frequently in ...obtain generalization ...
34
Generalization Bounds for the Area Under the ROC Curve
... study generalization properties of the area under the ROC curve (AUC), a quantity that has been advocated as an evaluation criterion for the bipartite ranking ...tion bounds for the classification error ...
33
On the Importance of Small Coordinate Projections
... Sharp generalization bounds can be obtained when the “size” of the set of coordinate projections of the random subclass is “small” in the sense that with high probability the Rademacher averages associated ...
20
Stability Bounds for Stationary φ-mixing and β-mixing Processes
... stability bounds for both ϕ-mixing and β-mixing stationary sequences. Our bounds apply to large classes of algorithms, including common algorithms such as SVR, KRR, and SVMs, and extend to ...stability ...
26
PAC-Bayesian Analysis of Co-clustering and Beyond
... of generalization bounds for the above two problems we found it convenient to apply the PAC-Bayesian framework (McAllester, 1998, 1999), which is reviewed in Section ...PAC-Bayesian bounds pose no ...
52
Regularization Techniques for Learning with Matrices
... regret bounds in the online learning model and Rademacher bounds (that leads to generalization bounds in the batch learning ...obtained bounds can be used for systematically choosing an ...
26
Regularization via Mass Transportation
... The goal of regression and classification methods in supervised learning is to minimize the empirical risk, that is, the expectation of some loss function quantifying the prediction error under the empirical ...
68
Wasserstein Soft Label Propagation on Hypergraphs: Algorithm and Generalization Error Bounds
... established generalization error bounds for prop- agating one-dimensional distributions using 2-Wasserstein ...first generalization error bounds for Wasserstein dis- tance based soft label ...
8
Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and Stationary β-Mixing Processes
... -Bayes bounds are among the most accurate generalization bounds for classifiers learned from independently and identically distributed (IID) data, and it is particularly so for margin classifiers: ...
30
A century of generalization
... positive and negative stimuli. Despite the obvious bi- ological importance of the subject, our knowledge of generalization following experiences with many stim- uli is unsystematic. Relevant data come from a ...
29
Positive Root Bounds and Root Separation Bounds.
... The motivation for considering number of sign variations is as follows. Theorem 3.1 is a consequence of the fact that for fixed degree and coefficient size, the largest positive root of a polynomial can be arbitrarily ...
106
Causality and universality in low-energy scattering
... We briefly comment on the requirement that the inter- actions are energy independent. For energy-dependent in- teractions it is possible to generate any energy dependence for the phase shifts even when the interaction ...
6
The Generalization of Helices
... S.Izumiya and N.Takeuchi have investigated the classification of special developable surfaces under the condition that there exists a slant helix as a geodesic on the surface(cf. Theorem 5.4)[13]. Now, we have the fol- ...
18
Breaking the Curse of Dimensionality with Convex Neural Networks
... their generalization performance, with a study of both the approximation and the estimation ...same generalization error bounds, even when constant-factor approximations cannot be ...
53
Generalization technique for 2D+Scale DHE data model
... The significant contribution of introducing Extrude by Line/Polyline technique is generalization based on boundary preservation. Some applications need their boundary to be preserved more than other aspects such ...
7
Generalization Error Bounds for Threshold Decision Lists
... We have not considered in this paper the algorithmics of learning threshold decision lists. As mentioned, heuristics for learning threshold decision lists were studied by Marchand and Golea (1993), and although no ...
29
Inequalities for M tensors
... some bounds for the minimum eigenvalue of M-tensors are obtained, and proved to be tighter than those in Theorem ...some bounds for eigenvalues of M-tensors except the minimum eigenvalue are ...
9