Information theoretic ideas (entropy, mutual information and K-L
divergence) for solving problems of statistical inference will be
discussed: information geometry, maximum entropy methods, the
EM-algorithm & alternating minimization, Sanov's theorem &
large deviations, redundancy, MDL & other universal data
compression schemes. Khudanpur. 3 hours.
Instructor: Sanjeev Khudanpur
Office: Barton 206, 410-516-7024
email: khudanpur@jhu.edu