{"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/transductive-learning","name":"Transductive Learning","slug":"transductive-learning","description_markdown":"In this setting, both a labeled training sample and an (unlabeled) test sample are provided at training time. The goal is to predict only the labels of the given test instances as accurately as possible.","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":135,"papers_with_code":41,"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":135,"of_with_code":41,"tagged_in_all":135,"counts":{"archive_papers_tagged":135,"with_a_code_link":41,"where_syntology_ran_a_sample":15,"not_listed_spam_title":0,"listed":135,"listed_where_code_ran":15,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":13,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":2,"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"},"items":[{"url":"/paper/geom-gcn-geometric-graph-convolutional-1","slug":"geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","arxiv_id":"2002.05287","repositories_listed":4,"syntology":{"n":7,"n_ran":7,"n_constructed":2,"n_ran_checked":3,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/geom-gcn-geometric-graph-convolutional-1#ran","syntology_url":"https://syntology.ai/paper/2002.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05287"}},"official":{"repos":["graphdml-uiuc-jlu/geom-gcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-supervised-domain-generalizable-person","slug":"semi-supervised-domain-generalizable-person","title":"Semi-Supervised Domain Generalizable Person Re-Identification","date":"2021-08-11","arxiv_id":"2108.05045","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/semi-supervised-domain-generalizable-person#ran","syntology_url":"https://syntology.ai/paper/2108.05045","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.05045"}},"official":{"repos":["JDAI-CV/fast-reid"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/distill-and-fine-tune-effective-adaptation","slug":"distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","arxiv_id":"2104.01539","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/distill-and-fine-tune-effective-adaptation#ran","syntology_url":"https://syntology.ai/paper/2104.01539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01539"}},"official":{"repos":["tim-learn/Dis-tune","tim-learn/dine"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mind-the-domain-gap-a-systematic-analysis-on","slug":"mind-the-domain-gap-a-systematic-analysis-on","title":"Mind the Domain Gap: a Systematic Analysis on Bioacoustic Sound Event Detection","date":"2024-03-27","arxiv_id":"2403.18638","repositories_listed":2,"syntology":null},{"url":"/paper/information-based-transductive-active","slug":"information-based-transductive-active","title":"Transductive Active Learning: Theory and Applications","date":"2024-02-13","arxiv_id":"2402.15898","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/information-based-transductive-active#ran","syntology_url":"https://syntology.ai/paper/2402.15898","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15898"}},"official":null}},{"url":"/paper/beyond-simple-meta-learning-multi-purpose","slug":"beyond-simple-meta-learning-multi-purpose","title":"Beyond Simple Meta-Learning: Multi-Purpose Models for Multi-Domain, Active and Continual Few-Shot Learning","date":"2022-01-13","arxiv_id":"2201.05151","repositories_listed":2,"syntology":null},{"url":"/paper/on-label-efficient-computer-vision-building","slug":"on-label-efficient-computer-vision-building","title":"On Label-Eﬀicient Computer Vision: Building Fast and Effective Few-Shot Image Classifiers","date":"2021-10-19","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/few-shot-novel-category-discovery","slug":"few-shot-novel-category-discovery","title":"Few-shot Novel Category Discovery","date":"2025-05-13","arxiv_id":"2505.08260","repositories_listed":1,"syntology":null},{"url":"/paper/towards-quantifying-long-range-interactions","slug":"towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","date":"2025-03-12","arxiv_id":"2503.09008","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-quantifying-long-range-interactions#ran","syntology_url":"https://syntology.ai/paper/2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"}},"official":{"repos":["leonresearch/city-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/accurate-and-scalable-graph-neural-networks","slug":"accurate-and-scalable-graph-neural-networks","title":"Accurate and Scalable Graph Neural Networks via Message Invariance","date":"2025-02-27","arxiv_id":"2502.19693","repositories_listed":1,"syntology":null},{"url":"/paper/single-view-graph-contrastive-learning-with","slug":"single-view-graph-contrastive-learning-with","title":"Single-View Graph Contrastive Learning with Soft Neighborhood Awareness","date":"2024-12-12","arxiv_id":"2412.09261","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/single-view-graph-contrastive-learning-with#ran","syntology_url":"https://syntology.ai/paper/2412.09261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09261"}},"official":{"repos":["sunisfighting/signa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predictive-insights-into-lgbtq-minority","slug":"predictive-insights-into-lgbtq-minority","title":"Predictive Insights into LGBTQ+ Minority Stress: A Transductive Exploration of Social Media Discourse","date":"2024-11-20","arxiv_id":"2411.13534","repositories_listed":1,"syntology":null},{"url":"/paper/umfc-unsupervised-multi-domain-feature","slug":"umfc-unsupervised-multi-domain-feature","title":"UMFC: Unsupervised Multi-Domain Feature Calibration for Vision-Language Models","date":"2024-11-11","arxiv_id":"2411.06921","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/umfc-unsupervised-multi-domain-feature#ran","syntology_url":"https://syntology.ai/paper/2411.06921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06921"}},"official":{"repos":["git-ljc/umfc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graphrouter-a-graph-based-router-for-llm","slug":"graphrouter-a-graph-based-router-for-llm","title":"GraphRouter: A Graph-based Router for LLM Selections","date":"2024-10-04","arxiv_id":"2410.03834","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphrouter-a-graph-based-router-for-llm#ran","syntology_url":"https://syntology.ai/paper/2410.03834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03834"}},"official":{"repos":["ulab-uiuc/graphrouter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/wav2graph-a-framework-for-supervised-learning","slug":"wav2graph-a-framework-for-supervised-learning","title":"wav2graph: A Framework for Supervised Learning Knowledge Graph from Speech","date":"2024-08-08","arxiv_id":"2408.04174","repositories_listed":1,"syntology":null},{"url":"/paper/transductive-active-learning-with-application","slug":"transductive-active-learning-with-application","title":"Transductive Active Learning with Application to Safe Bayesian Optimization","date":"2024-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/boosting-vision-language-models-with","slug":"boosting-vision-language-models-with","title":"Boosting Vision-Language Models with Transduction","date":"2024-06-03","arxiv_id":"2406.01837","repositories_listed":1,"syntology":null},{"url":"/paper/label-propagation-for-zero-shot","slug":"label-propagation-for-zero-shot","title":"Label Propagation for Zero-shot Classification with Vision-Language Models","date":"2024-04-05","arxiv_id":"2404.04072","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/label-propagation-for-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2404.04072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.04072"}},"official":{"repos":["vladan-stojnic/zlap"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/flowcyt-a-comparative-study-of-deep-learning","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/flowcyt-a-comparative-study-of-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2403.00024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00024"}},"official":{"repos":["LorenzoBini4/FlowCyt-Classification-Benchmark"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fast-online-node-labeling-for-very-large","slug":"fast-online-node-labeling-for-very-large","title":"Fast Online Node Labeling for Very Large Graphs","date":"2023-05-25","arxiv_id":"2305.16257","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fast-online-node-labeling-for-very-large#ran","syntology_url":"https://syntology.ai/paper/2305.16257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16257"}},"official":{"repos":["baojian/FastONL"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/distributed-representations-of-graphs-for","slug":"distributed-representations-of-graphs-for","title":"Distributed representations of graphs for drug pair scoring","date":"2022-09-19","arxiv_id":"2209.09383","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-bioacoustic-event-detection-at-the","slug":"few-shot-bioacoustic-event-detection-at-the","title":"Few-shot bioacoustic event detection at the DCASE 2022 challenge","date":"2022-07-14","arxiv_id":"2207.07911","repositories_listed":1,"syntology":null},{"url":"/paper/transboost-improving-the-best-imagenet","slug":"transboost-improving-the-best-imagenet","title":"TransBoost: Improving the Best ImageNet Performance using Deep Transduction","date":"2022-05-26","arxiv_id":"2205.13331","repositories_listed":1,"syntology":null},{"url":"/paper/view-consistent-heterogeneous-network-on","slug":"view-consistent-heterogeneous-network-on","title":"View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes","date":"2022-03-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparsity-aware-neural-user-behavior-modeling","slug":"sparsity-aware-neural-user-behavior-modeling","title":"Sparsity-aware neural user behavior modeling in online interaction platforms","date":"2022-02-28","arxiv_id":"2202.13491","repositories_listed":1,"syntology":null},{"url":"/paper/hgate-heterogeneous-graph-attention-auto","slug":"hgate-heterogeneous-graph-attention-auto","title":"HGATE: Heterogeneous Graph Attention Auto-Encoders","date":"2021-11-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-evaluating-the-robustness-of-neural-2","slug":"towards-evaluating-the-robustness-of-neural-2","title":"Towards Evaluating the Robustness of Neural Networks Learned by Transduction","date":"2021-10-27","arxiv_id":"2110.14735","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/towards-evaluating-the-robustness-of-neural-2#ran","syntology_url":"https://syntology.ai/paper/2110.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14735"}},"official":{"repos":["jfc43/eval-transductive-robustness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transductive-learning-for-unsupervised-text","slug":"transductive-learning-for-unsupervised-text","title":"Transductive Learning for Unsupervised Text Style Transfer","date":"2021-09-16","arxiv_id":"2109.07812","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transductive-learning-for-unsupervised-text#ran","syntology_url":"https://syntology.ai/paper/2109.07812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07812"}},"official":{"repos":["xiaofei05/tsst"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-inductive-and-transductive-learning-for","slug":"joint-inductive-and-transductive-learning-for","title":"Joint Inductive and Transductive Learning for Video Object Segmentation","date":"2021-08-08","arxiv_id":"2108.03679","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/joint-inductive-and-transductive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2108.03679","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03679"}},"official":{"repos":["maoyunyao/joint"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/bertgcn-transductive-text-classification-by","slug":"bertgcn-transductive-text-classification-by","title":"BertGCN: Transductive Text Classification by Combining GCN and BERT","date":"2021-05-12","arxiv_id":"2105.05727","repositories_listed":1,"syntology":null},{"url":"/paper/few-shot-classification-by-few-iteration-meta","slug":"few-shot-classification-by-few-iteration-meta","title":"Fast Few-Shot Classification by Few-Iteration Meta-Learning","date":"2020-10-01","arxiv_id":"2010.00511","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-and-generalization-analysis-of","slug":"optimization-and-generalization-analysis-of","title":"Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks","date":"2020-06-15","arxiv_id":"2006.08550","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-strategic-behavior-from-free-text","slug":"predicting-strategic-behavior-from-free-text","title":"Predicting Strategic Behavior from Free Text","date":"2020-04-06","arxiv_id":"2004.02973","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-propagation-smoother-manifold-for","slug":"embedding-propagation-smoother-manifold-for","title":"Embedding Propagation: Smoother Manifold for Few-Shot Classification","date":"2020-03-09","arxiv_id":"2003.04151","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/embedding-propagation-smoother-manifold-for#ran","syntology_url":"https://syntology.ai/paper/2003.04151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04151"}},"official":{"repos":["ElementAI/embedding-propagation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-unsupervised-inputs-for-accurate","slug":"exploiting-unsupervised-inputs-for-accurate","title":"Graph-based Interpolation of Feature Vectors for Accurate Few-Shot Classification","date":"2020-01-27","arxiv_id":"2001.09849","repositories_listed":1,"syntology":null},{"url":"/paper/deep-iterative-and-adaptive-learning-for","slug":"deep-iterative-and-adaptive-learning-for","title":"Deep Iterative and Adaptive Learning for Graph Neural Networks","date":"2019-12-17","arxiv_id":"1912.07832","repositories_listed":1,"syntology":null},{"url":"/paper/generating-accurate-pseudo-labels-via-hermite","slug":"generating-accurate-pseudo-labels-via-hermite","title":"Generating Accurate Pseudo-labels in Semi-Supervised Learning and Avoiding Overconfident Predictions via Hermite Polynomial Activations","date":"2019-09-12","arxiv_id":"1909.05479","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-learn-by-self-critique","slug":"learning-to-learn-by-self-critique","title":"Learning to learn via Self-Critique","date":"2019-05-24","arxiv_id":"1905.10295","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-learn-by-self-critique#ran","syntology_url":"https://syntology.ai/paper/1905.10295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10295"}},"official":null}},{"url":"/paper/label-propagation-for-deep-semi-supervised","slug":"label-propagation-for-deep-semi-supervised","title":"Label Propagation for Deep Semi-supervised Learning","date":"2019-04-09","arxiv_id":"1904.04717","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":15,"n_instrument":1,"n_unverified":2,"n_honours":3,"n_violates":2,"n_no_contract":10,"n_pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 3 honoured, 2 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/label-propagation-for-deep-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/1904.04717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.04717"}},"official":{"repos":["ahmetius/LP-DeepSSL"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/identifying-key-sentences-for-precision","slug":"identifying-key-sentences-for-precision","title":"Identifying Key Sentences for Precision Oncology Using Semi-Supervised Learning","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-tube-extraction-using","slug":"unsupervised-tube-extraction-using","title":"Unsupervised Tube Extraction Using Transductive Learning and Dense Trajectories","date":"2015-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"a-graph-in-graph-learning-framework-for-drug","title":"A Graph-in-Graph Learning Framework for Drug-Target Interaction Prediction","date":"2025-07-15","arxiv_id":"2507.11757","repositories_listed":0,"syntology":null},{"url":null,"slug":"generate-transduct-adapt-iterative","title":"Generate, Transduct, Adapt: Iterative Transduction with VLMs","date":"2025-01-10","arxiv_id":"2501.06031","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-exact-recovery-in-semi-supervised","title":"Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networks","date":"2024-12-18","arxiv_id":"2412.13754","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-for-compressibility-of-graph","title":"A Theory for Compressibility of Graph Transformers for Transductive Learning","date":"2024-11-20","arxiv_id":"2411.13028","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-near-duplicate","title":"Transductive Learning for Near-Duplicate Image Detection in Scanned Photo Collections","date":"2024-10-25","arxiv_id":"2410.19437","repositories_listed":0,"syntology":null},{"url":null,"slug":"vlsi-hypergraph-partitioning-with-deep","title":"VLSI Hypergraph Partitioning with Deep Learning","date":"2024-09-02","arxiv_id":"2409.01387","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-aware-consensus-network-on-graphs","title":"Structure-Aware Consensus Network on Graphs with Few Labeled Nodes","date":"2024-07-02","arxiv_id":"2407.02188","repositories_listed":0,"syntology":null},{"url":null,"slug":"anomaly-detection-of-tabular-data-using-llms","title":"Anomaly Detection of Tabular Data Using LLMs","date":"2024-06-24","arxiv_id":"2406.16308","repositories_listed":0,"syntology":null},{"url":null,"slug":"von-mises-quasi-processes-for-bayesian","title":"Bayesian Circular Regression with von Mises Quasi-Processes","date":"2024-06-19","arxiv_id":"2406.13151","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-benefits-and-risks-of-transductive","title":"The Benefits and Risks of Transductive Approaches for AI Fairness","date":"2024-06-17","arxiv_id":"2406.12011","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transductive-defense-a-two-stage","title":"Graph Transductive Defense: a Two-Stage Defense for Graph Membership Inference Attacks","date":"2024-06-12","arxiv_id":"2406.07917","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-transductive-learning-equivalent-to-pac","title":"Is Transductive Learning Equivalent to PAC Learning?","date":"2024-05-08","arxiv_id":"2405.05190","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-graph-representation-learning-using","title":"Hyperdimensional Representation Learning for Node Classification and Link Prediction","date":"2024-02-26","arxiv_id":"2402.17073","repositories_listed":0,"syntology":null},{"url":null,"slug":"learnability-is-a-compact-property","title":"Transductive Learning Is Compact","date":"2024-02-15","arxiv_id":"2402.10360","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-graph-contrastive-learning-for-node","title":"Low-Rank Graph Contrastive Learning for Node Classification","date":"2024-02-14","arxiv_id":"2402.09600","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-few-shot-fine-tuning","title":"Active Few-Shot Fine-Tuning","date":"2024-02-13","arxiv_id":"2402.15441","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-transductive-few-shot-learning-approach-for","title":"A transductive few-shot learning approach for classification of digital histopathological slides from liver cancer","date":"2023-11-29","arxiv_id":"2311.17740","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-joint-transductive-and-inductive","title":"Two-stage Joint Transductive and Inductive learning for Nuclei Segmentation","date":"2023-11-15","arxiv_id":"2311.08774","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-6","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","date":"2023-11-08","arxiv_id":"2311.04561","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-textual-few-shot","title":"Transductive Learning for Textual Few-Shot Classification in API-based Embedding Models","date":"2023-10-21","arxiv_id":"2310.13998","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-generalization-of-transductive-learning","title":"Sharp Generalization of Transductive Learning: A Transductive Local Rademacher Complexity Approach","date":"2023-09-28","arxiv_id":"2309.16858","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-and-optimal-multiclass","title":"Regularization and Optimal Multiclass Learning","date":"2023-09-24","arxiv_id":"2309.13692","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathcal-g-2pxy-generative-open-set-node","title":"$\\mathcal{G}^2Pxy$: Generative Open-Set Node Classification on Graphs with Proxy Unknowns","date":"2023-08-10","arxiv_id":"2308.05463","repositories_listed":0,"syntology":null},{"url":null,"slug":"2305-15016","title":"Estimating class separability of text embeddings with persistent homology","date":"2023-05-24","arxiv_id":"2305.15016","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-graph-neural-networks-for-moving","title":"Inductive Graph Neural Networks for Moving Object Segmentation","date":"2023-05-16","arxiv_id":"2305.09585","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-understanding-the-generalization-of-1","title":"Towards Understanding the Generalization of Graph Neural Networks","date":"2023-05-14","arxiv_id":"2305.08048","repositories_listed":0,"syntology":null},{"url":null,"slug":"med-vt-multiscale-encoder-decoder-video","title":"MED-VT++: Unifying Multimodal Learning with a Multiscale Encoder-Decoder Video Transformer","date":"2023-04-12","arxiv_id":"2304.05930","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-analysis-of-sequential-probability","title":"Smoothed Analysis of Sequential Probability Assignment","date":"2023-03-08","arxiv_id":"2303.04845","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":"a-simple-hypergraph-kernel-convolution-based","title":"A Simple Hypergraph Kernel Convolution based on Discounted Markov Diffusion Process","date":"2022-10-30","arxiv_id":"2210.16884","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-heterogeneous-graph-network-for","title":"Latent Heterogeneous Graph Network for Incomplete Multi-View Learning","date":"2022-08-29","arxiv_id":"2208.13669","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-coding-based-feature-generation","title":"Orthogonal-Coding-Based Feature Generation for Transductive Open-Set Recognition via Dual-Space Consistent Sampling","date":"2022-07-13","arxiv_id":"2207.05957","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-generalization-via-leave-one","title":"Understanding Generalization via Leave-One-Out Conditional Mutual Information","date":"2022-06-29","arxiv_id":"2206.14800","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-iterative-co-training-transductive","title":"An Iterative Co-Training Transductive Framework for Zero Shot Learning","date":"2022-03-30","arxiv_id":"2203.16041","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-training-a-survey","title":"Self-Training: A Survey","date":"2022-02-24","arxiv_id":"2202.12040","repositories_listed":0,"syntology":null},{"url":null,"slug":"oracle-efficient-online-learning-for-beyond","title":"Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries","date":"2022-02-17","arxiv_id":"2202.08549","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-abstractive-news-1","title":"Transductive Learning for Abstractive News Summarization","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-neural-vs-matrix-factorization","title":"Rethinking Neural vs. Matrix-Factorization Collaborative Filtering: the Theoretical Perspectives","date":"2021-10-23","arxiv_id":"2110.12141","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-lottery-ticket-learning-for-graph","title":"Inductive Lottery Ticket Learning for Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-image-segmentation-self-training","title":"Transductive image segmentation: Self-training and effect of uncertainty estimation","date":"2021-07-19","arxiv_id":"2107.08964","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-adversarial-robustness-via","title":"Towards Adversarial Robustness via Transductive Learning","date":"2021-06-15","arxiv_id":"2106.08387","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcnboost-artwork-classification-by-label","title":"GCNBoost: Artwork Classification by Label Propagation through a Knowledge Graph","date":"2021-05-25","arxiv_id":"2105.11852","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-pre-training-with-graph-neural","title":"Hypergraph Pre-training with Graph Neural Networks","date":"2021-05-23","arxiv_id":"2105.10862","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-abstractive-news","title":"Transductive Learning for Abstractive News Summarization","date":"2021-04-17","arxiv_id":"2104.09500","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniting-heterogeneity-inductiveness-and","title":"Uniting Heterogeneity, Inductiveness, and Efficiency for Graph Representation Learning","date":"2021-04-04","arxiv_id":"2104.01711","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-neural-networks-with-positive","title":"Learning Graph Neural Networks with Positive and Unlabeled Nodes","date":"2021-03-08","arxiv_id":"2103.04683","repositories_listed":0,"syntology":null},{"url":null,"slug":"tailoring-encoding-inductive-biases-by","title":"Tailoring: encoding inductive biases by optimizing unsupervised objectives at prediction time","date":"2020-09-22","arxiv_id":"2009.10623","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-collective-classification-against","title":"Robust Collective Classification against Structural Attacks","date":"2020-07-26","arxiv_id":"2007.13073","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-perturbations-learning-guarantees-with","title":"Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples","date":"2020-07-10","arxiv_id":"2007.05145","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-cross-domain-transfer-learning-for","title":"Automatic Organization of Neural Modules for Enhanced Collaboration in Neural Networks","date":"2020-05-08","arxiv_id":"2005.04088","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-masking-making-graph-neural-networks","title":"Node Masking: Making Graph Neural Networks Generalize and Scale Better","date":"2020-01-17","arxiv_id":"2001.07524","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-multi-output-learning-with-highly","title":"Robust Multi-Output Learning with Highly Incomplete Data via Restricted Boltzmann Machines","date":"2019-12-19","arxiv_id":"1912.09382","repositories_listed":0,"syntology":null},{"url":null,"slug":"polynomial-matrix-completion-for-missing-data","title":"Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning","date":"2019-12-15","arxiv_id":"1912.06989","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-of-neural-language","title":"Transductive Learning of Neural Language Models for Syntactic and Semantic Analysis","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-zero-shot-object","title":"Transductive Learning for Zero-Shot Object Detection","date":"2019-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"characterize-and-transfer-attention-in-graph","title":"Characterize and Transfer Attention in Graph Neural Networks","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"honem-network-embedding-using-higher-order","title":"HONEM: Learning Embedding for Higher Order Networks","date":"2019-08-15","arxiv_id":"1908.05387","repositories_listed":0,"syntology":null},{"url":"/paper/f-vaegan-d2-a-feature-generating-framework","slug":"f-vaegan-d2-a-feature-generating-framework","title":"f-VAEGAN-D2: A Feature Generating Framework for Any-Shot Learning","date":"2019-03-25","arxiv_id":"1903.10132","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-selection-with-feature-decay-algorithms","title":"Data Selection with Feature Decay Algorithms Using an Approximated Target Side","date":"2018-11-07","arxiv_id":"1811.03039","repositories_listed":0,"syntology":null}],"syntology_records":17,"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"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":15,"papers_where_code_ran_first_page":"/task/transductive-learning/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/transductive-learning/papers/2","json":"/task/transductive-learning/papers/2.json","rows":35},{"order":"ran","page":1,"of":1,"url":"/task/transductive-learning/papers/ran/1","json":"/task/transductive-learning/papers/ran/1.json","rows":15}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"7a1ec399b1a0b44e66d71d884e4bcf26c6ee961f0cabd36168405b91dfc97a8a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}