Randomized Schur Complement Views for Graph Contrastive Learning
We introduce a randomized topological augmentor based on Schur complements for Graph Contrastive Learning (GCL). Given a graph laplacian matrix, the technique generates unbiased approximations of its Schur complements and treats the corresponding graphs as augmented views. We discuss the benefits of our approach, provide theoretical justifications and present connections with graph diffusion. Unlike previous efforts, we study the empirical effectiveness of the augmentor in a controlled fashion by varying the design choices for subsequent GCL phases, such as encoding and contrasting. Extensive experiments on node and graph classification benchmarks demonstrate that our technique consistently outperforms pre-defined and adaptive augmentation approaches to achieve state-of-the-art results.
Code (1)
Tasks
Contrastive LearningGraph ClassificationNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Faster Graph Embeddings via Coarsening
Graph embeddings are a ubiquitous tool for machine learning tasks, such as node classification and link prediction, on graph-structured data. However, computing the embeddings for large-scale graphs is prohibitively inef…
Link PredictionNode ClassificationHierarchical Minimum Variance Portfolios: A Theoretical and Algorithmic Approach
We introduce a novel approach to portfolio optimization that leverages hierarchical graph structures and the Schur complement method to systematically reduce computational complexity while preserving full covariance info…
Portfolio OptimizationSchurVINS: Schur Complement-Based Lightweight Visual Inertial Navigation System
Accuracy and computational efficiency are the most important metrics to Visual Inertial Navigation System (VINS). The existing VINS algorithms with either high accuracy or low computational complexity, are difficult to p…
Computational EfficiencyOptimization-Free Topological Sort for Causal Discovery via the Schur Complement of Score Jacobians
Continuous causal discovery typically couples representation learning with structural optimization via non-convex acyclicity penalties, which subjects solvers to local optima and restricts scalability in high-dimensional…
Representation LearningA Family of Kernelized Matrix Costs for Multiple-Output Mixture Neural Networks
Pairwise distance-based costs are crucial for self-supervised and contrastive feature learning. Mixture Density Networks (MDNs) are a widely used approach for generative models and density approximation, using neural net…