1 code implementation • 26 Oct 2024 • Theodore Glavas, Joud Chataoui, Florence Regol, Wassim Jabbour, Antonios Valkanas, Boris N. Oreshkin, Mark Coates
The vast size of Large Language Models (LLMs) has prompted a search to optimize inference.
no code implementations • 20 Jun 2024 • Florence Regol, Joud Chataoui, Bertrand Charpentier, Mark Coates, Pablo Piantanida, Stephan Gunnemann
Machine learning models can solve complex tasks but often require significant computational resources during inference.
1 code implementation • 26 Oct 2023 • Mai Zeng, Florence Regol, Mark Coates
Our model is composed of two diffusion processes, one for the time intervals and one for the event types.
1 code implementation • 13 Oct 2023 • Florence Regol, Joud Chataoui, Mark Coates
Training an EDNN architecture is challenging as it consists of two intertwined components: the gating mechanism (GM) that controls early-exiting decisions and the intermediate inference modules (IMs) that perform inference from intermediate representations.
1 code implementation • 8 Mar 2023 • Florence Regol, Mark Coates
Learning a categorical distribution comes with its own set of challenges.
no code implementations • 28 Oct 2022 • Florence Regol, Anja Kroon, Mark Coates
We validate our evaluation procedure with synthetic experiments on both synthetic generative models and current state-of-the-art categorical generative models.
no code implementations • 21 Sep 2022 • Yitian Zhang, Florence Regol, Antonios Valkanas, Mark Coates
We propose a framework called GraphTNC for unsupervised learning of joint representations of the graph and the time-series.
no code implementations • 4 Aug 2022 • Florence Regol, Soumyasundar Pal, Jianing Sun, Yingxue Zhang, Yanhui Geng, Mark Coates
In this work, we introduce the node copying model for constructing a distribution over graphs.
1 code implementation • 22 Feb 2022 • Soumyasundar Pal, Antonios Valkanas, Florence Regol, Mark Coates
Since a meaningful graph representing dependencies between bags is rarely available, we propose to use a Bayesian GNN framework that can generate a likely graph structure for scenarios where there is uncertainty in the graph or when no graph is available.
1 code implementation • Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining 2020 • Jianing Sun, Wei Guo, Dengcheng Zhang, Yingxue Zhang, Florence Regol, Yaochen Hu, Huifeng Guo, Ruiming Tang, Han Yuan, Xiuqiang He, Mark Coates
Because of the multitude of relationships existing in recommender systems, Graph Neural Networks (GNNs) based approaches have been proposed to better characterize the various relationships between a user and items while modeling a user's preferences.
no code implementations • 9 Jul 2020 • Florence Regol, Soumyasundar Pal, Mark Coates
With the increased interest in graph based machine learning techniques, there have been investigations which suggest that these models are also vulnerable to attacks.
no code implementations • ICML 2020 • Florence Regol, Soumyasundar Pal, Yingxue Zhang, Mark Coates
Node classification in attributed graphs is an important task in multiple practical settings, but it can often be difficult or expensive to obtain labels.
no code implementations • 23 Jun 2020 • Soumyasundar Pal, Saber Malekmohammadi, Florence Regol, Yingxue Zhang, Yishi Xu, Mark Coates
A Bayesian framework which targets posterior inference of the graph by considering it as a random quantity can be beneficial.
no code implementations • 8 Nov 2019 • Soumyasundar Pal, Florence Regol, Mark Coates
Graph convolutional neural networks (GCNN) have numerous applications in different graph based learning tasks.
no code implementations • 26 Oct 2019 • Soumyasundar Pal, Florence Regol, Mark Coates
Graph convolutional neural networks (GCNN) have been successfully applied to many different graph based learning tasks including node and graph classification, matrix completion, and learning of node embeddings.