Near-Bayesian exploration in polynomial time

Full Text:

PDF

Buy this Article

Authors:	J. Zico Kolter	Stanford University, CA
	Andrew Y. Ng	Stanford University, CA

Published in:

· Proceeding

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning

ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-516-1 doi>10.1145/1553374.1553441

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 4 · Downloads (12 Months): 33 · Citation Count: 5

Tools and Resources

Tags: algorithms computations on polynomials design learning modeling methodologies probabilistic algorithms theory