A sharp concentration inequality with applications
We present a new general concentration-of-measure inequality and illustrate its power by applications in random combinatorics. The results find direct applications in some problems of learning theory.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Gábor Lugosi & Andrew B. Nobel, 1998. "Adaptive model selection using empirical complexities," Economics Working Papers 323, Department of Economics and Business, Universitat Pompeu Fabra.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:376. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.