Search Results for author:
Found 9 papers, 5 papers with code
Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
This paper presents Grammar Reinforcement Learning (GRL), a reinforcement learning algorithm that uses Monte Carlo Tree Search (MCTS) and a transformer architecture that models a Pushdown Automaton (PDA) within a context-free grammar (CFG) framework.
Temporal receptive field in dynamic graph learning: A comprehensive analysis
Dynamic link prediction is a critical task in the analysis of evolving networks, with applications ranging from recommender systems to economic exchanges.
Dynamic Graph Representation Learning with Neural Networks: A Survey
In this research area, Dynamic Graph Neural Network (DGNN) has became the state of the art approach and plethora of models have been proposed in the very recent years.
Technical report: Graph Neural Networks go Grammatical
This paper introduces a framework for formally establishing a connection between a portion of an algebraic language and a Graph Neural Network (GNN).
Breaking the Limits of Message Passing Graph Neural Networks
Since the Message Passing (Graph) Neural Networks (MPNNs) have a linear complexity with respect to the number of nodes when applied to sparse graphs, they have been widely implemented and still raise a lot of interest even though their theoretical expressive power is limited to the first order Weisfeiler-Lehman test (1-WL).
Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective
Since the graph isomorphism problem is NP-intermediate, and Weisfeiler-Lehman (WL) test can give sufficient but not enough evidence in polynomial time, the theoretical power of GNNs is usually evaluated by the equivalence of WL-test order, followed by an empirical analysis of the models on some reference inductive and transductive datasets.
Neural Networks Regularization Through Class-wise Invariant Representation Learning
In this work, we tackle the issue of training neural networks for classification task when few training samples are available.
Graph edit distance : a new binary linear programming formulation
Moreover, a relaxation of the domain constraints in the formulations provides efficient lower bound approximations of the GED.
Deep Neural Networks Regularization for Structured Output Prediction
The motivation of this work is to learn the output dependencies that may lie in the output data in order to improve the prediction accuracy.
