GLoMo: Unsupervisedly Learned Relational Graphs as Transferable Representations
Modern deep transfer learning approaches have mainly focused on learning generic feature vectors from one task that are transferable to other tasks, such as word embeddings in language and pretrained convolutional features in vision. However, these approaches usually transfer unary features and largely ignore more structured graphical representations. This work explores the possibility of learning generic latent relational graphs that capture dependencies between pairs of data units (e.g., words or pixels) from large-scale unlabeled data and transferring the graphs to downstream tasks. Our proposed transfer learning framework improves performance on various tasks including question answering, natural language inference, sentiment analysis, and image classification. We also show that the learned graphs are generic enough to be transferred to different embeddings on which the graphs have not been trained (including GloVe embeddings, ELMo embeddings, and task-specific RNN hidden unit), or embedding-free units such as image pixels.
Code (1)
Tasks
image-classificationImage ClassificationNatural Language InferenceQuestion AnsweringSentiment AnalysisTransfer LearningWord EmbeddingsMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
GLoMo: Unsupervised Learning of Transferable Relational Graphs
Modern deep transfer learning approaches have mainly focused on learning generic feature vectors from one task that are transferable to other tasks, such as word embeddings in language and pretrained convolutional featur…
image-classificationImage ClassificationNatural Language InferenceQuestion Answering+3Knowledge Graph Reasoning with Relational Digraph
Reasoning on the knowledge graph (KG) aims to infer new facts from existing ones. Methods based on the relational path have shown strong, interpretable, and transferable reasoning ability. However, paths are naturally li…
Graph Neural NetworkWhy Relational Graphs Will Save the Next Generation of Vision Foundation Models?
Vision foundation models (FMs) have become the predominant architecture in computer vision, providing highly transferable representations learned from large-scale, multimodal corpora. Nonetheless, they exhibit persistent…
Human Activity RecognitionBrain Tumor SegmentationComputational EfficiencyRelational ReasoningPre-training Transformers for Knowledge Graph Completion
Learning transferable representation of knowledge graphs (KGs) is challenging due to the heterogeneous, multi-relational nature of graph structures. Inspired by Transformer-based pretrained language models' success on le…
Knowledge Graph CompletionKnowledge GraphsTHOR: Inductive Link Prediction over Hyper-Relational Knowledge Graphs
Knowledge graphs (KGs) have become a key ingredient supporting a variety of applications. Beyond the traditional triplet representation of facts where a relation connects two entities, modern KGs observe an increasing nu…
Inductive Link PredictionKnowledge Graphs