Search Results for author:
Found 61 papers, 33 papers with code
Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks
Modeling multivariate time series has long been a subject that has attracted researchers from a diverse range of fields including economics, finance, and traffic.
Ranked #1 on
Univariate Time Series Forecasting
on Electricity
Binarized Attributed Network Embedding
To this end, we present a Binarized Attributed Network Embedding model (BANE for short) to learn binary node representation.
Ranked #1 on
Link Prediction
on Wiki
FedProto: Federated Prototype Learning across Heterogeneous Clients
Heterogeneity across clients in federated learning (FL) usually hinders the optimization convergence and generalization performance when the aggregation of clients' knowledge occurs in the gradient space.
Graph WaveNet for Deep Spatial-Temporal Graph Modeling
Spatial-temporal graph modeling is an important task to analyze the spatial relations and temporal trends of components in a system.
Ranked #5 on
Traffic Prediction
on NE-BJ
Tensorized Self-Attention: Efficiently Modeling Pairwise and Global Dependencies Together
Neural networks equipped with self-attention have parallelizable computation, light-weight structure, and the ability to capture both long-range and local dependencies.
Reinforced Self-Attention Network: a Hybrid of Hard and Soft Attention for Sequence Modeling
In this paper, we integrate both soft and hard attention into one context fusion model, "reinforced self-attention (ReSA)", for the mutual benefit of each other.
Ranked #56 on
Natural Language Inference
on SNLI
DiSAN: Directional Self-Attention Network for RNN/CNN-Free Language Understanding
Recurrent neural nets (RNN) and convolutional neural nets (CNN) are widely used on NLP tasks to capture the long-term and local dependencies, respectively.
Ranked #68 on
Natural Language Inference
on SNLI
Adversarially Regularized Graph Autoencoder for Graph Embedding
Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics.
Ranked #5 on
Link Prediction
on Pubmed
Bi-Directional Block Self-Attention for Fast and Memory-Efficient Sequence Modeling
In this paper, we propose a model, called "bi-directional block self-attention network (Bi-BloSAN)", for RNN/CNN-free sequence encoding.
Attributed Graph Clustering: A Deep Attentional Embedding Approach
Graph clustering is a fundamental task which discovers communities or groups in networks.
Ranked #8 on
Node Clustering
on Cora
A Comprehensive Survey on Graph Neural Networks
In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields.
SINE: Scalable Incomplete Network Embedding
In this paper, we propose a Scalable Incomplete Network Embedding (SINE) algorithm for learning node representations from incomplete graphs.
Social and Information Networks
Prototype Propagation Networks (PPN) for Weakly-supervised Few-shot Learning on Category Graph
The resulting graph of prototypes can be continually re-used and updated for new tasks and classes.
Foundation Models for Weather and Climate Data Understanding: A Comprehensive Survey
Furthermore, in relation to the creation and application of foundation models for weather and climate data understanding, we delve into the field's prevailing challenges, offer crucial insights, and propose detailed avenues for future research.
Federated Learning on Non-IID Graphs via Structural Knowledge Sharing
Inspired by this, we propose FedStar, an FGL framework that extracts and shares the common underlying structure information for inter-graph federated learning tasks.
Multi-Center Federated Learning: Clients Clustering for Better Personalization
However, due to the diverse nature of user behaviors, assigning users' gradients to different global models (i. e., centers) can better capture the heterogeneity of data distributions across users.
Learning to Propagate for Graph Meta-Learning
It can significantly improve tasks that suffer from insufficient training data, e. g., few shot learning.
Multi-Center Federated Learning: Clients Clustering for Better Personalization
By comparison, a mixture of multiple global models could capture the heterogeneity across various clients if assigning the client to different global models (i. e., centers) in FL.
Attributed Network Embedding via Subspace Discovery
In this paper, we propose a unified framework for attributed network embedding-attri2vec-that learns node embeddings by discovering a latent node attribute subspace via a network structure guided transformation performed on the original attribute space.
Ranked #1 on
Node Clustering
on Facebook
Dual Personalization on Federated Recommendation
Moreover, we provide visualizations and in-depth analysis of the personalization techniques in item embedding, which shed novel insights on the design of recommender systems in federated settings.
On the Convergence of Clustered Federated Learning
Knowledge sharing and model personalization are essential components to tackle the non-IID challenge in federated learning (FL).
Many-Class Few-Shot Learning on Multi-Granularity Class Hierarchy
We study many-class few-shot (MCFS) problem in both supervised learning and meta-learning settings.
Deep Reinforcement Learning with Stacked Hierarchical Attention for Text-based Games
We study reinforcement learning (RL) for text-based games, which are interactive simulations in the context of natural language.
Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering
Second, the bandwidth of existing graph convolutional filters is fixed.
Improving Long-Tail Relation Extraction with Collaborating Relation-Augmented Attention
Then, facilitated by the proposed base model, we introduce collaborating relation features shared among relations in the hierarchies to promote the relation-augmenting process and balance the training data for long-tail relations.
Generalization in Text-based Games via Hierarchical Reinforcement Learning
Deep reinforcement learning provides a promising approach for text-based games in studying natural language communication between humans and artificial agents.
Hierarchical Reinforcement Learning
reinforcement-learning
+2
A Review for Weighted MinHash Algorithms
In this review, we mainly categorize the Weighted MinHash algorithms into quantization-based approaches, "active index"-based ones and others, and show the evolution and inherent connection of the weighted MinHash algorithms, from the integer weighted MinHash algorithms to real-valued weighted MinHash ones (particularly the Consistent Weighted Sampling scheme).
Data Structures and Algorithms
Improving the Robustness of Summarization Systems with Dual Augmentation
The other factor is in the latent space, where the attacked inputs bring more variations to the hidden states.
BiteNet: Bidirectional Temporal Encoder Network to Predict Medical Outcomes
Electronic health records (EHRs) are longitudinal records of a patient's interactions with healthcare systems.
Perceiving the World: Question-guided Reinforcement Learning for Text-based Games
Text-based games provide an interactive way to study natural language processing.
Improved Consistent Weighted Sampling Revisited
Min-Hash is a popular technique for efficiently estimating the Jaccard similarity of binary sets.
Data Structures and Algorithms
Network Representation Learning: A Survey
Network representation learning has been recently proposed as a new learning paradigm to embed network vertices into a low-dimensional vector space, by preserving network topology structure, vertex content, and other side information.
Deep Learning from Noisy Image Labels with Quality Embedding
However, the label noise among the datasets severely degenerates the \mbox{performance of deep} learning approaches.
Temporal Feature Selection on Networked Time Series
For example, social network users are considered to be social sensors that continuously generate social signals (tweets) represented as a time series.
Dynamic Concept Composition for Zero-Example Event Detection
In this paper, we focus on automatically detecting events in unconstrained videos without the use of any visual training exemplars.
Compound Rank-k Projections for Bilinear Analysis
In many real-world applications, data are represented by matrices or high-order tensors.
MetaGraph2Vec: Complex Semantic Path Augmented Heterogeneous Network Embedding
Network embedding in heterogeneous information networks (HINs) is a challenging task, due to complications of different node types and rich relationships between nodes.
Social and Information Networks
MahiNet: A Neural Network for Many-Class Few-Shot Learning with Class Hierarchy
It addresses the ``many-class'' problem by exploring the class hierarchy, e. g., the coarse-class label that covers a subset of fine classes, which helps to narrow down the candidates for the fine class and is cheaper to obtain.
Learning Graph Embedding with Adversarial Training Methods
Based on this framework, we derive two variants of adversarial models, the adversarially regularized graph autoencoder (ARGA) and its variational version, adversarially regularized variational graph autoencoder (ARVGA), to learn the graph embedding effectively.
Ranked #7 on
Node Clustering
on Cora
Search Efficient Binary Network Embedding
In this paper, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a binary code for each node, by simultaneously modeling node context relations and node attribute relations through a three-layer neural network.
Attribute Propagation Network for Graph Zero-shot Learning
To address this challenging task, most ZSL methods relate unseen test classes to seen(training) classes via a pre-defined set of attributes that can describe all classes in the same semantic space, so the knowledge learned on the training classes can be adapted to unseen classes.
Extract Local Inference Chains of Deep Neural Nets
In this paper, we introduce an efficient method, \name, to extract the local inference chains by optimizing a differentiable sparse scoring for the filters and layers to preserve the outputs on given data from a local region.
MASP: Model-Agnostic Sample Propagation for Few-shot learning
Few-shot learning aims to train a classifier given only a few samples per class that are highly insufficient to describe the whole data distribution.
RatE: Relation-Adaptive Translating Embedding for Knowledge Graph Completion
Many graph embedding approaches have been proposed for knowledge graph completion via link prediction.
Cooperative Heterogeneous Deep Reinforcement Learning
Numerous deep reinforcement learning agents have been proposed, and each of them has its strengths and flaws.
Towards Coarse and Fine-grained Multi-Graph Multi-Label Learning
Multi-graph multi-label learning (\textsc{Mgml}) is a supervised learning framework, which aims to learn a multi-label classifier from a set of labeled bags each containing a number of graphs.
Isometric Propagation Network for Generalized Zero-shot Learning
To resolve this problem, we propose Isometric Propagation Network (IPN), which learns to strengthen the relation between classes within each space and align the class dependency in the two spaces.
MIPO: Mutual Integration of Patient Journey and Medical Ontology for Healthcare Representation Learning
Hence, some recent works train healthcare representations by incorporating medical ontology, by self-supervised tasks like diagnosis prediction, but (1) the small-scale, monotonous ontology is insufficient for robust learning, and (2) critical contexts or dependencies underlying patient journeys are barely exploited to enhance ontology learning.
Federated Learning for Open Banking
In the near future, it is foreseeable to have decentralized data ownership in the finance sector using federated learning.
Vote for Nearest Neighbors Meta-Pruning of Self-Supervised Networks
Can we find a better initialization for a new task, e. g., a much smaller network closer to the final pruned model, by exploiting its similar tasks?
EAT-C: Environment-Adversarial sub-Task Curriculum for Efficient Reinforcement Learning
They are complementary in acquiring more informative feedback for RL: the planning policy provides dense reward of finishing easier sub-tasks while the environment policy modifies these sub-tasks to be adequately challenging and diverse so the RL agent can quickly adapt to different tasks/environments.
Goal Randomization for Playing Text-based Games without a Reward Function
In a variety of text-based games, we show that this simple method results in competitive performance for agents.
Uncertainty Regularized Policy Learning for Offline Reinforcement Learning
URPL adds an uncertainty regularization term in the policy learning objective to enforce to learn a more stable policy under the offline setting.
Diminishing Empirical Risk Minimization for Unsupervised Anomaly Detection
Empirically, DERM outperformed the state-of-the-art on the unsupervised AD benchmark consisting of 18 datasets.
Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Tasks
To address these challenges, we create a small model for a new task from the pruned models of similar tasks.
Does Continual Learning Equally Forget All Parameters?
In this paper, we study which modules in neural networks are more prone to forgetting by investigating their training dynamics during CL.
Causal Reinforcement Learning: A Survey
Causality, however, offers a notable advantage as it can formalize knowledge in a systematic manner and leverage invariance for effective knowledge transfer.
On-Device Recommender Systems: A Comprehensive Survey
Recently, driven by the advances in storage, communication, and computation capabilities of edge devices, there has been a shift of focus from CloudRSs to on-device recommender systems (DeviceRSs), which leverage the capabilities of edge devices to minimize centralized data storage requirements, reduce the response latency caused by communication overheads, and enhance user privacy and security by localizing data processing and model training.
Transductive Reward Inference on Graph
In this study, we present a transductive inference approach on that reward information propagation graph, which enables the effective estimation of rewards for unlabelled data in offline reinforcement learning.
Seeing Text in the Dark: Algorithm and Benchmark
Localizing text in low-light environments is challenging due to visual degradations.
What Hides behind Unfairness? Exploring Dynamics Fairness in Reinforcement Learning
In sequential decision-making problems involving sensitive attributes like race and gender, reinforcement learning (RL) agents must carefully consider long-term fairness while maximizing returns.
