{"url":"/task/inductive-learning","name":"Inductive Learning","slug":"inductive-learning","description_markdown":null,"categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":153,"papers_with_code":66,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":66,"tagged_in_all":153,"items":[{"url":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","arxiv_id":"1809.10341","repositories_listed":11,"syntology":{"n":35,"n_ran":24,"n_unverified":11,"n_pointer_only":9}},{"url":"/paper/graphsaint-graph-sampling-based-inductive","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","date":"2019-07-10","arxiv_id":"1907.04931","repositories_listed":8,"syntology":null},{"url":"/paper/190501669","title":"Representation Learning for Attributed Multiplex Heterogeneous Network","date":"2019-05-05","arxiv_id":"1905.01669","repositories_listed":4,"syntology":{"n":6,"n_ran":0,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/deep-graph-contrastive-representation","title":"Deep Graph Contrastive Representation Learning","date":"2020-06-07","arxiv_id":"2006.04131","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/chronosymbolic-learning-efficient-chc-solving","title":"Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning","date":"2023-05-02","arxiv_id":"2305.01206","repositories_listed":2,"syntology":null},{"url":"/paper/increase-inductive-graph-representation","title":"INCREASE: Inductive Graph Representation Learning for Spatio-Temporal Kriging","date":"2023-02-06","arxiv_id":"2302.02738","repositories_listed":2,"syntology":{"n":13,"n_ran":0,"n_unverified":13,"n_pointer_only":0}},{"url":"/paper/fold-rm-a-scalable-and-efficient-inductive","title":"FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data","date":"2022-02-14","arxiv_id":"2202.06913","repositories_listed":2,"syntology":null},{"url":"/paper/knowledge-preserving-incremental-social-event","title":"Knowledge-Preserving Incremental Social Event Detection via Heterogeneous GNNs","date":"2021-01-21","arxiv_id":"2101.08747","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/gtea-representation-learning-for-temporal","title":"GTEA: Inductive Representation Learning on Temporal Interaction Graphs via Temporal Edge Aggregation","date":"2020-09-11","arxiv_id":"2009.05266","repositories_listed":2,"syntology":null},{"url":"/paper/iterative-deep-graph-learning-for-graph-1","title":"Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings","date":"2020-06-21","arxiv_id":"2006.13009","repositories_listed":2,"syntology":{"n":14,"n_ran":3,"n_unverified":11,"n_pointer_only":0}},{"url":"/paper/is-deep-learning-necessary-for-simple","title":"Is deep learning necessary for simple classification tasks?","date":"2020-06-11","arxiv_id":"2006.06730","repositories_listed":2,"syntology":null},{"url":"/paper/deep-hyperedges-a-framework-for-transductive","title":"Deep Hyperedges: a Framework for Transductive and Inductive Learning on Hypergraphs","date":"2019-10-07","arxiv_id":"1910.02633","repositories_listed":2,"syntology":null},{"url":"/paper/neural-logic-machines-1","title":"Neural Logic Machines","date":"2019-04-26","arxiv_id":"1904.11694","repositories_listed":2,"syntology":{"n":7,"n_ran":0,"n_unverified":7,"n_pointer_only":0}},{"url":"/paper/learning-role-based-graph-embeddings","title":"Learning Role-based Graph Embeddings","date":"2018-02-07","arxiv_id":"1802.02896","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-learning-of-robot-task-knowledge","title":"Inductive Learning of Robot Task Knowledge from Raw Data and Online Expert Feedback","date":"2025-01-13","arxiv_id":"2501.07507","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-modelling-breast","title":"Graph Neural Networks for modelling breast biomechanical compression","date":"2024-11-10","arxiv_id":"2411.06596","repositories_listed":1,"syntology":null},{"url":"/paper/a-surprisingly-simple-approach-to-generalized","title":"A Surprisingly Simple Approach to Generalized Few-Shot Semantic Segmentation","date":"2024-09-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-representation-learning","title":"Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding","date":"2024-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/solving-the-tree-containment-problem-using","title":"Solving the Tree Containment Problem Using Graph Neural Networks","date":"2024-04-15","arxiv_id":"2404.09812","repositories_listed":1,"syntology":null},{"url":"/paper/flowcyt-a-comparative-study-of-deep-learning","title":"FlowCyt: A Comparative Study of Deep Learning Approaches for Multi-Class Classification in Flow Cytometry Benchmarking","date":"2024-02-28","arxiv_id":"2403.00024","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/identifiable-cognitive-diagnosis-with-encoder","title":"Towards the Identifiability and Explainability for Personalized Learner Modeling: An Inductive Paradigm","date":"2023-09-01","arxiv_id":"2309.00300","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-solve-constraint-satisfaction","title":"Learning to Solve Constraint Satisfaction Problems with Recurrent Transformer","date":"2023-07-10","arxiv_id":"2307.04895","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/ingram-inductive-knowledge-graph-embedding","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","date":"2023-05-31","arxiv_id":"2305.19987","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":3}},{"url":"/paper/improving-few-shot-inductive-learning-on","title":"Improving Few-Shot Inductive Learning on Temporal Knowledge Graphs using Confidence-Augmented Reinforcement Learning","date":"2023-04-02","arxiv_id":"2304.00613","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-fly-category-discovery","title":"On-the-Fly Category Discovery","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-better-for-video-object","title":"Learning to Learn Better for Video Object Segmentation","date":"2022-12-05","arxiv_id":"2212.02112","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-free-prediction-sets-for-node","title":"Distribution Free Prediction Sets for Node Classification","date":"2022-11-26","arxiv_id":"2211.14555","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-large-language-models-learn-beyond","title":"What do Large Language Models Learn beyond Language?","date":"2022-10-21","arxiv_id":"2210.12302","repositories_listed":1,"syntology":null},{"url":"/paper/facing-changes-continual-entity-alignment-for","title":"Facing Changes: Continual Entity Alignment for Growing Knowledge Graphs","date":"2022-07-23","arxiv_id":"2207.11436","repositories_listed":1,"syntology":null},{"url":"/paper/video-capsule-endoscopy-classification-using","title":"Video Capsule Endoscopy Classification using Focal Modulation Guided Convolutional Neural Network","date":"2022-06-16","arxiv_id":"2206.08298","repositories_listed":1,"syntology":null}],"syntology_records":10,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}