A PAC analysis of a Bayesian estimator

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A PAC analysis of a Bayesian estimator

Full text

Pdf (1.25 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the tenth annual conference on Computational learning theory table of contents

Nashville, Tennessee, United States

Pages: 2 - 9

Year of Publication: 1997

ISBN:0-89791-891-6

Authors

John Shawe-Taylor	Dept of Computer Science, Royal Holloway, University of London, Egham, TW20 0EX, UK
Robert C. Williamson	Dept of Engineering, Australian National University, Canberra 0200, Australia

Sponsors

AT&T Labs :
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Vanderbilt University : Vanderbilt University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 28, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/267460.267466 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	Noga Alon , Shai Ben-David , Nicolò Cesa-Bianchi , David Haussler, Scale-sensitive dimensions, uniform convergence, and learnability, Journal of the ACM (JACM), v.44 n.4, p.615-631, July 1997 [doi>10.1145/263867.263927]
	2	Martin Anthony , Peter L. Bartlett, Function learning from interpolation, Proceedings of the Second European Conference on Computational Learning Theory, p.211-221, March 13-15, 1995
	3	Peter L. Bartlett, "The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network," Technical Report, Department of Systems Engineering, Australian National University, May 1996.
	4	Peter L. Bartlett and Philip M. Long, "Prediction, Learning, Uniform Convergence, and Scale- Sensitive Dimensions," Preprint, Department of Systems Engineering, Australian National University, November 1995.
	5	Peter L. Bartlett , Philip M. Long , Robert C. Williamson, Fat-shattering and the learnability of real-valued functions, Journal of Computer and System Sciences, v.52 n.3, p.434-452, June 1996 [doi>10.1006/jcss.1996.0033]
	6	J.M Bernardo and A.F.M. Smith, Bayesian Theory, John Wiley and Sons, Chichester, 1994.
	7	Michael Biehl and Manfred Opper, "Perceptron Learning: The Largest Version Space," in Neural Networks: The Statistical Mechanics Perspective. Proceedings of the CTP-PBSRI Workshop on Theoretical Physics, World Scientific. Also available at: http:// brain, postech, ac. kr/nnsmp/compressed/biehl, ps. Z
	8	Christopher M. Bishop, Neural networks for pattern recognition, Oxford University Press, Oxford, 1996
	9	Bernhard E. Boser , Isabelle M. Guyon , Vladimir N. Vapnik, A training algorithm for optimal margin classifiers, Proceedings of the fifth annual workshop on Computational learning theory, p.144-152, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130401]
	10	George Casella, "Conditional Inference from Confidence Sets," pages 1-12 in Malay Ghosh and Pramod K. Pathak (eds), Current Issues in Statistical Inference: Essays in Honor of D. Basu, Institute of Mathematical Statistics, Haywood, CA, 1992.
	11	Corinna Cortes , Vladimir Vapnik, Support-Vector Networks, Machine Learning, v.20 n.3, p.273-297, Sept. 1995 [doi>10.1023/A:1022627411411]
	12	D.R. Cox, "Some Problems Connected with Statistical Inference," Annals of Mathematical Statistics, 29,357-372, (1958).
	13	Irving John Good, "46656 Varieties of Bayesians," The American Statistician, 25, 62-63, (December 1971).
	14	Irving John Good, "The Bayesian Influence, or how to Sweep Subjectivism Under the Carpet," pages 125--174 in {16}.
	15	Irving John Good, "Confidence," Journal of Statistical Computation and Simulation, 28(1), 85-86 (1987).
	16	W.L Harper and C.A Hooker (Eds), Foundations of Probability Theory, Statistical Inference, and Statistical Theories of Science, Volume II: Foundations and Philosophy of Statistical Inference, D. Riedel, Dordrecht, 1976.
	17	E.T. Jaynes, "Confidence Intervals vs Bayesian Intervals,'' pages 175-257 in {16}.
	18	Harold Jeffreys, Theory of Probability, Second Edition, Oxford University Press, Oxford, 1948.
	19	Michael J. Kearns and Robert E. Schapire, "Efficient Distribution-free Learning of Probabilistic Concepts," pages 382-391 in Proceedings of the 3Ist Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990.
	20	Gábor Lugosi , Márta Pintér, A data-dependent skeleton estimate for learning, Proceedings of the ninth annual conference on Computational learning theory, p.51-56, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238068]
	21	David J.C. MacKay, "Bayesian Model Comparison and Backprop Nets," pages 839-846 in John E. Moody et al. (Eds.) Advances in Neural Information Processing Systems J, Morgan Kaufmann Pnblishers, San Mateo, CA, 1992.
	22	David J.C. MacKay, "Probable Networks and Plausible Predictions -- A Review of Practical Bayesian methods for Supervised Neural Networks," Preprint, Cavendish Laboratory, Cambridge (1996). ftp://ftp, wol. ra. phy. cam. ac. uk/ pub/mackay/net ~ork. p$. gz
	23	Donald A. Pierce, "On Some Difficulties in a Frequency Theory of Inference," The Annals of Statistics, 1(2), 241-250 (1973).
	24	Karl R. Popper, Realism and the Aim of Science, Rowman and Littlefield, Totowa, 1983.
	25	John Shawe-Taylor , Peter L. Bartlett , Robert C. Williamson , Martin Anthony, A framework for structural risk minimisation, Proceedings of the ninth annual conference on Computational learning theory, p.68-76, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238070]
	26	John Shawe-Taylor, Peter Bartlett, Robert Williamson and Martin Anthony, "Structural Risk Minimization over Data-Dependent Hierarchies'', NeuroCOLT Technical Report, NC-TR- 96-053 and submitted to IEEE Trans. on Information Theory. ( ftp://ftp, dcs. rhbnc, ac. uk/ pub/neurocolt/tech_report s).
	27	Stephen Spielman, "A Refutation of the Neyman- Pearson Theory of Testing," British Journal for the Philosophy of Science, 24, 201-222, (1973).
	28	V. N. Vapnik, Inductive principles of the search for empirical dependences (methods based on weak convergence of probability measures), Proceedings of the second annual workshop on Computational learning theory, p.3-21, December 1989, Santa Cruz, California, United States
	29	Vladimir Vapnik, Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics), Springer-Verlag New York, Inc., Secaucus, NJ, 1982

CITED BY 6

	David A. McAllester, PAC-Bayesian Stochastic Model Selection, Machine Learning, v.51 n.1, p.5-21, April 2003
	Yoav Freund, Self bounding learning algorithms, Proceedings of the eleventh annual conference on Computational learning theory, p.247-258, July 24-26, 1998, Madison, Wisconsin, United States
	David A. McAllester, PAC-Bayesian model averaging, Proceedings of the twelfth annual conference on Computational learning theory, p.164-170, July 07-09, 1999, Santa Cruz, California, United States
	David A. McAllester, Some PAC-Bayesian theorems, Proceedings of the eleventh annual conference on Computational learning theory, p.230-234, July 24-26, 1998, Madison, Wisconsin, United States
	Shai Fine , Ran Gilad-Bachrach , Eli Shamir, Query by committee, linear separation and random walks, Theoretical Computer Science, v.284 n.1, p.25-51, 6 July 2002
	David A. McAllester, Some PAC-Bayesian Theorems, Machine Learning, v.37 n.3, p.355-363, Dec. 1999