Skip to content

SCS

Seminar

Probability Estimation over Large Alphabets

Orlitsky, A (UC, San Diego)
Friday 15 January 2010, 09:30-10:30

Seminar Room 1, Newton Institute

Abstract

Many applications require estimating distributions over large alphabets based on a small data sample. We outline the problem's history, theory, and applications, and describe recent constructions of asymptotically optimal estimators. The talk is self contained and based on work with P. Santhanam, K. Viswanathan, J. Zhang, and others.

Video

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧