Return
Pre-image free graph machine learning with Normalizing Flows
DOI:10.1016/j.patrec.2025.02.005.png)
Abstract
En 中文
Nonlinear embeddings are central in machine learning (ML). However, they often suffer from insufficient interpretability, due to the restricted access to the latent space. To improve interpretability, elements of the latent space need to be represented in the input space. The process of finding such inverse transformation is known as the pre-image problem. This challenging task is especially difficult when dealing with complex and discrete data represented by graphs. In this paper, we propose a framework aimed at defining ML models that do not suffer from the pre-image problem. This framework is based on Normalizing Flows (NF), generating the latent space by learning both forward and inverse transformations. From this framework, we propose two specifications to design models working on predictive contexts, namely classification and regression. Asa result, our approaches are able to obtain good predictive performances and to generate the pre-image of any element in the latent space. Our experimental results highlight the predictive capabilities and the proficiency in generating graph pre-images, thereby emphasizing the versatility and effectiveness of our approaches for graph machine learning.
Keywords:
Graph Normalizing Flow
Pre-image problem
Regression
Classification
Interpretability
Nonlinear embedding
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W

