Learning Graphs for Knowledge Transfer With Limited Labels
Fixed input graphs are a mainstay in approaches that utilize Graph Convolution Networks (GCNs) for knowledge transfer. The standard paradigm is to utilize relationships in the input graph to transfer information using GCNs from training to testing nodes in the graph; for example, the semi-supervised, zero-shot, and few-shot learning setups. We propose a generalized framework for learning and improving the input graph as part of the standard GCN-based learning setup. Moreover, we use additional constraints between similar and dissimilar neighbors for each node in the graph by applying triplet loss on the intermediate layer output. We present results of semi-supervised learning on Citeseer, Cora, and Pubmed benchmarking datasets, and zero/few-shot action recognition on UCF101 and HMDB51 datasets, significantly outperforming current approaches. We also present qualitative results visualizing the graph connections that our approach learns to update.
Code (0)
등록된 구현이 없습니다.
Tasks
Action RecognitionBenchmarkingFew-Shot action recognitionFew Shot Action RecognitionFew-Shot LearningTransfer LearningTripletMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structure
Graph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs, addressing the challenge of label scarcity. However, existing GDA methods typically assume that both source and tar…
GRAPH DOMAIN ADAPTATIONMulti-Label Transfer Learning in Non-Stationary Data Streams
Label concepts in multi-label data streams often experience drift in non-stationary environments, either independently or in relation to other labels. Transferring knowledge between related labels can accelerate adaptati…
Multi-Label ClassificationTransfer LearningPredicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network
Graphs consisting of vocal nodes ("the vocal minority") and silent nodes ("the silent majority"), namely VS-Graph, are ubiquitous in the real world. The vocal nodes tend to have abundant features and labels. In contrast,…
Graph Neural NetworkRepresentation LearningZero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer Networks
Data continuously emitted from industrial ecosystems such as social or e-commerce platforms are commonly represented as heterogeneous graphs (HG) composed of multiple node/edge types. State-of-the-art graph learning meth…
Domain AdaptationGraph LearningRepresentation LearningTransfer LearningFlyKD: Graph Knowledge Distillation on the Fly with Curriculum Learning
Knowledge Distillation (KD) aims to transfer a more capable teacher model's knowledge to a lighter student model in order to improve the efficiency of the model, making it faster and more deployable. However, the student…
Knowledge Distillation