{"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/classification/papers/7","list_of":"/task/classification","task":"General Classification","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":7,"pages_in_order":146,"rows_per_page":100,"rows":[601,700],"of":14581,"counts":{"archive_papers_tagged":14581,"with_a_code_link":3945,"where_syntology_ran_a_sample":713,"not_listed_spam_title":0,"listed":14581,"listed_where_code_ran":713,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":560,"every_run_a_failure_of_syntologys_instrument":153,"listed_with_a_run_with_no_instrument_failure":560,"listed_every_run_a_failure_of_syntologys_instrument":153,"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/classification","prev":"/task/classification/papers/6","next":"/task/classification/papers/8","papers":[{"url":"/paper/poison-attacks-against-text-datasets-with","slug":"poison-attacks-against-text-datasets-with","title":"Poison Attacks against Text Datasets with Conditional Adversarially Regularized Autoencoder","date":"2020-10-06","arxiv_id":"2010.02684","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/poison-attacks-against-text-datasets-with#ran","syntology_url":"https://syntology.ai/paper/2010.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02684"}},"official":{"repos":["alvinchangw/CARA_EMNLP2020"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-cross-networks-with-vertex-infomax","slug":"graph-cross-networks-with-vertex-infomax","title":"Graph Cross Networks with Vertex Infomax Pooling","date":"2020-10-05","arxiv_id":"2010.01804","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-cross-networks-with-vertex-infomax#ran","syntology_url":"https://syntology.ai/paper/2010.01804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01804"}},"official":{"repos":["limaosen0/GXN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-fine-grained-sentiment","slug":"enhancing-fine-grained-sentiment","title":"Enhancing Fine-grained Sentiment Classification Exploiting Local Context Embedding","date":"2020-10-02","arxiv_id":"2010.00767","repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-for-time-series-classification-1","slug":"deep-learning-for-time-series-classification-1","title":"Deep learning for time series classification","date":"2020-10-01","arxiv_id":"2010.00567","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-svdd-sampling-with-approximation","slug":"efficient-svdd-sampling-with-approximation","title":"Efficient SVDD Sampling with Approximation Guarantees for the Decision Boundary","date":"2020-09-29","arxiv_id":"2009.13853","repositories_listed":2,"syntology":null},{"url":"/paper/long-tailed-classification-by-keeping-the-1","slug":"long-tailed-classification-by-keeping-the-1","title":"Long-Tailed Classification by Keeping the Good and Removing the Bad Momentum Causal Effect","date":"2020-09-28","arxiv_id":"2009.12991","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/long-tailed-classification-by-keeping-the-1#ran","syntology_url":"https://syntology.ai/paper/2009.12991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12991"}},"official":{"repos":["KaihuaTang/Long-Tailed-Recognition.pytorch"],"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":["listed","official"]}}},{"url":"/paper/probabilistic-label-trees-for-extreme-multi","slug":"probabilistic-label-trees-for-extreme-multi","title":"Probabilistic Label Trees for Extreme Multi-label Classification","date":"2020-09-23","arxiv_id":"2009.11218","repositories_listed":2,"syntology":null},{"url":"/paper/semi-supervised-dictionary-learning-with","slug":"semi-supervised-dictionary-learning-with","title":"Semi-supervised dictionary learning with graph regularization and active points","date":"2020-09-13","arxiv_id":"2009.05964","repositories_listed":2,"syntology":null},{"url":"/paper/xcm-an-explainable-convolutional-neural","slug":"xcm-an-explainable-convolutional-neural","title":"XCM: An Explainable Convolutional Neural Network for Multivariate Time Series Classification","date":"2020-09-10","arxiv_id":"2009.04796","repositories_listed":2,"syntology":null},{"url":"/paper/imbalanced-image-classification-with","slug":"imbalanced-image-classification-with","title":"Imbalanced Image Classification with Complement Cross Entropy","date":"2020-09-04","arxiv_id":"2009.02189","repositories_listed":2,"syntology":null},{"url":"/paper/fairgnn-eliminating-the-discrimination-in","slug":"fairgnn-eliminating-the-discrimination-in","title":"Say No to the Discrimination: Learning Fair Graph Neural Networks with Limited Sensitive Attribute Information","date":"2020-09-03","arxiv_id":"2009.01454","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/fairgnn-eliminating-the-discrimination-in#ran","syntology_url":"https://syntology.ai/paper/2009.01454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.01454"}},"official":{"repos":["EnyanDai/FairGNN"],"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/sentimental-liar-extended-corpus-and-deep","slug":"sentimental-liar-extended-corpus-and-deep","title":"Sentimental LIAR: Extended Corpus and Deep Learning Models for Fake Claim Classification","date":"2020-09-01","arxiv_id":"2009.01047","repositories_listed":2,"syntology":null},{"url":"/paper/a-benchmark-of-data-stream-classification-for","slug":"a-benchmark-of-data-stream-classification-for","title":"A benchmark of data stream classification for human activity recognition on connected objects","date":"2020-08-27","arxiv_id":"2008.11880","repositories_listed":2,"syntology":null},{"url":"/paper/openframing-we-brought-the-ml-you-bring-the","slug":"openframing-we-brought-the-ml-you-bring-the","title":"OpenFraming: We brought the ML; you bring the data. Interact with your data and discover its frames","date":"2020-08-16","arxiv_id":"2008.06974","repositories_listed":2,"syntology":null},{"url":"/paper/a-text-classification-survey-from-shallow-to","slug":"a-text-classification-survey-from-shallow-to","title":"A Survey on Text Classification: From Shallow to Deep Learning","date":"2020-08-02","arxiv_id":"2008.00364","repositories_listed":2,"syntology":null},{"url":"/paper/generative-classifiers-as-a-basis-for","slug":"generative-classifiers-as-a-basis-for","title":"Generative Classifiers as a Basis for Trustworthy Image Classification","date":"2020-07-29","arxiv_id":"2007.15036","repositories_listed":2,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/generative-classifiers-as-a-basis-for#ran","syntology_url":"https://syntology.ai/paper/2007.15036","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15036"}},"official":{"repos":["VLL-HD/trustworthy_GCs"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/deal-deep-evidential-active-learning-for","slug":"deal-deep-evidential-active-learning-for","title":"DEAL: Deep Evidential Active Learning for Image Classification","date":"2020-07-22","arxiv_id":"2007.11344","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/deal-deep-evidential-active-learning-for#ran","syntology_url":"https://syntology.ai/paper/2007.11344","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.11344"}},"official":{"repos":["DeepLearningResearch/DEAL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/bayesian-few-shot-classification-with-one-vs","slug":"bayesian-few-shot-classification-with-one-vs","title":"Bayesian Few-Shot Classification with One-vs-Each Pólya-Gamma Augmented Gaussian Processes","date":"2020-07-20","arxiv_id":"2007.10417","repositories_listed":2,"syntology":null},{"url":"/paper/gesture-recognition-for-initiating-human-to","slug":"gesture-recognition-for-initiating-human-to","title":"Gesture Recognition for Initiating Human-to-Robot Handovers","date":"2020-07-20","arxiv_id":"2007.09945","repositories_listed":2,"syntology":null},{"url":"/paper/a-generic-visualization-approach-for","slug":"a-generic-visualization-approach-for","title":"A Generic Visualization Approach for Convolutional Neural Networks","date":"2020-07-19","arxiv_id":"2007.09748","repositories_listed":2,"syntology":null},{"url":"/paper/learning-semantics-enriched-representation","slug":"learning-semantics-enriched-representation","title":"Learning Semantics-enriched Representation via Self-discovery, Self-classification, and Self-restoration","date":"2020-07-14","arxiv_id":"2007.06959","repositories_listed":2,"syntology":null},{"url":"/paper/deep-brain-state-classification-of-meg-data","slug":"deep-brain-state-classification-of-meg-data","title":"Deep brain state classification of MEG data","date":"2020-07-02","arxiv_id":"2007.00897","repositories_listed":2,"syntology":null},{"url":"/paper/gan-bert-generative-adversarial-learning-for","slug":"gan-bert-generative-adversarial-learning-for","title":"GAN-BERT: Generative Adversarial Learning for Robust Text Classification with a Bunch of Labeled Examples","date":"2020-07-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/early-learning-regularization-prevents","slug":"early-learning-regularization-prevents","title":"Early-Learning Regularization Prevents Memorization of Noisy Labels","date":"2020-06-30","arxiv_id":"2007.00151","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/early-learning-regularization-prevents#ran","syntology_url":"https://syntology.ai/paper/2007.00151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.00151"}},"official":{"repos":["shengliu66/ELR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-data-augmentation-with-online","slug":"learning-data-augmentation-with-online","title":"Learning Data Augmentation with Online Bilevel Optimization for Image Classification","date":"2020-06-25","arxiv_id":"2006.14699","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 3 unverified","sample_list":"/paper/learning-data-augmentation-with-online#ran","syntology_url":"https://syntology.ai/paper/2006.14699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14699"}},"official":{"repos":["ElementAI/bilevel_augment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-semantically-enhanced-feature-for","slug":"learning-semantically-enhanced-feature-for","title":"Learning Semantically Enhanced Feature for Fine-Grained Image Classification","date":"2020-06-24","arxiv_id":"2006.13457","repositories_listed":2,"syntology":null},{"url":"/paper/attention-based-neural-networks-for-sentiment","slug":"attention-based-neural-networks-for-sentiment","title":"Attention-Based Neural Networks for Sentiment Attitude Extraction using Distant Supervision","date":"2020-06-23","arxiv_id":"2006.13730","repositories_listed":2,"syntology":null},{"url":"/paper/graph-prototypical-networks-for-few-shot","slug":"graph-prototypical-networks-for-few-shot","title":"Graph Prototypical Networks for Few-shot Learning on Attributed Networks","date":"2020-06-23","arxiv_id":"2006.12739","repositories_listed":2,"syntology":null},{"url":"/paper/graph-backdoor","slug":"graph-backdoor","title":"Graph Backdoor","date":"2020-06-21","arxiv_id":"2006.11890","repositories_listed":2,"syntology":null},{"url":"/paper/backdoor-attacks-to-graph-neural-networks","slug":"backdoor-attacks-to-graph-neural-networks","title":"Backdoor Attacks to Graph Neural Networks","date":"2020-06-19","arxiv_id":"2006.11165","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/backdoor-attacks-to-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.11165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11165"}},"official":{"repos":["zaixizhang/graphbackdoor"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-prototypical-transfer","slug":"self-supervised-prototypical-transfer","title":"Self-Supervised Prototypical Transfer Learning for Few-Shot Classification","date":"2020-06-19","arxiv_id":"2006.11325","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":1,"n_ran_checked":1,"n_instrument":7,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"8 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; 7 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-prototypical-transfer#ran","syntology_url":"https://syntology.ai/paper/2006.11325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11325"}},"official":{"repos":["indy-lab/ProtoTransfer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fully-test-time-adaptation-by-entropy","slug":"fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","arxiv_id":"2006.10726","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":2,"n_ran_checked":2,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"8 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; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fully-test-time-adaptation-by-entropy#ran","syntology_url":"https://syntology.ai/paper/2006.10726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.10726"}},"official":{"repos":["DequanWang/tent"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/improving-few-shot-visual-classification-with","slug":"improving-few-shot-visual-classification-with","title":"Enhancing Few-Shot Image Classification with Unlabelled Examples","date":"2020-06-17","arxiv_id":"2006.12245","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/improving-few-shot-visual-classification-with#ran","syntology_url":"https://syntology.ai/paper/2006.12245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12245"}},"official":{"repos":["plai-group/simple-cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/achieving-robustness-in-classification-using","slug":"achieving-robustness-in-classification-using","title":"Achieving robustness in classification using optimal transport with hinge regularization","date":"2020-06-11","arxiv_id":"2006.06520","repositories_listed":2,"syntology":null},{"url":"/paper/data-augmentation-for-graph-neural-networks","slug":"data-augmentation-for-graph-neural-networks","title":"Data Augmentation for Graph Neural Networks","date":"2020-06-11","arxiv_id":"2006.06830","repositories_listed":2,"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":0,"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/data-augmentation-for-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.06830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06830"}},"official":{"repos":["zhao-tong/GAug"],"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/is-deep-learning-necessary-for-simple","slug":"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/few-shot-slot-tagging-with-collapsed","slug":"few-shot-slot-tagging-with-collapsed","title":"Few-shot Slot Tagging with Collapsed Dependency Transfer and Label-enhanced Task-adaptive Projection Network","date":"2020-06-10","arxiv_id":"2006.05702","repositories_listed":2,"syntology":null},{"url":"/paper/black-box-adversarial-attacks-on-graph-neural","slug":"black-box-adversarial-attacks-on-graph-neural","title":"Towards More Practical Adversarial Attacks on Graph Neural Networks","date":"2020-06-09","arxiv_id":"2006.05057","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/black-box-adversarial-attacks-on-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.05057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05057"}},"official":{"repos":["Mark12Ding/GNN-Practical-Attack","TheaperDeng/GNN-Attack-InfMax"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-self-supervised-approach-for-adversarial-1","slug":"a-self-supervised-approach-for-adversarial-1","title":"A Self-supervised Approach for Adversarial Robustness","date":"2020-06-08","arxiv_id":"2006.04924","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-self-supervised-approach-for-adversarial-1#ran","syntology_url":"https://syntology.ai/paper/2006.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04924"}},"official":{"repos":["Muzammal-Naseer/NRP"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/neural-networks-out-of-distribution-detection","slug":"neural-networks-out-of-distribution-detection","title":"Entropic Out-of-Distribution Detection: Seamless Detection of Unknown Examples","date":"2020-06-07","arxiv_id":"2006.04005","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-checkpoint-adjoint-method-for","slug":"adaptive-checkpoint-adjoint-method-for","title":"Adaptive Checkpoint Adjoint Method for Gradient Estimation in Neural ODE","date":"2020-06-03","arxiv_id":"2006.02493","repositories_listed":2,"syntology":null},{"url":"/paper/classification-with-valid-and-adaptive","slug":"classification-with-valid-and-adaptive","title":"Classification with Valid and Adaptive Coverage","date":"2020-06-03","arxiv_id":"2006.02544","repositories_listed":2,"syntology":null},{"url":"/paper/exploration-of-interpretability-techniques","slug":"exploration-of-interpretability-techniques","title":"Exploration of Interpretability Techniques for Deep COVID-19 Classification using Chest X-ray Images","date":"2020-06-03","arxiv_id":"2006.02570","repositories_listed":2,"syntology":null},{"url":"/paper/safeml-safety-monitoring-of-machine-learning","slug":"safeml-safety-monitoring-of-machine-learning","title":"SafeML: Safety Monitoring of Machine Learning Classifiers through Statistical Difference Measure","date":"2020-05-27","arxiv_id":"2005.13166","repositories_listed":2,"syntology":null},{"url":"/paper/what-are-people-asking-about-covid-19-a","slug":"what-are-people-asking-about-covid-19-a","title":"What Are People Asking About COVID-19? A Question Classification Dataset","date":"2020-05-26","arxiv_id":"2005.12522","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-classify-images-without-labels","slug":"learning-to-classify-images-without-labels","title":"SCAN: Learning to Classify Images without Labels","date":"2020-05-25","arxiv_id":"2005.12320","repositories_listed":2,"syntology":null},{"url":"/paper/the-effects-of-randomness-on-the-stability-of","slug":"the-effects-of-randomness-on-the-stability-of","title":"The Effects of Randomness on the Stability of Node Embeddings","date":"2020-05-20","arxiv_id":"2005.10039","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-effects-of-randomness-on-the-stability-of#ran","syntology_url":"https://syntology.ai/paper/2005.10039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10039"}},"official":{"repos":["SGDE2020/embedding_stability"],"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":["official"]}}},{"url":"/paper/improve-robustness-of-dnn-for-ecg-signal","slug":"improve-robustness-of-dnn-for-ecg-signal","title":"Improve robustness of DNN for ECG signal classification:a noise-to-signal ratio perspective","date":"2020-05-18","arxiv_id":"2005.09134","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improve-robustness-of-dnn-for-ecg-signal#ran","syntology_url":"https://syntology.ai/paper/2005.09134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09134"}},"official":{"repos":["SarielMa/ICLR2020_AI4AH"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-networks-for-fashion-image","slug":"neural-networks-for-fashion-image","title":"Neural Networks for Fashion Image Classification and Visual Search","date":"2020-05-17","arxiv_id":"2005.08170","repositories_listed":2,"syntology":null},{"url":"/paper/sentibert-a-transferable-transformer-based","slug":"sentibert-a-transferable-transformer-based","title":"SentiBERT: A Transferable Transformer-Based Architecture for Compositional Sentiment Semantics","date":"2020-05-08","arxiv_id":"2005.04114","repositories_listed":2,"syntology":null},{"url":"/paper/classification-based-anomaly-detection-for-1","slug":"classification-based-anomaly-detection-for-1","title":"Classification-Based Anomaly Detection for General Data","date":"2020-05-05","arxiv_id":"2005.02359","repositories_listed":2,"syntology":{"n":10,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":4,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/classification-based-anomaly-detection-for-1#ran","syntology_url":"https://syntology.ai/paper/2005.02359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02359"}},"official":null}},{"url":"/paper/explainable-ai-for-classification-using","slug":"explainable-ai-for-classification-using","title":"Explainable AI for Classification using Probabilistic Logic Inference","date":"2020-05-05","arxiv_id":"2005.02074","repositories_listed":2,"syntology":null},{"url":"/paper/mixtext-linguistically-informed-interpolation","slug":"mixtext-linguistically-informed-interpolation","title":"MixText: Linguistically-Informed Interpolation of Hidden Space for Semi-Supervised Text Classification","date":"2020-04-25","arxiv_id":"2004.12239","repositories_listed":2,"syntology":null},{"url":"/paper/tensor-networks-for-medical-image","slug":"tensor-networks-for-medical-image","title":"Tensor Networks for Medical Image Classification","date":"2020-04-21","arxiv_id":"2004.10076","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/tensor-networks-for-medical-image#ran","syntology_url":"https://syntology.ai/paper/2004.10076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10076"}},"official":{"repos":["bitbucket.org/raghavian/lotenet_pytorch","raghavian/loTeNet_pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/uncertainty-estimation-for-classification-and","slug":"uncertainty-estimation-for-classification-and","title":"Uncertainty estimation for classification and risk prediction on medical tabular data","date":"2020-04-13","arxiv_id":"2004.05824","repositories_listed":2,"syntology":null},{"url":"/paper/pruning-and-sparsemax-methods-for","slug":"pruning-and-sparsemax-methods-for","title":"Pruning and Sparsemax Methods for Hierarchical Attention Networks","date":"2020-04-08","arxiv_id":"2004.04343","repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-based-text-classification-a","slug":"deep-learning-based-text-classification-a","title":"Deep Learning Based Text Classification: A Comprehensive Review","date":"2020-04-06","arxiv_id":"2004.03705","repositories_listed":2,"syntology":null},{"url":"/paper/bae-bert-based-adversarial-examples-for-text","slug":"bae-bert-based-adversarial-examples-for-text","title":"BAE: BERT-based Adversarial Examples for Text Classification","date":"2020-04-04","arxiv_id":"2004.01970","repositories_listed":2,"syntology":null},{"url":"/paper/generating-hierarchical-explanations-on-text","slug":"generating-hierarchical-explanations-on-text","title":"Generating Hierarchical Explanations on Text Classification via Feature Interaction Detection","date":"2020-04-04","arxiv_id":"2004.02015","repositories_listed":2,"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/generating-hierarchical-explanations-on-text#ran","syntology_url":"https://syntology.ai/paper/2004.02015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.02015"}},"official":{"repos":["UVa-NLP/HEDGE"],"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/keyphrase-rubric-relationship-classification","slug":"keyphrase-rubric-relationship-classification","title":"Finding Black Cat in a Coal Cellar -- Keyphrase Extraction & Keyphrase-Rubric Relationship Classification from Complex Assignments","date":"2020-04-03","arxiv_id":"2004.01549","repositories_listed":2,"syntology":null},{"url":"/paper/supervised-learning-with-quantum-measurements","slug":"supervised-learning-with-quantum-measurements","title":"Supervised Learning with Quantum Measurements","date":"2020-04-02","arxiv_id":"2004.01227","repositories_listed":2,"syntology":null},{"url":"/paper/m2m-imbalanced-classification-via-major-to","slug":"m2m-imbalanced-classification-via-major-to","title":"M2m: Imbalanced Classification via Major-to-minor Translation","date":"2020-04-01","arxiv_id":"2004.00431","repositories_listed":2,"syntology":null},{"url":"/paper/semantic-drift-compensation-for-class","slug":"semantic-drift-compensation-for-class","title":"Semantic Drift Compensation for Class-Incremental Learning","date":"2020-04-01","arxiv_id":"2004.00440","repositories_listed":2,"syntology":null},{"url":"/paper/seeing-the-whole-patient-using-multi-label","slug":"seeing-the-whole-patient-using-multi-label","title":"Seeing The Whole Patient: Using Multi-Label Medical Text Classification Techniques to Enhance Predictions of Medical Codes","date":"2020-03-29","arxiv_id":"2004.00430","repositories_listed":2,"syntology":null},{"url":"/paper/milking-cowmask-for-semi-supervised-image","slug":"milking-cowmask-for-semi-supervised-image","title":"Milking CowMask for Semi-Supervised Image Classification","date":"2020-03-26","arxiv_id":"2003.12022","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"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 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/milking-cowmask-for-semi-supervised-image#ran","syntology_url":"https://syntology.ai/paper/2003.12022","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12022"}},"official":{"repos":["google-research/google-research"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-label-text-classification-using","slug":"multi-label-text-classification-using","title":"Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-03-22","arxiv_id":"2003.11644","repositories_listed":2,"syntology":null},{"url":"/paper/overinterpretation-reveals-image","slug":"overinterpretation-reveals-image","title":"Overinterpretation reveals image classification model pathologies","date":"2020-03-19","arxiv_id":"2003.08907","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":3,"n_instrument":7,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/overinterpretation-reveals-image#ran","syntology_url":"https://syntology.ai/paper/2003.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.08907"}},"official":{"repos":["gifford-lab/overinterpretation"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/1st-place-solutions-for-openimage2019-object","slug":"1st-place-solutions-for-openimage2019-object","title":"1st Place Solutions for OpenImage2019 -- Object Detection and Instance Segmentation","date":"2020-03-17","arxiv_id":"2003.07557","repositories_listed":2,"syntology":null},{"url":"/paper/revisiting-the-sibling-head-in-object","slug":"revisiting-the-sibling-head-in-object","title":"Revisiting the Sibling Head in Object Detector","date":"2020-03-17","arxiv_id":"2003.07540","repositories_listed":2,"syntology":null},{"url":"/paper/document-ranking-with-a-pretrained-sequence","slug":"document-ranking-with-a-pretrained-sequence","title":"Document Ranking with a Pretrained Sequence-to-Sequence Model","date":"2020-03-14","arxiv_id":"2003.06713","repositories_listed":2,"syntology":null},{"url":"/paper/semantic-pyramid-for-image-generation","slug":"semantic-pyramid-for-image-generation","title":"Semantic Pyramid for Image Generation","date":"2020-03-13","arxiv_id":"2003.06221","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semantic-pyramid-for-image-generation#ran","syntology_url":"https://syntology.ai/paper/2003.06221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06221"}},"official":null}},{"url":"/paper/ultra-efficient-transfer-learning-with-meta","slug":"ultra-efficient-transfer-learning-with-meta","title":"Ultra Efficient Transfer Learning with Meta Update for Cross Subject EEG Classification","date":"2020-03-13","arxiv_id":"2003.06113","repositories_listed":2,"syntology":null},{"url":"/paper/supermix-supervising-the-mixing-data","slug":"supermix-supervising-the-mixing-data","title":"SuperMix: Supervising the Mixing Data Augmentation","date":"2020-03-10","arxiv_id":"2003.05034","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/supermix-supervising-the-mixing-data#ran","syntology_url":"https://syntology.ai/paper/2003.05034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05034"}},"official":{"repos":["alldbi/SuperMix"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tasknorm-rethinking-batch-normalization-for","slug":"tasknorm-rethinking-batch-normalization-for","title":"TaskNorm: Rethinking Batch Normalization for Meta-Learning","date":"2020-03-06","arxiv_id":"2003.03284","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/tasknorm-rethinking-batch-normalization-for#ran","syntology_url":"https://syntology.ai/paper/2003.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03284"}},"official":{"repos":["cambridge-mlg/cnaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-backdoor-poisoning-attacks-against","slug":"exploring-backdoor-poisoning-attacks-against","title":"Explanation-Guided Backdoor Poisoning Attacks Against Malware Classifiers","date":"2020-03-02","arxiv_id":"2003.01031","repositories_listed":2,"syntology":null},{"url":"/paper/imbalance-learning-for-variable-star","slug":"imbalance-learning-for-variable-star","title":"Imbalance Learning for Variable Star Classification","date":"2020-02-27","arxiv_id":"2002.12386","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/imbalance-learning-for-variable-star#ran","syntology_url":"https://syntology.ai/paper/2002.12386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12386"}},"official":null}},{"url":"/paper/nonlinear-classifiers-for-ranking-problems","slug":"nonlinear-classifiers-for-ranking-problems","title":"Nonlinear classifiers for ranking problems based on kernelized SVM","date":"2020-02-26","arxiv_id":"2002.11436","repositories_listed":2,"syntology":null},{"url":"/paper/pointaugment-an-auto-augmentation-framework","slug":"pointaugment-an-auto-augmentation-framework","title":"PointAugment: an Auto-Augmentation Framework for Point Cloud Classification","date":"2020-02-25","arxiv_id":"2002.10876","repositories_listed":2,"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/pointaugment-an-auto-augmentation-framework#ran","syntology_url":"https://syntology.ai/paper/2002.10876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10876"}},"official":{"repos":["liruihui/PointAugment"],"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/magnet-multi-label-text-classification-using","slug":"magnet-multi-label-text-classification-using","title":"MAGNET: Multi-Label Text Classification using Attention-based Graph Neural Network","date":"2020-02-24","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-deep-network-embedding-for-cross","slug":"adversarial-deep-network-embedding-for-cross","title":"Adversarial Deep Network Embedding for Cross-network Node Classification","date":"2020-02-18","arxiv_id":"2002.07366","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":7,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-deep-network-embedding-for-cross#ran","syntology_url":"https://syntology.ai/paper/2002.07366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07366"}},"official":{"repos":["shenxiaocam/ACDNE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/unifying-graph-convolutional-neural-networks-1","slug":"unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","arxiv_id":"2002.06755","repositories_listed":2,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unifying-graph-convolutional-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2002.06755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.06755"}},"official":null}},{"url":"/paper/pointhop-a-lightweight-learning-model-on","slug":"pointhop-a-lightweight-learning-model-on","title":"PointHop++: A Lightweight Learning Model on Point Sets for 3D Classification","date":"2020-02-09","arxiv_id":"2002.03281","repositories_listed":2,"syntology":null},{"url":"/paper/bridging-ordinary-label-learning-and","slug":"bridging-ordinary-label-learning-and","title":"Bridging Ordinary-Label Learning and Complementary-Label Learning","date":"2020-02-06","arxiv_id":"2002.02158","repositories_listed":2,"syntology":null},{"url":"/paper/distance-metric-learning-for-graph-structured","slug":"distance-metric-learning-for-graph-structured","title":"Distance Metric Learning for Graph Structured Data","date":"2020-02-03","arxiv_id":"2002.00727","repositories_listed":2,"syntology":null},{"url":"/paper/interpreting-video-features-a-comparison-of-1","slug":"interpreting-video-features-a-comparison-of-1","title":"Interpreting video features: a comparison of 3D convolutional networks and convolutional LSTM networks","date":"2020-02-02","arxiv_id":"2002.00367","repositories_listed":2,"syntology":null},{"url":"/paper/deep-learning-based-unsupervised-and-semi","slug":"deep-learning-based-unsupervised-and-semi","title":"Deep Learning Based Unsupervised and Semi-supervised Classification for Keratoconus","date":"2020-01-31","arxiv_id":"2001.11653","repositories_listed":2,"syntology":null},{"url":"/paper/get-rid-of-suspended-animation-problem-deep","slug":"get-rid-of-suspended-animation-problem-deep","title":"Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification","date":"2020-01-22","arxiv_id":"2001.07922","repositories_listed":2,"syntology":null},{"url":"/paper/fine-grained-image-classification-and","slug":"fine-grained-image-classification-and","title":"Fine-grained Image Classification and Retrieval by Combining Visual and Locally Pooled Textual Features","date":"2020-01-14","arxiv_id":"2001.04732","repositories_listed":2,"syntology":null},{"url":"/paper/tensor-graph-convolutional-networks-for-text","slug":"tensor-graph-convolutional-networks-for-text","title":"Tensor Graph Convolutional Networks for Text Classification","date":"2020-01-12","arxiv_id":"2001.05313","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tensor-graph-convolutional-networks-for-text#ran","syntology_url":"https://syntology.ai/paper/2001.05313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.05313"}},"official":{"repos":["xienliu/tensor-gcn-text-classification-tensorflow"],"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/reasoning-on-knowledge-graphs-with-debate","slug":"reasoning-on-knowledge-graphs-with-debate","title":"Reasoning on Knowledge Graphs with Debate Dynamics","date":"2020-01-02","arxiv_id":"2001.00461","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/reasoning-on-knowledge-graphs-with-debate#ran","syntology_url":"https://syntology.ai/paper/2001.00461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.00461"}},"official":{"repos":["m-hildebrandt/R2D2"],"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/ranking-and-classification-driven-feature","slug":"ranking-and-classification-driven-feature","title":"Ranking and Classification driven Feature Learning for Person Re_identification","date":"2019-12-25","arxiv_id":"1912.11630","repositories_listed":2,"syntology":null},{"url":"/paper/emotion-recognition-from-speech","slug":"emotion-recognition-from-speech","title":"Emotion Recognition from Speech","date":"2019-12-22","arxiv_id":"1912.10458","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-impute-a-general-framework-for-1","slug":"learning-to-impute-a-general-framework-for-1","title":"Learning to Impute: A General Framework for Semi-supervised Learning","date":"2019-12-22","arxiv_id":"1912.10364","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-impute-a-general-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/1912.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.10364"}},"official":{"repos":["VICO-UoE/L2I"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-understanding-and-interpretation-of","slug":"on-the-understanding-and-interpretation-of","title":"On the Explanation of Machine Learning Predictions in Clinical Gait Analysis","date":"2019-12-16","arxiv_id":"1912.07737","repositories_listed":2,"syntology":null},{"url":"/paper/iou-aware-single-stage-object-detector-for","slug":"iou-aware-single-stage-object-detector-for","title":"IoU-aware Single-stage Object Detector for Accurate Localization","date":"2019-12-12","arxiv_id":"1912.05992","repositories_listed":2,"syntology":null},{"url":"/paper/associative-alignment-for-few-shot-image","slug":"associative-alignment-for-few-shot-image","title":"Associative Alignment for Few-shot Image Classification","date":"2019-12-11","arxiv_id":"1912.05094","repositories_listed":2,"syntology":null},{"url":"/paper/identifying-mislabeled-instances-in","slug":"identifying-mislabeled-instances-in","title":"Identifying Mislabeled Instances in Classification Datasets","date":"2019-12-11","arxiv_id":"1912.05283","repositories_listed":2,"syntology":null},{"url":"/paper/improved-few-shot-visual-classification","slug":"improved-few-shot-visual-classification","title":"Improved Few-Shot Visual Classification","date":"2019-12-07","arxiv_id":"1912.03432","repositories_listed":2,"syntology":null},{"url":"/paper/enriching-existing-conversational-emotion","slug":"enriching-existing-conversational-emotion","title":"EDA: Enriching Emotional Dialogue Acts using an Ensemble of Neural Annotators","date":"2019-12-02","arxiv_id":"1912.00819","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-delta-method-for-uncertainty","slug":"on-the-delta-method-for-uncertainty","title":"Epistemic Uncertainty Quantification in Deep Learning Classification by the Delta Method","date":"2019-12-02","arxiv_id":"1912.00832","repositories_listed":2,"syntology":null}],"record_sha256":"170af3d77c4fa8852283b8e8632dbd89f2ee17dbf0bb10f58b1ecb31181ce65f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}