Analysis of two gradient-based algorithms for on-line regression

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analysis of two gradient-based algorithms for on-line regression

Full text

Pdf (1.26 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: 163 - 170

Year of Publication: 1997

ISBN:0-89791-891-6

Author

Nicolò Cesa-Bianchi

DSI, University of Milan, Via Comelico 39, 20135 Milano, Italy

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): 2, Downloads (12 Months): 15, Citation Count: 1

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.267492 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	N. Cesa-Bianchi, PM. Long, and M.K. Warmuth. Worst-case quadratic loss bounds for prediction using linear functions and gradient descent. IEEE Transactions on Neural Networks, 7(3):604-619, 1996.
	2	Thomas M. Cover , Joy A. Thomas, Elements of information theory, Wiley-Interscience, New York, NY, 1991
	3	M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Trans. on Information Theory, 38:1258-1270,1992.
	4	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]
	5	D.P. Helmbold, J. Kivinen, and M.K. Warmuth. Worstcase loss bounds for sigmoided neurons. In Advances in Neural Information Processing Systems 8. MIT Press, 1996.
	6	W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58: 13-30, 1963.
	7	Jyrki Kivinen , Manfred K. Warmuth, Using experts for predicting continuous outcomes, Proceedings of the first European conference on Computational learning theory, p.109-120, October 1994, Royal Holloway, Univ. of London, United Kingdom
	8	Jyrki Kivinen , Manfred K. Warmuth, Exponentiated gradient versus gradient descent for linear predictors, Information and Computation, v.132 n.1, p.1-63, Jan. 10, 1997 [doi>10.1006/inco.1996.2612]
	9	Nick Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Machine Learning, v.2 n.4, p.285-318, April 1988 [doi>10.1023/A:1022869011914]
	10	Nicholas Littlestone , Philip M. Long , Manfred K. Warmuth, On-line learning of linear functions, Computational Complexity, v.5 n.1, p.1-23, Jan. 1995 [doi>10.1007/BF01277953]
	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	D. Pollard. Convergence of Stochastic Processes. Springer Verlag, 1984.
	13	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
	14	K. Yamanishi. A decision-theoretic extension of stochastic complexity and its application to learning. Submitted for publication, 1995.