December 31, Thursday
13:00 – 14:00
Probability Estimation over Large Alphabets
Computer Science seminar
Lecturer : Prof. Alon Orlitsky
Affiliation : University of California, San Diego, ECE & CSE
Location : 202/37
Host : Prof. Shlomi Dolev
Many applications call for estimating probabiities of rare,
even previously unseen, events. We briefly describe the problem's
theory, applications to classification and data compression,
relation to works by Fisher, Shakespeare, Laplace, Good, Turing,
Hardy, Ramanujan, and Shannon, and recent constructions of
asymptotically optimal estimators. The talk is self contained and
based on work with P. Santhanam, K. Viswanathan, J. Zhang, and others.