Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/307400.307443acmconferencesArticle/Chapter ViewAbstractPublication PagescoltConference Proceedingsconference-collections
Article
Free access

Linear relations between square-loss and Kolmogorov complexity

Published: 06 July 1999 Publication History
First page of PDF

References

[1]
N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth. How to use expert advice. Journal of the ACM, (44):427-485, 1997.
[2]
R. Courant. Differential and Integral Calculus, volume 1. Blackie & Son, Ltd, London and Glasgo, 1948.
[3]
D. Haussler, J. Kivinen, and M. K. Warmuth. Tight worst-case loss bounds for predicting with expert advise. Technical Report UCSC- CRL-94-36, University of California at Santa Cruz, revised December 1994.
[4]
Chuan-Chin Hsiung. A First Course in Differential Geometry. John Wiley & Sons, Inc, 1981.
[5]
M. Li and P. Viffmyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York, 2nd edition, 1997.
[6]
N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
[7]
V. Vovk and A. Gammerman. Complexity eValuation principle. Technical report, Royal Holloway, University of London, 1999.
[8]
V. Vovk. Aggregating strategies. In M. Fulk and J. Case, editors, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pages 371-383, San Mateo, CA, 1990. Morgan Kaufmann.
[9]
V. Vovk. Probability theory for the Brier game. In M. Li and A. Mamoka, editors, Algorithmic Learning Theory, volume 1316 of Lecture Notes in Computer Science, pages 323-338. 1997. To appear in Theoretical Computer Science.
[10]
V Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, (56): 153-173, 1998.
[11]
V. Vovk and C. J. H. C. Watkins. Universal portfolio selection. In Proceedings of the l l th Annual Conference on Computational Learning Theory, pages 12-23, 1998.
[12]
V.V. V'yugin. Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information. Selecta Mathematica formerly Sovietica, 13:357-389, 1994.
[13]
A.K. Zvonkin and L. A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys, 25:83-124, 1970.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
COLT '99: Proceedings of the twelfth annual conference on Computational learning theory
July 1999
333 pages
ISBN:1581131674
DOI:10.1145/307400
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 July 1999

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

COLT99
Sponsor:

Acceptance Rates

COLT '99 Paper Acceptance Rate 35 of 71 submissions, 49%;
Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)34
  • Downloads (Last 6 weeks)7
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media