An information theoretic tradeoff between complexity and accuracy

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2777, Issue , 2003, Pages 595-609

  Gilad Bachrach, Ran ^a   Navot, Amir ^a   Tishby, Naftali ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PERSONNEL TRAINING; PROBLEM SOLVING; STATISTICAL METHODS; ELECTRIC DISTORTION; IMAGE CODING; INFORMATION THEORY; SIGNAL DISTORTION;

BOTTLENECK FRAMEWORK; LEARNING THEORY; RATE-DISTORTION THEORY; SHANNON'S MUTUAL INFORMATION; CLASSICAL INFORMATION; CODING PROBLEMS; INFORMATION BOTTLENECK; MUTUAL INFORMATIONS; PREDICTION ACCURACY; PREDICTIVE ACCURACY; RATE DISTORTION-THEORY;

INFORMATION RETRIEVAL; COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 9444290390     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45167-9_43     Document Type: Conference Paper

References (14)

1. R. F. Ahlswede and J. Korner. Source coding with side information and a converse for degraded broadcast channels. IEEE transaction on information theory, 21(6):629-637, November 1975.
2. Y. Baram, R. El-Yaniv, and K. Luz. Online choice of active learning algorithms. Submitted for publication.
3. J. Cardinal. Compression of side information. In IEEE International Conference on Multimedia and Expo, 2003.
4. T. M. Cover and J. A. Thomas. Elements Of Information Thory. Wiley Inter-science, 1991.
5. J. Kleinberg. An impossibility theorem for clustering. In Proc. of the 16th conference on Neural Information Processing Systems, 2002.
6. P. Poupart and C. Boutilier. Value-directed compression of pomdps. In Proc. of the 16th conference on Neural Information Processing Systems, 2002.
7. C. E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27, July and October 1948.
8. N. Slonim and Tishby N. The power of word clustering for text classification. In Proc. of the 23rd European Colloquium on Information Retrieval Research, 2001.
9. N. Slonim, R. Somerville, N. Tishby, and O. Lahav. Objective classification of galaxy spectra using the information bottleneck method. Monthly Notes of the Royal Astronomical Society, 323:270-284, 2001.
10. N. Slonim and N. Tishby. Document clustering using word clusters via the information bottleneck method. In Proc. of the 23rd Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, 2000.
11. N. Slonim. The Information Bottleneck: Theory and Applications. PhD thesis, The Hebrew University, 2002.
12. N. Tishby, F.C. Pereira, and W. Bialek. The information bottleneck method. In Proc. of the 37-th Annual Allerton Conference on Comunnication, Control and Computing, pages 368-377, 1999.
13. H. S. Witsenhausen and A.D. Wyner. A conditional entropy bound for a pair of discrete random variables. IEEE transaction on information theory, 21(5):493-501, September 1975.
14. A. D. Wyner. On source coding with side information at the decoder. IEEE transaction on information theory, 21(3):294-300, May 1975.