{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/inductive-learning/papers/2","list_of":"/task/inductive-learning","task":"Inductive Learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,153],"of":153,"counts":{"archive_papers_tagged":153,"with_a_code_link":66,"where_syntology_ran_a_sample":17,"not_listed_spam_title":0,"listed":153,"listed_where_code_ran":17,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":16,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":16,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/inductive-learning","prev":"/task/inductive-learning","next":null,"papers":[{"url":null,"slug":"task-adaptive-pseudo-labeling-for","title":"Task-Adaptive Pseudo Labeling for Transductive Meta-Learning","date":"2023-04-21","arxiv_id":"2304.11173","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-transformers-for-function-learning","title":"Beyond Transformers for Function Learning","date":"2023-04-19","arxiv_id":"2304.09979","repositories_listed":0,"syntology":null},{"url":null,"slug":"pubgraph-a-large-scale-scientific-temporal","title":"PubGraph: A Large-Scale Scientific Knowledge Graph","date":"2023-02-04","arxiv_id":"2302.02231","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-modulo-theories","title":"Learning Modulo Theories","date":"2023-01-26","arxiv_id":"2301.11435","repositories_listed":0,"syntology":null},{"url":null,"slug":"few-shot-inductive-learning-on-temporal","title":"Few-Shot Inductive Learning on Temporal Knowledge Graphs using Concept-Aware Information","date":"2022-11-15","arxiv_id":"2211.08169","repositories_listed":0,"syntology":null},{"url":null,"slug":"situating-recommender-systems-in-practice","title":"Situating Recommender Systems in Practice: Towards Inductive Learning and Incremental Updates","date":"2022-11-11","arxiv_id":"2211.06365","repositories_listed":0,"syntology":null},{"url":null,"slug":"gpnet-simplifying-graph-neural-networks-via","title":"GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials","date":"2022-09-30","arxiv_id":"2209.15454","repositories_listed":0,"syntology":null},{"url":null,"slug":"fold-tr-a-scalable-and-efficient-inductive","title":"FOLD-TR: A Scalable and Efficient Inductive Learning Algorithm for Learning To Rank","date":"2022-06-15","arxiv_id":"2206.07295","repositories_listed":0,"syntology":null},{"url":"/paper/clues-a-benchmark-for-learning-classifiers","slug":"clues-a-benchmark-for-learning-classifiers","title":"CLUES: A Benchmark for Learning Classifiers using Natural Language Explanations","date":"2022-04-14","arxiv_id":"2204.07142","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-worst-of-both-worlds-a-comparative","title":"The worst of both worlds: A comparative analysis of errors in learning from data in psychology and machine learning","date":"2022-03-12","arxiv_id":"2203.06498","repositories_listed":0,"syntology":null},{"url":null,"slug":"pathsage-spatial-graph-attention-neural","title":"PathSAGE: Spatial Graph Attention Neural Networks With Random Path Sampling","date":"2022-03-11","arxiv_id":"2203.05793","repositories_listed":0,"syntology":null},{"url":null,"slug":"fold-r-a-toolset-for-automated-inductive-1","title":"FOLD-R++: A Toolset for Automated Inductive Learning of Default Theories from Mixed Data","date":"2021-11-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-for-product-assortment","title":"Inductive learning for product assortment graph completion","date":"2021-10-04","arxiv_id":"2110.01677","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-temperature-in-graph-contrastive","title":"Rethinking Temperature in Graph Contrastive Learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clustering-and-demotion-based-algorithm-for","title":"A Clustering and Demotion Based Algorithm for Inductive Learning of Default Theories","date":"2021-09-26","arxiv_id":"2109.12624","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-neural-message-passing-for-inductive","title":"Adaptive Neural Message Passing for Inductive Learning on Hypergraphs","date":"2021-09-22","arxiv_id":"2109.10683","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-to-the-relational-inductive-bias-graph","title":"Power to the Relational Inductive Bias: Graph Neural Networks in Electrical Power Grids","date":"2021-09-08","arxiv_id":"2109.03604","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-modal-graph-learning-for-disease","title":"Multi-modal Graph Learning for Disease Prediction","date":"2021-07-01","arxiv_id":"2107.00206","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-topic-variational-graph-auto","title":"Inductive Topic Variational Graph Auto-Encoder for Text Classification","date":"2021-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"doc3-deep-one-class-classification-using","title":"DOC3-Deep One Class Classification using Contradictions","date":"2021-05-17","arxiv_id":"2105.07636","repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-bus-bunching-with-asynchronous-multi","title":"Reducing Bus Bunching with Asynchronous Multi-Agent Reinforcement Learning","date":"2021-05-02","arxiv_id":"2105.00376","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-inference-in-supervised","title":"Inductive Inference in Supervised Classification","date":"2021-03-18","arxiv_id":"2103.10549","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-collaborative-filtering-via","title":"Inductive Collaborative Filtering via Relation Graph Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gain-graph-attention-interaction-network-for","title":"GAIN: Graph Attention & Interaction Network for Inductive Semi-Supervised Learning over Large-scale Graphs","date":"2020-11-03","arxiv_id":"2011.01393","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-disease-self-diagnosis-with-inductive","title":"Online Disease Self-diagnosis with Inductive Heterogeneous Graph Convolutional Networks","date":"2020-09-06","arxiv_id":"2009.02625","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphcl-contrastive-self-supervised-learning","title":"GraphCL: Contrastive Self-Supervised Learning of Graph Representations","date":"2020-07-15","arxiv_id":"2007.08025","repositories_listed":0,"syntology":null},{"url":null,"slug":"dfraud3-multi-component-fraud-detection","title":"DFraud3- Multi-Component Fraud Detection freeof Cold-start","date":"2020-06-10","arxiv_id":"2006.05718","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphs-entities-and-step-mixture-1","title":"Graphs, Entities, and Step Mixture","date":"2020-05-18","arxiv_id":"2005.08485","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ilasp-system-for-inductive-learning-of","title":"The ILASP system for Inductive Learning of Answer Set Programs","date":"2020-05-02","arxiv_id":"2005.00904","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collective-learning-framework-to-boost-gnn","title":"A Collective Learning Framework to Boost GNN Expressiveness","date":"2020-03-26","arxiv_id":"2003.12169","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-flexible-framework-for-large-graph-learning","title":"An Uncoupled Training Architecture for Large Graph Learning","date":"2020-03-21","arxiv_id":"2003.09638","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-anchor-generation-to-distribution","title":"From Anchor Generation to Distribution Alignment: Learning a Discriminative Embedding Space for Zero-Shot Recognition","date":"2020-02-10","arxiv_id":"2002.03554","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-monotonic-logical-reasoning-guiding-deep","title":"Non-monotonic Logical Reasoning Guiding Deep Learning for Explainable Visual Question Answering","date":"2019-09-23","arxiv_id":"1909.10650","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-organized-inductive-reasoning-with-nemus","title":"Self-organized inductive reasoning with NeMuS","date":"2019-06-16","arxiv_id":"1906.06761","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-predicate-invention-using-shared","title":"Efficient predicate invention using shared \"NeMuS\"","date":"2019-06-15","arxiv_id":"1906.06455","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-strips-action-models-with-classical","title":"Learning STRIPS Action Models with Classical Planning","date":"2019-03-04","arxiv_id":"1903.01153","repositories_listed":0,"syntology":null},{"url":null,"slug":"coupled-analysis-dictionary-learning-to","title":"Coupled Analysis Dictionary Learning to inductively learn inversion: Application to real-time reconstruction of Biomedical signals","date":"2018-12-24","arxiv_id":"1812.09878","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-aspect-extraction-for-sentiment","title":"Cross-domain aspect extraction for sentiment analysis: a transductive learning approach","date":"2018-10-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-of-answer-set-programs","title":"Inductive Learning of Answer Set Programs from Noisy Examples","date":"2018-08-25","arxiv_id":"1808.08441","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-two-layer-modeling-with-parametric","title":"Inductive Two-Layer Modeling with Parametric Bregman Transfer","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-models-for-episodic-knowledge","title":"Embedding Models for Episodic Knowledge Graphs","date":"2018-06-30","arxiv_id":"1807.00228","repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-feature-generation-for-knowledge","title":"Recursive Feature Generation for Knowledge-based Learning","date":"2018-01-31","arxiv_id":"1802.00050","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-for-generalizing-graph-based","title":"A Framework for Generalizing Graph-based Representation Learning Methods","date":"2017-09-14","arxiv_id":"1709.04596","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-prediction-of-gene-regulatory","title":"Semi-Supervised Prediction of Gene Regulatory Networks Using Machine Learning Algorithms","date":"2016-08-11","arxiv_id":"1608.03530","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-supervised-quantum-learning","title":"Inductive supervised quantum learning","date":"2016-05-24","arxiv_id":"1605.07541","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-system-of-serial-computation-for-classified","title":"A system of serial computation for classified rules prediction in non-regular ontology trees","date":"2016-04-08","arxiv_id":"1604.02323","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-lower-bounds-for-realizable","title":"Minimax Lower Bounds for Realizable Transductive Classification","date":"2016-02-09","arxiv_id":"1602.03027","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-formal-synthesis-via-inductive","title":"A Theory of Formal Synthesis via Inductive Learning","date":"2015-05-15","arxiv_id":"1505.03953","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-learning-for-rule-generation-from","title":"Inductive Learning for Rule Generation from Ontology","date":"2015-02-17","arxiv_id":"1502.05021","repositories_listed":0,"syntology":null},{"url":null,"slug":"post-proceedings-of-the-first-international","title":"Post-Proceedings of the First International Workshop on Learning and Nonmonotonic Reasoning","date":"2013-11-19","arxiv_id":"1311.4639","repositories_listed":0,"syntology":null},{"url":null,"slug":"theory-based-inductive-learning-an","title":"Theory-Based Inductive Learning: An Integration of Symbolic and Quantitative Methods","date":"2013-03-27","arxiv_id":"1304.2738","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-boost-for-semi-supervised","title":"Regularized Boost for Semi-Supervised Learning","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-multiclass-learning-problems-via","title":"Solving Multiclass Learning Problems via Error-Correcting Output Codes","date":"1995-01-01","arxiv_id":"cs/9501101","repositories_listed":0,"syntology":null}],"record_sha256":"22f41dade83dbf4f035e95005c4475e0eec6912b72c4d498e5549170bf946152","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}