Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
122
click to vote
COLT
2001
Springer
95
views
Machine Learning
»
more
COLT 2001
»
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
15 years 7 months ago
Download
www.ai.mit.edu
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
claim paper
Read More »