paper-with-me

Papers

Learning Graphs for Knowledge Transfer With Limited Labels

2021-06-19 · CVPR 2021 1 · Pallabi Ghosh, Nirat Saini, Larry S. Davis, Abhinav Shrivastava

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.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Action RecognitionBenchmarkingFew-Shot action recognitionFew Shot Action RecognitionFew-Shot LearningTransfer LearningTriplet

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Triplet Loss The goal of Triplet loss, in the context of Siamese Networks, is to maximize the joint probability among all score-pairs i.e. the product of all probabilities. By using its…

Similar Papers 제목 키워드 기반

Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structure

2026-02-07 · Ruiyi Fang, Shuo Wang, Ruizhi Pu, Qiuhao Zeng 외 arxiv

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 ADAPTATION

Multi-Label Transfer Learning in Non-Stationary Data Streams

2025-09-09 · Honghui Du, Leandro Minku, Aonghus Lawlor, Huiyu Zhou arxiv

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 Learning

Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network

2023-02-02 · Wendong Bi, Bingbing Xu, Xiaoqian Sun, Li Xu 외

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 Learning

Zero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer Networks

2022-03-03 · Minji Yoon, John Palowitch, Dustin Zelle, Ziniu Hu 외

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 Learning

FlyKD: Graph Knowledge Distillation on the Fly with Curriculum Learning

2024-03-16 · Eugene Ku

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