Grant: Discovery Grants Program - Individual
University of Guelph
$31,000.00
Multiagent uncertain reasoning and knowledge discovery with graphical models
FY 2008-09
Summary
Due to the scale and complexity of today's software and the reliability required, and due to the advance in computer network and reduction in processor cost, it has become both necessary and possible to solve a complex problem in a large domain by a set of cooperating computers, called agents. A common task of agents is to determine what is the state of their domain in order for them to act accordingly. I will study fundamental difference between alternative ways to perform such reasoning: tightly coupled, where agents exchange limited beliefs, and loosely coupled, where an agent treats everything from another agent as observations. Constructing such agents is challenging to software developers. I will investigate ways to automate some steps of construction, e.g., to enhance agent interfaces automatically for improved reasoning efficiency. One application area of such agents is collaborative design in supply chains. No existing method enables agents to construct an optimal design efficiently. Continuing my progress in the last period, I will analyze the conditions under which an optimal design can be efficiently computed by agents and develop such a method. The agent that I study is equipped with knowledge represented as a probabilistic graphical model. Learning such a model from data is one way to automate agent development. My research found that a class of models, called PI models, cannot be learned by commonly used methods. If an agent is equipped with an incorrectly learned model, it may make mistakes in carrying out its tasks. In order to learn such models effectively, a deep understanding is needed on how they are composed from independent parameters. Such understanding on some subclasses of PI models has been obtained in my last period of research. I will further investigate to achieve thorough understanding for the entire class of PI models. Once the composition of the entire spectrum of PI models is understood, a new generation of learning methods can be developed which will improve the reliability of the agents built from the learned models.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
155425-2006
Name nom
Xiang, Yang
Department département
Computing and Information Science
Organization id
24
Institution établissement
University of Guelph
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
31000
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
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Intelligence artificielle
Research subject en
Learning and inference theories
Research subject fr
Théories de l'apprentissage et l'inférence
Partie
3
Nb partie
5
Application title
Multiagent uncertain reasoning and knowledge discovery with graphical models
Keyword
NA
Application summary
Due to the scale and complexity of today's software and the reliability required, and due to the advance in computer network and reduction in processor cost, it has become both necessary and possible to solve a complex problem in a large domain by a set of cooperating computers, called agents. A common task of agents is to determine what is the state of their domain in order for them to act accordingly. I will study fundamental difference between alternative ways to perform such reasoning: tightly coupled, where agents exchange limited beliefs, and loosely coupled, where an agent treats everything from another agent as observations. Constructing such agents is challenging to software developers. I will investigate ways to automate some steps of construction, e.g., to enhance agent interfaces automatically for improved reasoning efficiency. One application area of such agents is collaborative design in supply chains. No existing method enables agents to construct an optimal design efficiently. Continuing my progress in the last period, I will analyze the conditions under which an optimal design can be efficiently computed by agents and develop such a method. The agent that I study is equipped with knowledge represented as a probabilistic graphical model. Learning such a model from data is one way to automate agent development. My research found that a class of models, called PI models, cannot be learned by commonly used methods. If an agent is equipped with an incorrectly learned model, it may make mistakes in carrying out its tasks. In order to learn such models effectively, a deep understanding is needed on how they are composed from independent parameters. Such understanding on some subclasses of PI models has been obtained in my last period of research. I will further investigate to achieve thorough understanding for the entire class of PI models. Once the composition of the entire spectrum of PI models is understood, a new generation of learning methods can be developed which will improve the reliability of the agents built from the learned models.