Search Results for author:
Found 11 papers, 1 papers with code
Spectral Augmentation for Self-Supervised Learning on Graphs
Graph contrastive learning (GCL), as an emerging self-supervised learning technique on graphs, aims to learn representations via instance discrimination.
FusionRetro: Molecule Representation Fusion via Reaction Graph for Retrosynthetic Planning
Comprehensive experiments show that by fusing in context information over routes, our model significantly improves the performance of retrosynthetic planning over baselines that are not context-aware, especially for long synthetic routes.
How Powerful is Implicit Denoising in Graph Neural Networks
However, the analysis of implicit denoising effect in graph neural networks remains open.
A Correlation-Ratio Transfer Learning and Variational Stein's Paradox
A basic condition for efficient transfer learning is the similarity between a target model and source models.
Communication-Efficient Adaptive Federated Learning
We show that in the nonconvex stochastic optimization setting, our proposed FedCAMS achieves the same convergence rate of $O(\frac{1}{\sqrt{TKm}})$ as its non-compressed counterparts.
Communication-Compressed Adaptive Gradient Method for Distributed Nonconvex Optimization
We prove that the proposed communication-efficient distributed adaptive gradient method converges to the first-order stationary point with the same iteration complexity as uncompressed vanilla AMSGrad in the stochastic nonconvex optimization setting.
Graph Structural Attack by Perturbing Spectral Distance
Graph Convolutional Networks (GCNs) have fueled a surge of research interest due to their encouraging performance on graph learning tasks, but they are also shown vulnerability to adversarial attacks.
Graph Embedding with Hierarchical Attentive Membership
The exploitation of graph structures is the key to effectively learning representations of nodes that preserve useful information in graphs.
Unbiased Graph Embedding with Biased Graph Observations
In this paper, we propose a principled new way for unbiased graph embedding by learning node embeddings from an underlying bias-free graph, which is not influenced by sensitive node attributes.
A General Framework of Online Updating Variable Selection for Generalized Linear Models with Streaming Datasets
The paper presents a general framework for online updating variable selection and parameter estimation in generalized linear models with streaming datasets.
Variable Selection
Methodology
JNET: Learning User Representations via Joint Network Embedding and Topic Embedding
Inspired by the concept of user schema in social psychology, we take a new perspective to perform user representation learning by constructing a shared latent space to capture the dependency among different modalities of user-generated data.
