Kaveh Hassani
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study the problem of few-shot graph classification across domains with nonequivalent feature spaces by introducing three new cross-domain benchmarks constructed from publicly available datasets. We also propose an attention-based graph encoder that uses three congruent views of graphs, one contextual and two topological views, to learn representations of task-specific information for fast adaptation, and task-agnostic information for knowledge transfer. We run exhaustive experiments to evaluate the performance of contrastive and meta-learning strategies. We show that when coupled with metric-based meta-learning frameworks, the proposed encoder achieves the best average meta-test classification accuracy across all benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.08265")
get_code_for_paper("2201.08265")
have("2201.08265")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.08265.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.08265)
Connect an agent — have() is free.