ACM Home Page
Please provide us with feedback. Feedback
Some PAC-Bayesian theorems
Full text PdfPdf (625 KB)
Source Annual Workshop on Computational Learning Theory archive
Proceedings of the eleventh annual conference on Computational learning theory table of contents
Madison, Wisconsin, United States
Pages: 230 - 234  
Year of Publication: 1998
ISBN:1-58113-057-0
Author
David A. McAllester  AT&T Labs-Research, 180 Park Avenue, Florham Park, NJ
Sponsors
University of Wisconsin : University of Wisconsin
UC @ Santa Cruz : UC @ Santa Cruz
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 12,   Citation Count: 11
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/279943.279989
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A.R. Barron. Complexity regularization with application to artificial neural networks. In G. Roussas, editor, Nonparametric Functional Estimation and Related Topics, pages 561-576. Kluwer Academic Publishers, 1991.
 
2
A.R. Barron and T.M. Cover. Minimum complexity density estimation. IEEE Transactions on Information Theory, 37:1034-1054, 1991.
3
 
4
 
5
G. Lugosi and K. Zeger. Concept learning using complexity regularization. IEEE TRANsactions on Information Theory, 42:48-54, 1996.
6
7

CITED BY  11
 
 
 
 
 
 
 

Collaborative Colleagues:
David A. McAllester: colleagues

Peer to Peer - Readers of this Article have also read: