{"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/papers/2","list_of":"/task/transductive-learning","task":"Transductive 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,135],"of":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":14,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":14,"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/transductive-learning","prev":"/task/transductive-learning","next":null,"papers":[{"url":null,"slug":"transductive-learning-with-string-kernels-for","title":"Transductive Learning with String Kernels for Cross-Domain Text Classification","date":"2018-11-02","arxiv_id":"1811.01734","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":"neural-transductive-learning-and-beyond","title":"Neural Transductive Learning and Beyond: Morphological Generation in the Minimal-Resource Setting","date":"2018-09-24","arxiv_id":"1809.08733","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-domain-adaptation-under-deep-label","title":"Deep Domain Adaptation under Deep Label Scarcity","date":"2018-09-20","arxiv_id":"1809.08097","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-semi-supervised-deep-learning","title":"Transductive Semi-Supervised Deep Learning using Min-Max Features","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-results-of-string-kernels-in","title":"Improving the results of string kernels in sentiment analysis and Arabic dialect identification by adapting them to your test set","date":"2018-08-25","arxiv_id":"1808.08409","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":"transductive-boltzmann-machines","title":"Transductive Boltzmann Machines","date":"2018-05-21","arxiv_id":"1805.07938","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-unbiased-embedding-for-zero-shot","title":"Transductive Unbiased Embedding for Zero-Shot Learning","date":"2018-03-30","arxiv_id":"1803.11320","repositories_listed":0,"syntology":null},{"url":null,"slug":"bootstrap-domain-specific-sentiment","title":"Bootstrap Domain-Specific Sentiment Classifiers from Unlabeled Corpora","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-non-linear-learning-for-chinese","title":"Transductive Non-linear Learning for Chinese Hypernym Prediction","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-transductive-learning-approaches","title":"Incremental Transductive Learning Approaches to Schistosomiasis Vector Classification","date":"2017-04-06","arxiv_id":"1704.01815","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-zero-shot-learning-with-a-self","title":"Transductive Zero-Shot Learning with a Self-training dictionary approach","date":"2017-03-27","arxiv_id":"1703.08893","repositories_listed":0,"syntology":null},{"url":null,"slug":"without-replacement-sampling-for-stochastic-1","title":"Without-Replacement Sampling for Stochastic Gradient Methods","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-semi-supervised-learning-over","title":"Scalable Semi-Supervised Learning over Networks using Nonsmooth Convex Optimization","date":"2016-11-02","arxiv_id":"1611.00714","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":"cross-graph-learning-of-multi-relational","title":"Cross-Graph Learning of Multi-Relational Associations","date":"2016-05-06","arxiv_id":"1605.01832","repositories_listed":0,"syntology":null},{"url":null,"slug":"without-replacement-sampling-for-stochastic","title":"Without-Replacement Sampling for Stochastic Gradient Methods: Convergence Results and Application to Distributed Optimization","date":"2016-03-02","arxiv_id":"1603.00570","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":"from-emotions-to-action-units-with-hidden-and","title":"From Emotions to Action Units With Hidden and Semi-Hidden-Task Learning","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dc-proximal-newton-for-non-convex","title":"DC Proximal Newton for Non-Convex Optimization Problems","date":"2015-07-02","arxiv_id":"1507.00438","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutational-rademacher-complexity-a-new","title":"Permutational Rademacher Complexity: a New Complexity Measure for Transductive Learning","date":"2015-05-12","arxiv_id":"1505.02910","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-multi-class-and-multi-label-zero","title":"Transductive Multi-class and Multi-label Zero-shot Learning","date":"2015-03-26","arxiv_id":"1503.07884","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-multi-label-zero-shot-learning","title":"Transductive Multi-label Zero-shot Learning","date":"2015-03-26","arxiv_id":"1503.07790","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-transductive-semi-supervised-maximum","title":"Deep Transductive Semi-supervised Maximum Margin Clustering","date":"2015-01-26","arxiv_id":"1501.06237","repositories_listed":0,"syntology":null},{"url":null,"slug":"localized-complexities-for-transductive","title":"Localized Complexities for Transductive Learning","date":"2014-11-26","arxiv_id":"1411.7200","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-for-multi-task-copula","title":"Transductive Learning for Multi-Task Copula Processes","date":"2014-06-02","arxiv_id":"1406.0304","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-translation-model-based-on-non","title":"Machine Translation Model based on Non-parallel Corpus and Semi-supervised Transductive Learning","date":"2014-05-22","arxiv_id":"1405.5654","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-learning-with-multi-class-volume","title":"Transductive Learning with Multi-class Volume Approximation","date":"2014-02-03","arxiv_id":"1402.0288","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-rademacher-complexity-and-its","title":"Transductive Rademacher Complexity and its Applications","date":"2014-01-15","arxiv_id":"1401.3441","repositories_listed":0,"syntology":null},{"url":null,"slug":"computationally-efficient-regression-on-a","title":"Computationally Efficient Regression on a Dependency Graph for Human Pose Estimation","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-transfer-machine-for-personalized","title":"Selective Transfer Machine for Personalized Facial Action Unit Detection","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"document-and-corpus-level-inference-for","title":"Document and Corpus Level Inference For Unsupervised and Transductive Learning of Information Structure of Scientific Documents","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relax-and-randomize-from-value-to-algorithms","title":"Relax and Randomize : From Value to Algorithms","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"entropic-graph-regularization-in-non","title":"Entropic Graph Regularization in Non-Parametric Semi-Supervised Classification","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"0d6ad915549c8c8f71d8562c82ec035f1a91fe0c8b9a32664f6a28a074d6b21a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}