{"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/26","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":26,"pages_in_order":146,"rows_per_page":100,"rows":[2501,2600],"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/25","next":"/task/classification/papers/27","papers":[{"url":"/paper/open-domain-targeted-sentiment-analysis-via","slug":"open-domain-targeted-sentiment-analysis-via","title":"Open-Domain Targeted Sentiment Analysis via Span-Based Extraction and Classification","date":"2019-06-10","arxiv_id":"1906.03820","repositories_listed":1,"syntology":null},{"url":"/paper/topology-attack-and-defense-for-graph-neural","slug":"topology-attack-and-defense-for-graph-neural","title":"Topology Attack and Defense for Graph Neural Networks: An Optimization Perspective","date":"2019-06-10","arxiv_id":"1906.04214","repositories_listed":1,"syntology":null},{"url":"/paper/a-persistent-weisfeilerlehman-procedure-for","slug":"a-persistent-weisfeilerlehman-procedure-for","title":"A Persistent Weisfeiler–Lehman Procedure for Graph Classification","date":"2019-06-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/encouraging-paragraph-embeddings-to-remember","slug":"encouraging-paragraph-embeddings-to-remember","title":"Encouraging Paragraph Embeddings to Remember Sentence Identity Improves Classification","date":"2019-06-09","arxiv_id":"1906.03656","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-taxonomy-aware-and-attentional","slug":"hierarchical-taxonomy-aware-and-attentional","title":"Hierarchical Taxonomy-Aware and Attentional Graph Capsule RCNNs for Large-Scale Multi-Label Text Classification","date":"2019-06-09","arxiv_id":"1906.04898","repositories_listed":1,"syntology":null},{"url":"/paper/is-attention-interpretable","slug":"is-attention-interpretable","title":"Is Attention Interpretable?","date":"2019-06-09","arxiv_id":"1906.03731","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/is-attention-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03731"}},"official":{"repos":["serrano-s/attn-tests"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-implicit-bias-of-adagrad-on-separable","slug":"the-implicit-bias-of-adagrad-on-separable","title":"The Implicit Bias of AdaGrad on Separable Data","date":"2019-06-09","arxiv_id":"1906.03559","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-logic-programming-via","slug":"inductive-logic-programming-via","title":"Inductive Logic Programming via Differentiable Deep Neural Logic Networks","date":"2019-06-08","arxiv_id":"1906.03523","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-classification-and-novelty","slug":"simultaneous-classification-and-novelty","title":"Outlier Exposure with Confidence Control for Out-of-Distribution Detection","date":"2019-06-08","arxiv_id":"1906.03509","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-examples-for-non-parametric","slug":"adversarial-examples-for-non-parametric","title":"Robustness for Non-Parametric Classification: A Generic Attack and Defense","date":"2019-06-07","arxiv_id":"1906.03310","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/adversarial-examples-for-non-parametric#ran","syntology_url":"https://syntology.ai/paper/1906.03310","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03310"}},"official":{"repos":["yangarbiter/adversarial-nonparametrics"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/reliable-classification-explanations-via","slug":"reliable-classification-explanations-via","title":"Adversarial Explanations for Understanding Image Classification Decisions and Improved Neural Network Robustness","date":"2019-06-07","arxiv_id":"1906.02896","repositories_listed":1,"syntology":null},{"url":"/paper/resampling-based-assessment-of-robustness-to","slug":"resampling-based-assessment-of-robustness-to","title":"Variational Resampling Based Assessment of Deep Neural Networks under Distribution Shift","date":"2019-06-07","arxiv_id":"1906.02972","repositories_listed":1,"syntology":null},{"url":"/paper/tensornetwork-for-machine-learning","slug":"tensornetwork-for-machine-learning","title":"TensorNetwork for Machine Learning","date":"2019-06-07","arxiv_id":"1906.06329","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/tensornetwork-for-machine-learning#ran","syntology_url":"https://syntology.ai/paper/1906.06329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06329"}},"official":{"repos":["google/TensorNetwork"],"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/word-embeddings-for-the-armenian-language","slug":"word-embeddings-for-the-armenian-language","title":"Word Embeddings for the Armenian Language: Intrinsic and Extrinsic Evaluation","date":"2019-06-07","arxiv_id":"1906.03134","repositories_listed":1,"syntology":null},{"url":"/paper/gibbonr-an-r-package-for-the-detection-and","slug":"gibbonr-an-r-package-for-the-detection-and","title":"GIBBONFINDR: An R package for the detection and classification of acoustic signals","date":"2019-06-06","arxiv_id":"1906.02572","repositories_listed":1,"syntology":null},{"url":"/paper/primal-dual-block-frank-wolfe","slug":"primal-dual-block-frank-wolfe","title":"Primal-Dual Block Frank-Wolfe","date":"2019-06-06","arxiv_id":"1906.02436","repositories_listed":1,"syntology":null},{"url":"/paper/robust-attacks-against-multiple-classifiers","slug":"robust-attacks-against-multiple-classifiers","title":"Robust Attacks against Multiple Classifiers","date":"2019-06-06","arxiv_id":"1906.02816","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/robust-attacks-against-multiple-classifiers#ran","syntology_url":"https://syntology.ai/paper/1906.02816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02816"}},"official":{"repos":["jcperdomo/robust_attacks"],"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/what-you-need-is-a-more-professional-teacher","slug":"what-you-need-is-a-more-professional-teacher","title":"Guided learning for weakly-labeled semi-supervised sound event detection","date":"2019-06-06","arxiv_id":"1906.02517","repositories_listed":1,"syntology":null},{"url":"/paper/a-systematic-framework-for-natural","slug":"a-systematic-framework-for-natural","title":"Do Image Classifiers Generalize Across Time?","date":"2019-06-05","arxiv_id":"1906.02168","repositories_listed":1,"syntology":null},{"url":"/paper/a-tunable-loss-function-for-classification","slug":"a-tunable-loss-function-for-classification","title":"A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalization","date":"2019-06-05","arxiv_id":"1906.02314","repositories_listed":1,"syntology":null},{"url":"/paper/demo-net-degree-specific-graph-neural","slug":"demo-net-degree-specific-graph-neural","title":"DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification","date":"2019-06-05","arxiv_id":"1906.02319","repositories_listed":1,"syntology":null},{"url":"/paper/evaluation-and-improvement-of-chatbot-text","slug":"evaluation-and-improvement-of-chatbot-text","title":"Evaluation and Improvement of Chatbot Text Classification Data Quality Using Plausible Negative Examples","date":"2019-06-05","arxiv_id":"1906.01910","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-and-differentially-private","slug":"interpretable-and-differentially-private","title":"Interpretable and Differentially Private Predictions","date":"2019-06-05","arxiv_id":"1906.02004","repositories_listed":1,"syntology":null},{"url":"/paper/large-scale-multi-label-text-classification-1","slug":"large-scale-multi-label-text-classification-1","title":"Large-Scale Multi-Label Text Classification on EU Legislation","date":"2019-06-05","arxiv_id":"1906.02192","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-use-of-pairwise-distance-learning-for","slug":"on-the-use-of-pairwise-distance-learning-for","title":"On the use of Pairwise Distance Learning for Brain Signal Classification with Limited Observations","date":"2019-06-05","arxiv_id":"1906.02076","repositories_listed":1,"syntology":null},{"url":"/paper/variational-pretraining-for-semi-supervised","slug":"variational-pretraining-for-semi-supervised","title":"Variational Pretraining for Semi-supervised Text Classification","date":"2019-06-05","arxiv_id":"1906.02242","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/variational-pretraining-for-semi-supervised#ran","syntology_url":"https://syntology.ai/paper/1906.02242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02242"}},"official":{"repos":["allenai/vampire"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/variational-spectral-graph-convolutional","slug":"variational-spectral-graph-convolutional","title":"Variational Inference for Graph Convolutional Networks in the Absence of Graph Data and Adversarial Settings","date":"2019-06-05","arxiv_id":"1906.01852","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-health-problem-detection-from-gait","slug":"automatic-health-problem-detection-from-gait","title":"Automatic Health Problem Detection from Gait Videos Using Deep Neural Networks","date":"2019-06-04","arxiv_id":"1906.01480","repositories_listed":1,"syntology":null},{"url":"/paper/finding-syntactic-representations-in-neural","slug":"finding-syntactic-representations-in-neural","title":"Finding Syntactic Representations in Neural Stacks","date":"2019-06-04","arxiv_id":"1906.01594","repositories_listed":1,"syntology":null},{"url":"/paper/geo-aware-networks-for-fine-grained","slug":"geo-aware-networks-for-fine-grained","title":"Geo-Aware Networks for Fine-Grained Recognition","date":"2019-06-04","arxiv_id":"1906.01737","repositories_listed":1,"syntology":null},{"url":"/paper/information-competing-process-for-learning","slug":"information-competing-process-for-learning","title":"Information Competing Process for Learning Diversified Representations","date":"2019-06-04","arxiv_id":"1906.01288","repositories_listed":1,"syntology":null},{"url":"/paper/pca-driven-hybrid-network-design-for-enabling","slug":"pca-driven-hybrid-network-design-for-enabling","title":"Constructing Energy-efficient Mixed-precision Neural Networks through Principal Component Analysis for Edge Intelligence","date":"2019-06-04","arxiv_id":"1906.01493","repositories_listed":1,"syntology":null},{"url":"/paper/190600562","slug":"190600562","title":"Learning to Self-Train for Semi-Supervised Few-Shot Classification","date":"2019-06-03","arxiv_id":"1906.00562","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/190600562#ran","syntology_url":"https://syntology.ai/paper/1906.00562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00562"}},"official":{"repos":["xinzheli1217/learning-to-self-train"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190600675","slug":"190600675","title":"Deeply-supervised Knowledge Synergy","date":"2019-06-03","arxiv_id":"1906.00675","repositories_listed":1,"syntology":null},{"url":"/paper/190600901","slug":"190600901","title":"The iMet Collection 2019 Challenge Dataset","date":"2019-06-03","arxiv_id":"1906.00901","repositories_listed":1,"syntology":null},{"url":"/paper/mining-youtube-a-dataset-for-learning-fine","slug":"mining-youtube-a-dataset-for-learning-fine","title":"Mining YouTube - A dataset for learning fine-grained action concepts from webly supervised video data","date":"2019-06-03","arxiv_id":"1906.01012","repositories_listed":1,"syntology":null},{"url":"/paper/190600398","slug":"190600398","title":"Cost-sensitive Boosting Pruning Trees for depression detection on Twitter","date":"2019-06-02","arxiv_id":"1906.00398","repositories_listed":1,"syntology":null},{"url":"/paper/190600452","slug":"190600452","title":"Radial-Based Undersampling for Imbalanced Data Classification","date":"2019-06-02","arxiv_id":"1906.00452","repositories_listed":1,"syntology":null},{"url":"/paper/190600454","slug":"190600454","title":"Classification of Crop Tolerance to Heat and Drought: A Deep Convolutional Neural Networks Approach","date":"2019-06-02","arxiv_id":"1906.00454","repositories_listed":1,"syntology":null},{"url":"/paper/190600204","slug":"190600204","title":"Perceptual Evaluation of Adversarial Attacks for CNN-based Image Classification","date":"2019-06-01","arxiv_id":"1906.00204","repositories_listed":1,"syntology":null},{"url":"/paper/190600297","slug":"190600297","title":"GANchors: Realistic Image Perturbation Distributions for Anchors Using Generative Models","date":"2019-06-01","arxiv_id":"1906.00297","repositories_listed":1,"syntology":null},{"url":"/paper/190602590","slug":"190602590","title":"Linear and Quadratic Discriminant Analysis: Tutorial","date":"2019-06-01","arxiv_id":"1906.02590","repositories_listed":1,"syntology":null},{"url":"/paper/a-late-fusion-cnn-for-digital-matting","slug":"a-late-fusion-cnn-for-digital-matting","title":"A Late Fusion CNN for Digital Matting","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/conssed-at-semeval-2019-task-3-configurable","slug":"conssed-at-semeval-2019-task-3-configurable","title":"ConSSED at SemEval-2019 Task 3: Configurable Semantic and Sentiment Emotion Detector","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/detecting-anomalies-in-image-classification","slug":"detecting-anomalies-in-image-classification","title":"Detecting Anomalies in Image Classification by Means of Semantic Relationships","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explainability-methods-for-graph","slug":"explainability-methods-for-graph","title":"Explainability Methods for Graph Convolutional Neural Networks","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/from-legal-to-technical-concept-towards-an","slug":"from-legal-to-technical-concept-towards-an","title":"From legal to technical concept: Towards an automated classification of German political Twitter postings as criminal offenses","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/generalizing-unmasking-for-short-texts","slug":"generalizing-unmasking-for-short-texts","title":"Generalizing Unmasking for Short Texts","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gradient-matching-generative-networks-for","slug":"gradient-matching-generative-networks-for","title":"Gradient Matching Generative Networks for Zero-Shot Learning","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ip102-a-large-scale-benchmark-dataset-for","slug":"ip102-a-large-scale-benchmark-dataset-for","title":"IP102: A Large-Scale Benchmark Dataset for Insect Pest Recognition","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mfas-multimodal-fusion-architecture-search-1","slug":"mfas-multimodal-fusion-architecture-search-1","title":"MFAS: Multimodal Fusion Architecture Search","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-user-factor-adaptation-for-text","slug":"neural-user-factor-adaptation-for-text","title":"Neural User Factor Adaptation for Text Classification: Learning to Generalize Across Author Demographics","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/pointweb-enhancing-local-neighborhood","slug":"pointweb-enhancing-local-neighborhood","title":"PointWeb: Enhancing Local Neighborhood Features for Point Cloud Processing","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/repmet-representative-based-metric-learning-1","slug":"repmet-representative-based-metric-learning-1","title":"RepMet: Representative-Based Metric Learning for Classification and Few-Shot Object Detection","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-complex-neural-network","slug":"rethinking-complex-neural-network","title":"Rethinking Complex Neural Network Architectures for Document Classification","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scene-parsing-via-integrated-classification","slug":"scene-parsing-via-integrated-classification","title":"Scene Parsing via Integrated Classification Model and Variance-Based Regularization","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/snu-ids-at-semeval-2019-task-3-addressing","slug":"snu-ids-at-semeval-2019-task-3-addressing","title":"SNU IDS at SemEval-2019 Task 3: Addressing Training-Test Class Distribution Mismatch in Conversational Classification","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stop-propaghate-at-semeval-2019-tasks-5-and-6","slug":"stop-propaghate-at-semeval-2019-tasks-5-and-6","title":"Stop PropagHate at SemEval-2019 Tasks 5 and 6: Are abusive language classification results reproducible?","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structured-knowledge-distillation-for-1","slug":"structured-knowledge-distillation-for-1","title":"Structured Knowledge Distillation for Semantic Segmentation","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/swow-8500-word-association-task-for-intrinsic","slug":"swow-8500-word-association-task-for-intrinsic","title":"SWOW-8500: Word Association task for Intrinsic Evaluation of Word Embeddings","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/visual-attention-consistency-under-image","slug":"visual-attention-consistency-under-image","title":"Visual Attention Consistency Under Image Transforms for Multi-Label Image Classification","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-interpretable-architecture-for-plant","slug":"deep-interpretable-architecture-for-plant","title":"Deep interpretable architecture for plant diseases classification","date":"2019-05-31","arxiv_id":"1905.13523","repositories_listed":1,"syntology":null},{"url":"/paper/fast-solar-image-classification-using-deep","slug":"fast-solar-image-classification-using-deep","title":"Fast Solar Image Classification Using Deep Learning and its Importance for Automation in Solar Physics","date":"2019-05-31","arxiv_id":"1905.13575","repositories_listed":1,"syntology":null},{"url":"/paper/improving-open-information-extraction-via","slug":"improving-open-information-extraction-via","title":"Improving Open Information Extraction via Iterative Rank-Aware Learning","date":"2019-05-31","arxiv_id":"1905.13413","repositories_listed":1,"syntology":null},{"url":"/paper/reverse-kl-divergence-training-of-prior","slug":"reverse-kl-divergence-training-of-prior","title":"Reverse KL-Divergence Training of Prior Networks: Improved Uncertainty and Adversarial Robustness","date":"2019-05-31","arxiv_id":"1905.13472","repositories_listed":1,"syntology":null},{"url":"/paper/subspace-networks-for-few-shot-classification","slug":"subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","arxiv_id":"1905.13613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/subspace-networks-for-few-shot-classification#ran","syntology_url":"https://syntology.ai/paper/1905.13613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13613"}},"official":{"repos":["ArnoutDevos/RegressionNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/particle-filter-recurrent-neural-networks","slug":"particle-filter-recurrent-neural-networks","title":"Particle Filter Recurrent Neural Networks","date":"2019-05-30","arxiv_id":"1905.12885","repositories_listed":1,"syntology":null},{"url":"/paper/quantifying-the-alignment-of-graph-and","slug":"quantifying-the-alignment-of-graph-and","title":"Quantifying the Alignment of Graph and Features in Deep Learning","date":"2019-05-30","arxiv_id":"1905.12921","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/quantifying-the-alignment-of-graph-and#ran","syntology_url":"https://syntology.ai/paper/1905.12921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12921"}},"official":{"repos":["haczqyf/gcn-data-alignment"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerating-monte-carlo-bayesian-inference","slug":"accelerating-monte-carlo-bayesian-inference","title":"Accelerating Monte Carlo Bayesian Inference via Approximating Predictive Uncertainty over Simplex","date":"2019-05-29","arxiv_id":"1905.12194","repositories_listed":1,"syntology":null},{"url":"/paper/an-adaptive-nearest-neighbor-rule-for","slug":"an-adaptive-nearest-neighbor-rule-for","title":"An adaptive nearest neighbor rule for classification","date":"2019-05-29","arxiv_id":"1905.12717","repositories_listed":1,"syntology":null},{"url":"/paper/graph-learning-network-a-structure-learning-1","slug":"graph-learning-network-a-structure-learning-1","title":"Graph Learning Network: A Structure Learning Algorithm","date":"2019-05-29","arxiv_id":"1905.12665","repositories_listed":1,"syntology":null},{"url":"/paper/vector-valued-graph-trend-filtering-with-non","slug":"vector-valued-graph-trend-filtering-with-non","title":"Vector-Valued Graph Trend Filtering with Non-Convex Penalties","date":"2019-05-29","arxiv_id":"1905.12692","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-extreme-classification-via","slug":"accelerating-extreme-classification-via","title":"Accelerating Extreme Classification via Adaptive Feature Agglomeration","date":"2019-05-28","arxiv_id":"1905.11769","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-gradient-clipping-and-adaptive","slug":"analysis-of-gradient-clipping-and-adaptive","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","date":"2019-05-28","arxiv_id":"1905.11881","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/analysis-of-gradient-clipping-and-adaptive#ran","syntology_url":"https://syntology.ai/paper/1905.11881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11881"}},"official":{"repos":["JingzhaoZhang/why-clipping-accelerates"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-nonparametric-federated-learning-of","slug":"bayesian-nonparametric-federated-learning-of","title":"Bayesian Nonparametric Federated Learning of Neural Networks","date":"2019-05-28","arxiv_id":"1905.12022","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bayesian-nonparametric-federated-learning-of#ran","syntology_url":"https://syntology.ai/paper/1905.12022","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12022"}},"official":{"repos":["IBM/probabilistic-federated-neural-matching"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/better-long-range-dependency-by-bootstrapping","slug":"better-long-range-dependency-by-bootstrapping","title":"Better Long-Range Dependency By Bootstrapping A Mutual Information Regularizer","date":"2019-05-28","arxiv_id":"1905.11978","repositories_listed":1,"syntology":null},{"url":"/paper/brain-signal-classification-via-learning","slug":"brain-signal-classification-via-learning","title":"EEG-based Emotional Video Classification via Learning Connectivity Structure","date":"2019-05-28","arxiv_id":"1905.11678","repositories_listed":1,"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/brain-signal-classification-via-learning#ran","syntology_url":"https://syntology.ai/paper/1905.11678","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11678"}},"official":{"repos":["ELEMKEP/bsc_lcs"],"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/differential-privacy-has-disparate-impact-on","slug":"differential-privacy-has-disparate-impact-on","title":"Differential Privacy Has Disparate Impact on Model Accuracy","date":"2019-05-28","arxiv_id":"1905.12101","repositories_listed":1,"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/differential-privacy-has-disparate-impact-on#ran","syntology_url":"https://syntology.ai/paper/1905.12101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12101"}},"official":{"repos":["ebagdasa/differential-privacy-vs-fairness"],"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/efficient-wrapper-feature-selection-using","slug":"efficient-wrapper-feature-selection-using","title":"Efficient Wrapper Feature Selection using Autoencoder and Model Based Elimination","date":"2019-05-28","arxiv_id":"1905.11592","repositories_listed":1,"syntology":null},{"url":"/paper/hallucinating-optical-flow-features-for-video","slug":"hallucinating-optical-flow-features-for-video","title":"Hallucinating Optical Flow Features for Video Classification","date":"2019-05-28","arxiv_id":"1905.11799","repositories_listed":1,"syntology":null},{"url":"/paper/leap-lstm-enhancing-long-short-term-memory","slug":"leap-lstm-enhancing-long-short-term-memory","title":"Leap-LSTM: Enhancing Long Short-Term Memory for Text Categorization","date":"2019-05-28","arxiv_id":"1905.11558","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-quantification-for-classification","slug":"robustness-quantification-for-classification","title":"Adversarial Robustness Guarantees for Classification with Gaussian Processes","date":"2019-05-28","arxiv_id":"1905.11876","repositories_listed":1,"syntology":null},{"url":"/paper/divide-and-conquer-adversarial-detection","slug":"divide-and-conquer-adversarial-detection","title":"GAT: Generative Adversarial Training for Adversarial Example Detection and Robust Classification","date":"2019-05-27","arxiv_id":"1905.11475","repositories_listed":1,"syntology":null},{"url":"/paper/graph-filtration-learning","slug":"graph-filtration-learning","title":"Graph Filtration Learning","date":"2019-05-27","arxiv_id":"1905.10996","repositories_listed":1,"syntology":null},{"url":"/paper/on-asymptotic-behaviors-of-graph-cnns-from","slug":"on-asymptotic-behaviors-of-graph-cnns-from","title":"Graph Neural Networks Exponentially Lose Expressive Power for Node Classification","date":"2019-05-27","arxiv_id":"1905.10947","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":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/on-asymptotic-behaviors-of-graph-cnns-from#ran","syntology_url":"https://syntology.ai/paper/1905.10947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10947"}},"official":{"repos":["delta2323/gnn-asymptotics"],"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/radial-prediction-layer","slug":"radial-prediction-layer","title":"Radial Prediction Layer","date":"2019-05-27","arxiv_id":"1905.11150","repositories_listed":1,"syntology":null},{"url":"/paper/hyperbolic-interaction-model-for-hierarchical","slug":"hyperbolic-interaction-model-for-hierarchical","title":"Hyperbolic Interaction Model For Hierarchical Multi-Label Classification","date":"2019-05-26","arxiv_id":"1905.10802","repositories_listed":1,"syntology":null},{"url":"/paper/why-do-these-match-explaining-the-behavior-of","slug":"why-do-these-match-explaining-the-behavior-of","title":"Why do These Match? Explaining the Behavior of Image Similarity Models","date":"2019-05-26","arxiv_id":"1905.10797","repositories_listed":1,"syntology":null},{"url":"/paper/average-individual-fairness-algorithms","slug":"average-individual-fairness-algorithms","title":"Average Individual Fairness: Algorithms, Generalization and Experiments","date":"2019-05-25","arxiv_id":"1905.10607","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/average-individual-fairness-algorithms#ran","syntology_url":"https://syntology.ai/paper/1905.10607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10607"}},"official":{"repos":["SaeedSharifiMa/AIF"],"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/bivariate-beta-lstm","slug":"bivariate-beta-lstm","title":"Bivariate Beta-LSTM","date":"2019-05-25","arxiv_id":"1905.10521","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/bivariate-beta-lstm#ran","syntology_url":"https://syntology.ai/paper/1905.10521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10521"}},"official":{"repos":["gtshs2/BetaLSTM"],"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-a-single-vector-enough-exploring-node","slug":"is-a-single-vector-enough-exploring-node","title":"Is a Single Vector Enough? Exploring Node Polysemy for Network Embedding","date":"2019-05-25","arxiv_id":"1905.10668","repositories_listed":1,"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/is-a-single-vector-enough-exploring-node#ran","syntology_url":"https://syntology.ai/paper/1905.10668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10668"}},"official":null}},{"url":"/paper/induction-of-non-monotonic-rules-from","slug":"induction-of-non-monotonic-rules-from","title":"Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Mining","date":"2019-05-24","arxiv_id":"1905.11226","repositories_listed":1,"syntology":null},{"url":"/paper/label-aware-document-representation-via","slug":"label-aware-document-representation-via","title":"Label-aware Document Representation via Hybrid Attention for Extreme Multi-Label Text Classification","date":"2019-05-24","arxiv_id":"1905.10070","repositories_listed":1,"syntology":null},{"url":"/paper/painless-stochastic-gradient-interpolation","slug":"painless-stochastic-gradient-interpolation","title":"Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates","date":"2019-05-24","arxiv_id":"1905.09997","repositories_listed":1,"syntology":null},{"url":"/paper/a-direct-approach-to-robust-deep-learning-1","slug":"a-direct-approach-to-robust-deep-learning-1","title":"A Direct Approach to Robust Deep Learning Using Adversarial Networks","date":"2019-05-23","arxiv_id":"1905.09591","repositories_listed":1,"syntology":{"n":15,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":12,"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) · 12 unverified","sample_list":"/paper/a-direct-approach-to-robust-deep-learning-1#ran","syntology_url":"https://syntology.ai/paper/1905.09591","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09591"}},"official":{"repos":["whxbergkamp/RobustDL_GAN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-gnn-on-few-shot-node-classification-in","slug":"meta-gnn-on-few-shot-node-classification-in","title":"Meta-GNN: On Few-shot Node Classification in Graph Meta-learning","date":"2019-05-23","arxiv_id":"1905.09718","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-reminding-for-continual-learning","slug":"prototype-reminding-for-continual-learning","title":"Variational Prototype Replays for Continual Learning","date":"2019-05-23","arxiv_id":"1905.09447","repositories_listed":1,"syntology":null},{"url":"/paper/robust-motion-segmentation-from-pairwise","slug":"robust-motion-segmentation-from-pairwise","title":"Robust Motion Segmentation from Pairwise Matches","date":"2019-05-22","arxiv_id":"1905.09043","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-application-oriented-study-of-1","slug":"a-comprehensive-application-oriented-study-of-1","title":"A comprehensive, application-oriented study of catastrophic forgetting in DNNs","date":"2019-05-20","arxiv_id":"1905.08101","repositories_listed":1,"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/a-comprehensive-application-oriented-study-of-1#ran","syntology_url":"https://syntology.ai/paper/1905.08101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.08101"}},"official":null}},{"url":"/paper/target-based-speech-act-classification-in","slug":"target-based-speech-act-classification-in","title":"Target Based Speech Act Classification in Political Campaign Text","date":"2019-05-20","arxiv_id":"1905.07856","repositories_listed":1,"syntology":null}],"record_sha256":"b93ab2ed45f9e9fb7a185dd5b6bdbf904b673754376c293628c6952f7848e6d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}