Grant: Discovery Grants Program - Individual
The University of British Columbia
$29,000.00
Understanding and Improving Deep Learning for Structured Data
EF 2024-25
Résumé
Deep learning has achieved tremendous success in processing data with regular structures like images (grids), languages (sequences), and speech (sequences). However, data with irregular structure (e.g., point clouds in computer vision, multi-agent interaction graphs in robotics, parsing trees in natural language processing, molecules in computational chemistry, protein structure in biology, and social networks in computational social science) is ubiquitous and poses challenges to current deep learning methods.
In this research program, we aim to understand the limitations of current deep learning models for structured data and improve them accordingly.
In the first part, we will study the out-of-distribution (OOD) generalization ability of graph neural networks (GNNs) and Transformers in the context of reasoning tasks. For example, in algorithmic reasoning tasks where we know correct algorithms exist, we will investigate if GNNs/Transformers can learn graph algorithms that generalize to OOD graph data. These studies would shed light on designing novel models with better inductive bias. Once we obtain conclusions from such well-defined tasks, we will move to more challenging and realistic reasoning problems, e.g., learning neural networks based solvers for NP-hard problems, visual reasoning tasks such as visual question answering and scene graph prediction, and motion planning for self-driving. This part would help improve deep learning models on reasoning tasks and improve their OOD generalization on structured data.
In the second part, we plan to design novel deep generative models for structured data. Given the superior performance of the recent deep generative models on images, it is appealing to generalize them to structured data like graphs. However, we need to overcome two main challenges: 1) building expressive and permutation-invariant probabilistic models for graphs; 2) designing customized sampling and learning algorithms for discrete random variables. Moreover, we plan to extend unconditional deep generative models to the conditional setting so that we can learn latent structures from data. Such models could describe the uncertainty and help improve the interpretability, which are crucial for real-world applications like point clouds generation in 3D compute vision and molecule generation for drug discovery.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2022-04636
Name nom
Liao, Renjie
Department département
Electrical and Computer Engineering
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2022
Award amount
29000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
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
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Understanding and Improving Deep Learning for Structured Data
Keywords
deep learning; graph neural networks; deep generative models; structured latent variable models; geometric deep learning; out-of-distribution generalization; neural algorithmic reasoning; computer vision; self-driving
Application summary
Deep learning has achieved tremendous success in processing data with regular structures like images (grids), languages (sequences), and speech (sequences). However, data with irregular structure (e.g., point clouds in computer vision, multi-agent interaction graphs in robotics, parsing trees in natural language processing, molecules in computational chemistry, protein structure in biology, and social networks in computational social science) is ubiquitous and poses challenges to current deep learning methods.
In this research program, we aim to understand the limitations of current deep learning models for structured data and improve them accordingly.
In the first part, we will study the out-of-distribution (OOD) generalization ability of graph neural networks (GNNs) and Transformers in the context of reasoning tasks. For example, in algorithmic reasoning tasks where we know correct algorithms exist, we will investigate if GNNs/Transformers can learn graph algorithms that generalize to OOD graph data. These studies would shed light on designing novel models with better inductive bias. Once we obtain conclusions from such well-defined tasks, we will move to more challenging and realistic reasoning problems, e.g., learning neural networks based solvers for NP-hard problems, visual reasoning tasks such as visual question answering and scene graph prediction, and motion planning for self-driving. This part would help improve deep learning models on reasoning tasks and improve their OOD generalization on structured data.
In the second part, we plan to design novel deep generative models for structured data. Given the superior performance of the recent deep generative models on images, it is appealing to generalize them to structured data like graphs. However, we need to overcome two main challenges: 1) building expressive and permutation-invariant probabilistic models for graphs; 2) designing customized sampling and learning algorithms for discrete random variables. Moreover, we plan to extend unconditional deep generative models to the conditional setting so that we can learn latent structures from data. Such models could describe the uncertainty and help improve the interpretability, which are crucial for real-world applications like point clouds generation in 3D compute vision and molecule generation for drug discovery.