OLGA: One-cLass Graph Autoencoder
M. P. S. G\^olo, J. G. B. M. Junior, D. F. Silva, R. M. Marcacini

TL;DR
OLGA is an end-to-end graph autoencoder for one-class learning that improves node representation, encapsulates interest instances with a novel hypersphere loss, and offers interpretable low-dimensional embeddings, outperforming existing methods.
Contribution
OLGA introduces a new hypersphere loss for one-class graph learning, combining it with autoencoder reconstruction for improved, interpretable node representations.
Findings
Achieved state-of-the-art results on benchmark datasets.
Outperformed six other methods with statistical significance.
Produced low-dimensional, interpretable representations without sacrificing performance.
Abstract
One-class learning (OCL) comprises a set of techniques applied when real-world problems have a single class of interest. The usual procedure for OCL is learning a hypersphere that comprises instances of this class and, ideally, repels unseen instances from any other classes. Besides, several OCL algorithms for graphs have been proposed since graph representation learning has succeeded in various fields. These methods may use a two-step strategy, initially representing the graph and, in a second step, classifying its nodes. On the other hand, end-to-end methods learn the node representations while classifying the nodes in one learning process. We highlight three main gaps in the literature on OCL for graphs: (i) non-customized representations for OCL; (ii) the lack of constraints on hypersphere parameters learning; and (iii) the methods' lack of interpretability and visualization. We…
Peer Reviews
Decision·Submitted to ICLR 2024
1. The manuscript introduces a novel end-to-end method for one-class learning on graphs called OLGA, which combines a graph autoencoder and a hypersphere loss function. 2. The manuscript proposes a new hypersphere loss function that encourages the interest instances to approach the center of the hypersphere. 3. The manuscript evaluates OLGA on eight datasets from various domains and sources, and shows that it outperforms six other methods.
1. The motivation for using GAE is not well explained. Also, how simply introducing the graph autoencoder loss into one-class learning can help to solve the three gaps introduced in the abstract. A more detailed discussion should be added. 2. It is unclear how the function in Eq.5 is derived. 3. For the two reconstruction losses, A contains topology information of unlabeled nodes, setting a reconstruction loss on A^u could be repetitive and meaningless. The authors should give more explanation.
1.The author provides a statement about OCL. 2.The author identifies and discusses three issues in OCL.
1.In the introduction, the author claims, "Existing methods often assume high-dimensional latent spaces, which can hamper interpretability." However, this statement lacks a basis in terms of theoretical or experimental analysis. As a result, the subsequent experimental results do not provide evidence that high-dimensional features are significantly worse or even better than low-dimensional features, such as OCGAN, OCGAT, and OCSA. This raises doubts about the accuracy of the author's description
- One-class learning is a very fundamental problem for graph-related problems, and exploring one-class learning on graphs is a very interesting topic. - The paper is well-organized and easy to be understood.
- Adding a diagram in the introduction to illustrate the significance and importance of one-class learning on graphs would be beneficial. - The lack of innovation is a concern, as the author has primarily combined two conventional and commonly used loss functions. - I suggest the author provide detailed statistics about the dataset. - The authors could provide an anonymous GitHub link to ensure the reproducibility of the paper. - Due to the popularity of large language models, it is advisable fo
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
MethodsSparse Evolutionary Training
