Searching parameter spaces by mapping likelihood

Add to your list(s) Download to your calendar using vCal

• Dr David Young, Department of Informatics, University of Sussex
• Wednesday 16 December 2009, 16:00-17:00
• UG40, School of Computer Science.

If you have a question about this talk, please contact Per Kristian Lehre.

Note unusual time

The efficient use of negative evidence in search problems has always been important: for example, string search algorithms such as Boyer-Moore make use of negative evidence to achieve greatly increased speed. However, it is not always clear how negative evidence can be exploited in a probabilistic framework. In this talk, I explore the accumulation of negative and positive statistical evidence by building a map of likelihood in parameter space, allowing a directed search of this space. I illustrate the approach with simple line detection and image matching examples, which emphasise the value of accurately modelling (or learning) image statistics. I discuss the conditions under which the method may be useful, and I propose that the correct framework for it is not a Bayesian one, but rather the likelihood method of A.W.F. Edwards.

This talk is part of the Artificial Intelligence and Natural Computation seminars series.

This talk is included in these lists:

• Artificial Intelligence and Natural Computation seminars
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• UG40, School of Computer Science
• computer sience

Note that ex-directory lists are not shown.