Derandomizing stochastic prediction strategies

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Derandomizing stochastic prediction strategies

Full text

Pdf (1.66 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: 32 - 44

Year of Publication: 1997

ISBN:0-89791-891-6

Author

V. Vovk

Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK

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): 4, Downloads (12 Months): 19, 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.267473 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	B. C. Carlson, Special functions of applied mathematics, Academic Press, New York, 1977.
	2	Nicolò Cesa-Bianchi , Yoav Freund , David P. Helmbold , David Haussler , Robert E. Schapire , Manfred K. Warmuth, How to use expert advice, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.382-391, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167198]
	3	Nicolò Cesa-Bianchi , Yoav Freund , David P. Helmbold , Manfred K. Warmuth, On-line prediction and conversion strategies, Machine Learning, v.25 n.1, p.71-110, Oct. 1996 [doi>10.1023/A:1018348209754]
	4	T. Cover and E. Ordentlich, Universal portfolios with side information, IEEE Trans. Inform. Theory 42 (1996), No. 2.
	5	A. P. Dawid, Probability forecasting, in "Encyclopedia of Statistical Sciences" (S. Kotz and N. L. Johnson, Eds.), Vol. 7, pp. 210-218, Wiley, New York, 1986.
	6	Yoav Freund, Predicting a binary sequence almost as well as the optimal biased coin, Proceedings of the ninth annual conference on Computational learning theory, p.89-98, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238072]
	7	Yoav Freund , Robert E. Schapire , Yoram Singer , Manfred K. Warmuth, Using and combining predictors that specialize, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.334-343, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258616]
	8	David Haussler , Jyrki Kivinen , Manfred K. Warmuth, Tight worst-case loss bounds for predicting with expert advice, Proceedings of the Second European Conference on Computational Learning Theory, p.69-83, March 13-15, 1995
	9	M. Herbster and M. Waxmuth, Tracking the best expert, in "Proceedings, 12th International Conference on Machine Learning," 1995.
	10	S. L. Lauritzen , D. J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, Readings in uncertain reasoning, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1990
	11	Nick Littlestone , Manfred K. Warmuth, The weighted majority algorithm, Information and Computation, v.108 n.2, p.212-261, Feb. 1, 1994 [doi>10.1006/inco.1994.1009]
	12	J Pearl, Fusion, propagation, and structuring in belief networks, Artificial Intelligence, v.29 n.3, p.241-288, Sept. 1986 [doi>10.1016/0004-3702(86)90072-X]
	13	J. Rissanen, A universal prior for integers and estimation by minimum description length, Ann. Statist. 11 (1983), 416-431.
	14	Glenn Shafer , Judea Pearl, Readings in uncertain reasoning, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1990
	15	Volodimir G. Vovk, Aggregating strategies, Proceedings of the third annual workshop on Computational learning theory, p.371-386, August 06-08, 1990, Rochester, New York, United States
	16	V. G. Vovk, A game of prediction with expert advice, Proceedings of the eighth annual conference on Computational learning theory, p.51-60, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225304]

CITED BY 6

	Mark Herbster , Manfred K. Warmuth, Tracking the best regressor, Proceedings of the eleventh annual conference on Computational learning theory, p.24-31, July 24-26, 1998, Madison, Wisconsin, United States
	V. Vovk , C. Watkins, Universal portfolio selection, Proceedings of the eleventh annual conference on Computational learning theory, p.12-23, July 24-26, 1998, Madison, Wisconsin, United States
	Eiji Takimotoa , Akira Maruokaa , Volodya Vovk, Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme, Theoretical Computer Science, v.261 n.1, p.179-209, 06/17/2001
	V. Vovk, Derandomizing Stochastic Prediction Strategies, Machine Learning, v.35 n.3, p.247-282, June 1999
	Mark Herbster , Manfred K. Warmuth, Tracking the best linear predictor, The Journal of Machine Learning Research, 1, p.281-309, 9/1/2001
	Mark Herbster , Manfred K. Warmuth, Tracking the Best Expert, Machine Learning, v.32 n.2, p.151-178, Aug. 1998