Improved risk tail bounds for on-line algorithms
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
The Nature of Statistical Learning Theory
1995 • 38,742 citations
A Probabilistic Theory of Pattern Recognition
1996 • 3,343 citations
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
2015 • 3,217 citations
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
2001 • 2,164 citations
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
1998 • 1,189 citations
On Tail Probabilities for Martingales
1975 • 667 citations
Structural risk minimization over data-dependent hierarchies
1998 • 536 citations
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
2002 • 481 citations
On the Generalization Ability of On-Line Learning Algorithms
2004 • 469 citations
Beating the hold-out
1999 • 251 citations
From on-line to batch learning
1989 • 130 citations
Online Regularized Classification Algorithms
2006 • 98 citations
Data Dependent Concentration Bounds for Sequential Prediction Algorithms
2005 • 40 citations
Cited By (0)
No citing papers found in database