On-line evaluation and prediction using linear functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On-line evaluation and prediction using linear functions

Full text

Pdf (1.55 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: 21 - 31

Year of Publication: 1997

ISBN:0-89791-891-6

Author

Philip M. Long

ISCS Department, National University of Singapore, Singapore 119260, Republic of Singapore

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): 0, Downloads (12 Months): 11, 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.267471 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	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	2	P. Auer , N. Cesa-Bianchi , Y. Freund , R. E. Schapire, Gambling in a rigged casino: The adversarial multi-armed bandit problem, Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.322, October 23-25, 1995
	3	Peter Auer , Philip M. Long , Wolfgang Maass , Gerhard J. Woeginger, On the Complexity of Function Learning, Machine Learning, v.18 n.2-3, p.187-230, Feb./March 1995 [doi>10.1007/BF00993410]
	4	I. Barland. Some ideas on learning with directional feedback. Master's thesis, UC Santa Cruz, June 1992.
	5	Ethan J. Bernstein, Absolute error bounds for learning linear functions online, Proceedings of the fifth annual workshop on Computational learning theory, p.160-163, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130403]
	6	Donald A. Berry and Bert Fristedt. Bandit Problems. Chapman and Hall, New York, 1985.
	7	A.W. Biermann and P.M. Long. The composition of messages in speech-graphics interactive systems. Proceedings ~{the 1996 !nternationaI SYmposium on Spoken Dialogue, 1996.
	8	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]
	9	N. Ccsa-Bianchi, P.M. Long, and M.K. Warmuth. Worsl-case quadratic loss bounds for prediction using linear {unctions and gradient descent. IEEE Transactions (m Neural Networks, 7(3):604-619, 1996.
	10	T. Covcr. Behavior of sequential predictors of binary sequences. In Proceedings of the 4th Prague Conference on Information Theory, Statistical Decision Functions and Random Processes, pages 263-272. Publishing House of the Czechoslovak Academy of Sciences, 1965.
	11	Thomas M. Cover , Joy A. Thomas, Elements of information theory, Wiley-Interscience, New York, NY, 1991
	12	V. Faber and J. Mycielski. Applications of learning theorems. Fundamenta lnformaticae, 15(2): 145-167, 1991.
	13	Yoav Freund , Robert E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Proceedings of the Second European Conference on Computational Learning Theory, p.23-37, March 13-15, 1995
	14	D.P. Helmbold, N. Littlestone, and P.M. Long. Apple tasting and nearly one-sided learning. Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science, 1992.
	15	D. T. Hoang , P. M. Long , J. S. Vitter, Efficient Cost Measures for Motion Compensation at Low Bit Rates, Proceedings of the Conference on Data Compression, p.102, March 31-April 03, 1996
	16	S. Kaczmarz. Angenaherte Aufl6sung yon systemen linearer gleichungen. Bull. Acad. Polon. Sci. Lett. A, 35:355-357, 1937.
	17	M. Kearns , M. Li , L. Pitt , L. Valiant, On the learnability of Boolean formulae, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.285-295, January 1987, New York, New York, United States [doi>10.1145/28395.28426]
	18	Don Kimber , Philip M. Long, On-line learning of smooth functions of a single variable, Theoretical Computer Science, v.148 n.1, p.141-156, Aug. 21, 1995 [doi>10.1016/0304-3975(95)00021-N]
	19	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]
	20	Norbert Klasner , Hans Ulrich Simon, From noise-free to noise-tolerant and from on-line to batch learning, Proceedings of the eighth annual conference on Computational learning theory, p.250-257, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225328]
	21	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]
	22	N. Littlestone, Mistake bounds and logarithmic linear-threshold learning algorithms, University of California at Santa Cruz, Santa Cruz, CA, 1990
	23	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]
	24	Philip M. Long, Improved Bounds about On-line Learning of Smooth Functions of a Single Variable, Proceedings of the 7th International Workshop on Algorithmic Learning Theory, p.26-36, October 23-25, 1996
	25	N. Merhav and M. Feder. Universal schemes for sequential decision from individual data sequences. IEEE Trans. Inform. Theory, 39(4):1280-1291, 1993.
	26	J. Mycielski. A learning algorithm for linear operators. Proceedings of the American Mathematical Societ),, 103(2):547-550, 1988.
	27	H.L. Royden. RealAnalysis. Macmillan, 1963.
	28	B. Widrow and M.E. Hoff. Adaptive switching circuits. 1960 IRE WESCON Cony. Record, pages 96- 104, 1960.