Royal Bank of Canada

Seyed Mehran Kazemi

Layla El Asri

Jaspreet Sahota

Janahan Mathuran Ramanan

Bahare Fatemi

Rishab Goel

Sepehr Eghbali

A graph structure having nodes and edges is represented as an adjacency matrix, and nodes of the graph structure have node features. A computer-implemented method and system for generating a graph structure are provided, the method comprising: generating an adjacency matrix based on a plurality of node features; generating a plurality of noisy node features based on the plurality of node features; generating a plurality of denoised node features using a neural network based on the plurality of noisy node features and the adjacency matrix; and updating the adjacency matrix based on the plurality of denoised node features.

System and method for structure learning for graph neural networks

Described in various embodiments herein is a technical solution directed to decomposition of time as an input for machine learning, and various related mechanisms and data structures. In particular, specific machines, computer-readable media, computer processes, and methods are described that are utilized to improve machine learning outcomes, including, improving accuracy, convergence speed (e.g., reduced epochs for training), and reduced overall computational resource requirements. A vector representation of continuous time containing a periodic function with frequency and phase-shift learnable parameters is used to decompose time into output dimensions for improved tracking of periodic behavior of a feature. The vector representation is used to modify time inputs in machine learning architectures.

System and method for time-dependent machine learning architecture

Systems and methods for expanding a multi-relational data structure tunable for generating a non-linear dataset from a time-dependent query. The systems include a processor and a memory. The memory may store processor-executable instructions that, when executed, configure the processor to: receive the query of the multi-relational data structure, wherein the query includes at least one entity node at a queried time relative to the time data; obtain, based on the query, a temporal representation vector based on a diachronic embedding of the multi-relational data structure, the diachronic embedding based on a combination of a first sub-function associated with a temporal feature and a second sub-function associated with a persistent feature; determine, from the temporal representation vector, at least one time-varied score corresponding to the queried time; and generate a response dataset based on the at least one time-varied score determined from the temporal representation vector.

Growing community of inventors

Toronto, Canada

Seyed Mehran Kazemi