Article

Free access

How to use expert advice

Authors:

Nicolò Cesa-Bianchi,

David P. Helmbold,

David Haussler,

Robert E. Schapire,

Manfred K. WarmuthAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 382 - 391

https://doi.org/10.1145/167088.167198

Published: 01 June 1993 Publication History

First page of PDF

References

[1]

T. M. Cover. Behaviour of sequential predictors of binary sequences. In Transactions of the Fourth Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, pages 263-272. Publishing House of the Czechoslovak Academy of Sciences, 1965.

[2]

T. M. Cover and A. Shanhar. CompoundBayes predictors for sequences with apparent Markov structure. IEEE Transactzons on Systems, Man and Cybernetics, SMC-7(6):421-424, Jmm 1977.

[3]

A. Dawid. Prequential data analysis. Current Issues in Statistical Inference, to appear.

[4]

A. P. Dawid. Statistical theory: The prequential approach. Journal of the Royal Statistical Society, Series A, pages 278- 292, 1984.

[5]

A. P. Dawid. Prequential analysis, stochastic complexity and Bayesian inference. Bayesian Statistics 4, to appear.

[6]

A. DeSantis, G. Markowski, and M. N. Wegman. Learning probabilistic prediction functions. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 312- 328. Morgan Kaufmann, 1988.

Digital Library

[7]

M. Feder, N. Merhav, and M. Gutman. Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38:1258-1270, 1992.

Digital Library

[8]

A. Fiat, D. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan. Competitive algorithms for layered graph traversal. In 32nd Annual Symposium on Foundations of Computer Science, pages 288-297, 1991.

Digital Library

[9]

A. Fiat, R. Karp, M. Luby, L. McGeoch, D. Sleator, aald N. Yomlg. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991.

Digital Library

[10]

A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-server algorithms. In 31st Annual Symposium on Foundations of Computer Science, pages 454-463, 1990.

Digital Library

[11]

J. Galambos. The Asymptotic Theory of Extreme Oreder Stat2stics. R. E. Kreiger, second edition, 1987.

[12]

3. Hamlan. Approximation to Bayes risk in repeated play. ha Contributions to the theory of games, volume 3, pages 97-139. Princeton University Press, 1957.

[13]

D. Haussler and A. Barron. How well do Bayes methods work for on-line prediction of {+1, - 1 } values? In Proceedings of the Third NEC Symposium on Computation and Cognition. SIAM, to appear.

[14]

D. Haussler, M. Kearns, N. Littlestone, and M. K. Warmuth. Equivalence of models for polynomial learnability. Information and Computation, 95:129-161, 1991.

Digital Library

[15]

D. Haussler, M. Kearns, and R. Schapire. Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension. Machine Learning, to appear.

Digital Library

[16]

D. Haussler, N. Littlestone, and M. Waxinuth. Fredicting {0,1}-fualctions on randomly drawn points. Technical Report UCSC-CRL-90-54, University of California Santa Cruz, Computer Research Laboratory, Dec. 1990. To appear, Information and Computation.

[17]

D. Helmbold and M. K. Warmuth. On weak learning. In Proceedings of the Third NEC Research Symposium on Co'rnpurational Learning and Cognition. SIAM, to appear.

[18]

D. P. Hehnbold and M. K. Warmuth. Some weak lealTSng results. In Proceedings of the Fifth Annual A CM Workshop on Computational Learning Theory, pages 399-412, 19!)2.

Digital Library

[19]

M. J. Kearns and R. E. Schapire. Efficient distributiolL-free learning of probabilistic concepts. In 31st Annual Symposium on Foundations of Computer Science, pages 382-391, 1990.

Digital Library

[20]

M. J. Kearns, R. E. Schapire, and L. M. Sellie. Toward efficient agnostic learning. In Proceedings of the Fifth Annual A CM Workshop on Computational Learning Theory, pages 341-352, 1992.

Digital Library

[21]

N. Littlestone. From on-fine to batch learning. In Proceedings of the Second Annual Workshop on Computational Learning Theory, pages 269-284. Morgan Kaufmann, 1989.

Digital Library

[22]

N. Littlestone, P. M. Long, and M. K. Warmuth. On-line learning of linear functions. In Proceedings of the Twenty Third Annual A CM Symposium on Theory of Computing, pages 465-475, 1991.

Digital Library

[23]

N. Littlestone and M. Warmuth. The weighted majority algorithm, in 30th Annual IEEE Symposium on Foundations of Computer Science, pages 256-261, 1989. Long version: UCSC tech. rep. UCSC-CRL-91-28.

Digital Library

[24]

N. Merhav and M. Feder. Universal sequential learning and decision from individual data sequences. In Proceedings of the Fifth Annual A CM Workshop on Computational Learning Theory, pages 413-427, 1992.

Digital Library

[25]

J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.

Digital Library

[26]

J. Rissanen. Stochastic complexity and modeling. The Annals of Statistics, 14(3):1080-1100, 1986.

[27]

J. Rissanen and G. G. Langdon, Jr. Universal modeling and coding. IEEE Transactions on Information Theory, IT- 27(1):12-23, Jan. 1981.

Digital Library

[28]

H. S. Seung, H. Sompolinsky, and N. Tishby. Stati,#tical mechanics of learning from examples. Physical Review A, 45(8):6056-6091, 1992.

[29]

H. Sompolinsky, N. Tishby, and H. Seung. Learning from examples in large neural networks. Physical Review Led!ters, 65:1683-1686, 1990.

[30]

M. Talagrand. Sharper bounds for Gaussian and empirical processes. Annals of Probability, to appear.

[31]

L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-42, 1984.

Digital Library

[32]

V. Vapnik. Principles of risk minimization for learning theory. In J. E. Moody, S. J. Hanson, and R. P. Lippman, editors, Advances in Neural information Processing Systems 4. Morgan Kaufmann, 1992.

[33]

V. N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer-Verlag, 1982.

Digital Library

[34]

V. G. Vovk. Aggregating strategies. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 371-383. Morgan Kaufmann, 1990.

Digital Library

[35]

V. G. Vovk. Prequential probability theory. Unpublished manuscript, 1990.

[36]

V. G. Vovk. Universal forcasting algorithms. Information and Computation, 96(2):245-277, Feb. 1992.

Digital Library

[37]

K. Yamanishi. A loss bound model for on-line stochastic prediction strategies. In Proceedings of the Fourth Annual 302. Morgan Kaufmann, 1991.

Digital Library

Cited By

de Zordo-Banliat MDergham GMerle XCinnella P(2023)Space-dependent turbulence model aggregation using machine learningJournal of Computational Physics10.1016/j.jcp.2023.112628(112628)Online publication date: Nov-2023
https://doi.org/10.1016/j.jcp.2023.112628
Yamanishi KYamanishi K(2023)Extension of Stochastic ComplexityLearning with the Minimum Description Length Principle10.1007/978-981-99-1790-7_8(287-316)Online publication date: 15-Sep-2023
https://doi.org/10.1007/978-981-99-1790-7_8
Gokcesu KKozat S(2018)Online Density Estimation of Nonstationary Sources Using Exponential Family of DistributionsIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2017.274000329:9(4473-4478)Online publication date: Sep-2018
https://doi.org/10.1109/TNNLS.2017.2740003
Show More Cited By

Index Terms

How to use expert advice
1. Computing methodologies
  1. Machine learning
2. Theory of computation
  1. Models of computation
    1. Probabilistic computation

Recommendations

Providing Expert Advice by Analogy for On-Line Help
IAT '05: Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology

One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative naïveté of novices, who usually are often not in a position to understand ...
Providing Expert Advice by Analogy for On-Line Help
WI '05: Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence

One of the principal problems of online help is the mismatch between the specialized knowledge and technical vocabulary of experts who are providing the help, and the relative naïveté of novices, who usually are often not in a position to understand ...
Prediction with expert evaluators' advice
ALT'09: Proceedings of the 20th international conference on Algorithmic learning theory

We introduce a new protocol for prediction with expert advice in which each expert evaluates the learner's and his own performance using a loss function that may change over time and may be different from the loss functions used by the other experts. The ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Copyright © 1993 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

75
Total Citations
View Citations
463
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

de Zordo-Banliat MDergham GMerle XCinnella P(2023)Space-dependent turbulence model aggregation using machine learningJournal of Computational Physics10.1016/j.jcp.2023.112628(112628)Online publication date: Nov-2023
https://doi.org/10.1016/j.jcp.2023.112628
Yamanishi KYamanishi K(2023)Extension of Stochastic ComplexityLearning with the Minimum Description Length Principle10.1007/978-981-99-1790-7_8(287-316)Online publication date: 15-Sep-2023
https://doi.org/10.1007/978-981-99-1790-7_8
Gokcesu KKozat S(2018)Online Density Estimation of Nonstationary Sources Using Exponential Family of DistributionsIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2017.274000329:9(4473-4478)Online publication date: Sep-2018
https://doi.org/10.1109/TNNLS.2017.2740003
Truong AEtesami SEtesami JKiyavash N(2018)Optimal Attack Strategies Against Predictors - Learning From Expert AdviceIEEE Transactions on Information Forensics and Security10.1109/TIFS.2017.271848813:1(6-19)Online publication date: Jan-2018
https://doi.org/10.1109/TIFS.2017.2718488
Truong AKiyavash NRasoul Etesami S(2018)Adversarial Machine Learning: The Case of Recommendation Systems2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)10.1109/SPAWC.2018.8445767(1-5)Online publication date: Jun-2018
https://doi.org/10.1109/SPAWC.2018.8445767
Baltaoglu STong LZhao Q(2017)Online learning of optimal bidding strategy in repeated multi-commodity auctionsProceedings of the 31st International Conference on Neural Information Processing Systems10.5555/3294996.3295204(4510-4520)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.5555/3294996.3295204
Vanli NGokcesu KSayin MYildiz HKozat S(2016)Sequential Prediction Over Hierarchical StructuresIEEE Transactions on Signal Processing10.1109/TSP.2016.260714164:23(6284-6298)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1109/TSP.2016.2607141
Lee SKim J(2016)Effective Lifetime-Aware Dynamic Throttling for NAND Flash-Based SSDsIEEE Transactions on Computers10.1109/TC.2014.234951765:4(1075-1089)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1109/TC.2014.2349517
Zhu JYang JXiao JHuang CZhao GTang Y(2016)Online Prediction for Forex with an Optimized Experts Selection ModelWeb Technologies and Applications10.1007/978-3-319-45814-4_30(371-382)Online publication date: 17-Sep-2016
https://doi.org/10.1007/978-3-319-45814-4_30
Barth ARubinstein BSundararajan MMitchell JSong DBartlett P(2012)A Learning-Based Approach to Reactive SecurityIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2011.429:4(482-493)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1109/TDSC.2011.42
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents