Complexity approximation principle

Computer Journal

Volumn 42, Issue 4, 1999, Pages 320-322

  Vovk, Vladimir ^a   Gammerman, Alexander ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY;

COMPLEXITY APPROXIMATION PRINCIPLES (CAP); KOLMOGOROV COMPLEXITY; RISSANEN'S MINIMUM DESCRIPTION LENGTH (MDL); WALLACE'S MINIMUM MESSAGE LENGTH (MML);

COMPUTATIONAL COMPLEXITY;

EID: 0032646993     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.4.318     Document Type: Article

References (19)

1. Rissanen, J. (1983) A universal prior for integers and estimation by minimum description length. Ann. Statist., 11, 416-431.
2. Rissanen, J. (1987) Stochastic complexity (with discussion). J. R. Statist. Soc., B, 49, 223-239, 252-265.
3. Wallace, C. S. and Freeman, P. R. (1987) Estimation and inference by compact coding (with discussion). J. R. Statist. Soc.,E, 49, 240-265.
4. Gammerman, A. and Vovk, V. (1999) Kolmogorov complexity: sources, theory and applications. Comput. J., this issue.
5. Vovk, V. (1997) Probability theory for the Brier game. Accepted for publication in Theor. Comput. Sei. Preliminary version in Li, M. and Maruoka, A. (eds), Algorithmic Learning Theory, (LNCS 1316), pp. 323-338. Full version: Technical Report CSD-TR-97-09, Department of Computer Science, Royal Holloway, University of London, revised February 1998.
6. Vovk, V. and Watkins, C. J. H. C. (1998) Universal portfolio selection. In Proc. llth Ann. Conf. Computational Learning Theory, pp. 12-23. ACM Press, New York.
7. Kolmogorov, A. N. (1965) Three approaches to the quantitative definition of information. Prob. Inform. Transmission, 1, 1-7.
8. V'yugin, V. V. (1994) Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information. Selecta Mathematica Sovielica, 13, 357-389.
9. Li, M. and Vitânyi, P. (1997) An Introduction to Kolmogorov Complexity and Its Applications (2nd edn). Springer, New York.
10. V'yugin, V. V. (1999) Algorithmic complexity and stochastic properties of finite binary sequences. Comput. J., this issue.
11. Vovk, V. (1990) Aggregating strategies. In Fulk, M. and Case, J. (eds), Proc. 3rd Annual Workshop on Computational Learning Theory, pp. 371-383. Morgan Kaufmann, San Mateo, CA.
12. Haussler, D., Kivinen, J. and Warmuth, M. K. (1995) Tight Worst-case Loss Bounds for Predicting with Expert Advice. Technical Report UCSC-CRL-94-36, University of California at Santa Cruz, revised December 1994. Short version in Vitdnyi, P. (ed.), Computational Learning Theory, (LNCS 904), pp. 69-83. Springer, Berlin.
13. Vovk, V. (1998) A game of prediction with expert advice. J. Comp. Syst. Sei., 56, 153-173.
14. Zvonkin, A. K. and Levin, L. A. (1970) 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.
15. Levin, L. A. (1976) Various measures of complexity for finite objects (axiomatic description). Sov. Math.-DokL, 17, 522-526.
16. Cover, T. and Ordentlich, E. (1996) Universal portfolios with side information. IEEE Trans. Inform. Theory, 42, 348-363.
17. Vapnik, V. N. (1998) Statistical Learning Theory- Wiley, New York.
18. Rissanen, J. (1999) Hypothesis selection and testing by the MDL principle. Comput. J., 42, 260-269.
19. Clarke, B. (1999) Contribution to the discussion. Comput. J., 42, 338-339.