Search Results for author:
Found 32 papers, 15 papers with code
Enhancing Self-Attention with Knowledge-Assisted Attention Maps
Large-scale pre-trained language models have attracted extensive attentions in the research community and shown promising results on various tasks of natural language processing.
Aligning Multiple Knowledge Graphs in a Single Pass
Entity alignment (EA) is to identify equivalent entities across different knowledge graphs (KGs), which can help fuse these KGs into a more comprehensive one.
You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning
However, the noises and attacks may come from both structures and features in graphs, making the graph denoising a dilemma and challenging problem.
AdaGMLP: AdaBoosting GNN-to-MLP Knowledge Distillation
However, these methods face significant challenges in situations with insufficient training data and incomplete test data, limiting their applicability in real-world applications.
Deep Learning-Based Detection for Marker Codes over Insertion and Deletion Channels
In this paper, we propose two CSI-agnostic detecting algorithms for marker code based on deep learning.
NodeMixup: Tackling Under-Reaching for Graph Neural Networks
However, due to the uneven location distribution of labeled nodes in the graph, labeled nodes are only accessible to a small portion of unlabeled nodes, leading to the \emph{under-reaching} issue.
Self-Supervised Multi-Modal Sequential Recommendation
To address this issue, we propose a dual-tower retrieval architecture for sequence recommendation.
Pseudo Contrastive Learning for Graph-based Semi-supervised Learning
Pseudo Labeling is a technique used to improve the performance of semi-supervised Graph Neural Networks (GNNs) by generating additional pseudo-labels based on confident predictions.
Convolution-enhanced Evolving Attention Networks
To the best of our knowledge, this is the first work that explicitly models the layer-wise evolution of attention maps.
MMDialog: A Large-scale Multi-turn Dialogue Dataset Towards Multi-modal Open-domain Conversation
First, it is the largest multi-modal conversation dataset by the number of dialogues by 88x.
Ranked #2 on
Multimodal Intent Recognition
on MMDialog
Self-supervised Heterogeneous Graph Pre-training Based on Structural Clustering
The two modules can effectively utilize and enhance each other, promoting the model to learn discriminative embeddings.
Entropy Induced Pruning Framework for Convolutional Neural Networks
By leveraging the proposed AFIE, the proposed framework is able to yield a stable importance evaluation of each filter no matter whether the original model is trained fully.
Binary Classification with Positive Labeling Sources
Thus, in this work, we study the application of WS on binary classification tasks with positive labeling sources only.
Privacy-preserving Online AutoML for Domain-Specific Face Detection
Thanks to HyperFD, each local task (client) is able to effectively leverage the learning "experience" of previous tasks without uploading raw images to the platform; meanwhile, the meta-feature extractor is continuously learned to better trade off the bias and variance.
Learning Multi-granularity User Intent Unit for Session-based Recommendation
Specifically, we creatively propose Multi-granularity Intent Heterogeneous Session Graph which captures the interactions between different granularity intent units and relieves the burden of long-dependency.
SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks
In this paper, we conduct theoretical and experimental analysis to explore the fundamental causes of performance degradation in deep GCNs: over-smoothing and gradient vanishing have a mutually reinforcing effect that causes the performance to deteriorate more quickly in deep GCNs.
Multimodal Dialogue Response Generation
In such a low-resource setting, we devise a novel conversational agent, Divter, in order to isolate parameters that depend on multimodal dialogues from the entire generation model.
Creating Training Sets via Weak Indirect Supervision
Creating labeled training sets has become one of the major roadblocks in machine learning.
Graph Pointer Neural Networks
On the one hand, multi-hop-based approaches do not explicitly distinguish relevant nodes from a large number of multi-hop neighborhoods, leading to a severe over-smoothing problem.
WRENCH: A Comprehensive Benchmark for Weak Supervision
To address these problems, we introduce a benchmark platform, WRENCH, for thorough and standardized evaluation of WS approaches.
Attentive Knowledge-aware Graph Convolutional Networks with Collaborative Guidance for Personalized Recommendation
However, simply integrating KGs in current KG-based RS models is not necessarily a guarantee to improve the recommendation performance, which may even weaken the holistic model capability.
Click-Through Rate Prediction
Knowledge-Aware Recommendation
+1
Learning to Rank Ace Neural Architectures via Normalized Discounted Cumulative Gain
One of the key challenges in Neural Architecture Search (NAS) is to efficiently rank the performances of architectures.
Syntax-BERT: Improving Pre-trained Transformers with Syntax Trees
Pre-trained language models like BERT achieve superior performances in various NLP tasks without explicit consideration of syntactic information.
Evolving Attention with Residual Convolutions
In this paper, we propose a novel and generic mechanism based on evolving attention to improve the performance of transformers.
Predictive Attention Transformer: Improving Transformer with Attention Map Prediction
Instead, we model their dependencies via a chain of prediction models that take previous attention maps as input to predict the attention maps of a new layer through convolutional neural networks.
How Does Supernet Help in Neural Architecture Search?
Weight sharing, as an approach to speed up architecture performance estimation has received wide attention.
AutoADR: Automatic Model Design for Ad Relevance
We add the model designed by AutoADR as a sub-model into the production Ad Relevance model.
Interpretable and Efficient Heterogeneous Graph Convolutional Network
However, regarding Heterogeneous Information Network (HIN), existing HIN-oriented GCN methods still suffer from two deficiencies: (1) they cannot flexibly explore all possible meta-paths and extract the most useful ones for a target object, which hinders both effectiveness and interpretability; (2) they often need to generate intermediate meta-path based dense graphs, which leads to high computational complexity.
LadaBERT: Lightweight Adaptation of BERT through Hybrid Model Compression
BERT is a cutting-edge language representation model pre-trained by a large corpus, which achieves superior performances on various natural language understanding tasks.
Deeper Insights into Weight Sharing in Neural Architecture Search
With the success of deep neural networks, Neural Architecture Search (NAS) as a way of automatic model design has attracted wide attention.
TextNAS: A Neural Architecture Search Space tailored for Text Representation
Learning text representation is crucial for text classification and other language related tasks.
DeGNN: Characterizing and Improving Graph Neural Networks with Graph Decomposition
Despite the wide application of Graph Convolutional Network (GCN), one major limitation is that it does not benefit from the increasing depth and suffers from the oversmoothing problem.
