Rademacher penalties and structural risk minimization

IEEE Transactions on Information Theory

Volumn 47, Issue 5, 2001, Pages 1902-1914

  Koltchinskii, V ^a  

^a UNIVERSITY OF NEW MEXICO   (United States)

Author keywords

Classification; Empirical process; Iterative structural risk minimization; Oracle inequalities; Rademacher penalty; Structural risk minimization

Indexed keywords

CLASSIFICATION (OF INFORMATION); ITERATIVE METHODS; LEARNING ALGORITHMS; PROBABILITY; RISK MANAGEMENT; SET THEORY;

ORACLE INEQUALITIES; PENALTY FUNCTIONS; RADEMACHER PROCESS;

STRUCTURAL OPTIMIZATION;

EID: 0035397715     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.930926     Document Type: Article

References (39)

1. On the uniform convergence of relative frequencies of events to their probabilities
2. A theory of learnable
3. Learnability and the Vapnik-Chervonenkis dimension
4. Concept learning using complexity regularization
5. From model selection to adaptive estimation
6. Risk bounds for model selection via penalization
7. A new look at independence
8. New concentration inequalities in product spaces
9. On Talagrand's deviation inequalities for product measures
10. About the constants in Talagrand's concentration inequalities for empirical processes
11. Oracle inequalities and nonparametric function estimation
12. On the central limit theorem for empirical measures
13. A central limit theorem for empirical processes
14. Some limit theorems for empirical processes
15. Improved sample complexity estimates for statistical learning control of uncertain systems
16. Model Selection using Rademacher Penalization
17. A sharp concentration inequality with applications in random combinatorics and learning
18. Rademacher processes and bounding the risk of function learning
19. Learning by canonical smooth estimation - Part II: Learning and choice of model complexity
20. Structural risk minimization over data-dependent hierarchies
21. Self bounding learning algorithms
22. Weighted sums of certain dependent random variables
23. Exponential bounds for large deviations
24. Functional limit theorems and empirical entropy. I
25. Functional limit theorems and empirical entropy. II
26. Asymptotic theory of finite dimensional normed spaces
27. Martingale inequalities and NP-complete problems
28. On the method of bounded differences
29. Microchoice bounds and self bounding learning algorithms