Grant: Discovery Grants Program - Individual
University of Alberta
$34,000.00
Machine learning and heuristic search
EF 2009-10
Résumé
My research aims to develop scientific understanding and improved algorithms in the areas of machine learning, and heuristic search, and to explore practical applications of techniques in these areas.
A machine learning algorithm uses training data, or past experience, to improve its performance at a specific task. In my research the task is playing poker against a single opponent, and machine learning will be used to identify the opponent's strengths and weaknesses and adapt its play accordingly in order to maximize its winnings against this specific opponent. This is very challenging because learning must be very rapid (only 100-200 hands will be played against this opponent in total), and the information available to the learning algorithm is noisy and incomplete.
A heuristic search algorithm is a fast method for finding optimal paths between two nodes in a graph. For example, if the graph is a road map, a heuristic search algorithm could be used to quickly find the shortest route from your current location to a particular destination. Heuristic search is faster than standard methods because it uses an estimate of the distance to the goal, called a heuristic function. My research investigates various ways of speeding up heuristic search. One of the methods I am investigating is to decompose the heuristic function into the sum of a set of smaller heuristic functions. My aim is to understand when this is possible, and when it is superior to other methods. I am also investigating techniques for predicting how much speedup will be produced by a given heuristic function.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
46246-2007
Name nom
Holte, Robert
Department département
Computing Science
Organization id
9
Institution établissement
University of Alberta
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2009
Competition year année de concours
2007
Award amount
34000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2800
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Artificial intelligence (computer vision, use2603)
Research subject fr
Intelligence artificielle (vision artificielle, utiliser 2603)
Partie
3
Nb partie
5
Application title
Machine learning and heuristic search
Keyword
NA
Application summary
My research aims to develop scientific understanding and improved algorithms in the areas of machine learning, and heuristic search, and to explore practical applications of techniques in these areas.
A machine learning algorithm uses training data, or past experience, to improve its performance at a specific task. In my research the task is playing poker against a single opponent, and machine learning will be used to identify the opponent's strengths and weaknesses and adapt its play accordingly in order to maximize its winnings against this specific opponent. This is very challenging because learning must be very rapid (only 100-200 hands will be played against this opponent in total), and the information available to the learning algorithm is noisy and incomplete.
A heuristic search algorithm is a fast method for finding optimal paths between two nodes in a graph. For example, if the graph is a road map, a heuristic search algorithm could be used to quickly find the shortest route from your current location to a particular destination. Heuristic search is faster than standard methods because it uses an estimate of the distance to the goal, called a heuristic function. My research investigates various ways of speeding up heuristic search. One of the methods I am investigating is to decompose the heuristic function into the sum of a set of smaller heuristic functions. My aim is to understand when this is possible, and when it is superior to other methods. I am also investigating techniques for predicting how much speedup will be produced by a given heuristic function.