{"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/binary-classification/papers/6","list_of":"/task/binary-classification","task":"Binary 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":6,"pages_in_order":26,"rows_per_page":100,"rows":[501,600],"of":2574,"counts":{"archive_papers_tagged":2574,"with_a_code_link":710,"where_syntology_ran_a_sample":115,"not_listed_spam_title":0,"listed":2574,"listed_where_code_ran":115,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":100,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":100,"listed_every_run_a_failure_of_syntologys_instrument":15,"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/binary-classification","prev":"/task/binary-classification/papers/5","next":"/task/binary-classification/papers/7","papers":[{"url":"/paper/clinical-relation-extraction-using","slug":"clinical-relation-extraction-using","title":"Clinical Relation Extraction Using Transformer-based Models","date":"2021-07-19","arxiv_id":"2107.08957","repositories_listed":1,"syntology":null},{"url":"/paper/regularized-classification-aware-quantization","slug":"regularized-classification-aware-quantization","title":"Regularized Classification-Aware Quantization","date":"2021-07-12","arxiv_id":"2107.09716","repositories_listed":1,"syntology":null},{"url":"/paper/ls3-latent-space-safe-sets-for-long-horizon","slug":"ls3-latent-space-safe-sets-for-long-horizon","title":"LS3: Latent Space Safe Sets for Long-Horizon Visuomotor Control of Sparse Reward Iterative Tasks","date":"2021-07-10","arxiv_id":"2107.04775","repositories_listed":1,"syntology":null},{"url":"/paper/prediction-of-concept-lengths-for-fast","slug":"prediction-of-concept-lengths-for-fast","title":"Learning Concept Lengths Accelerates Concept Learning in ALC","date":"2021-07-10","arxiv_id":"2107.04911","repositories_listed":1,"syntology":null},{"url":"/paper/splitavg-a-heterogeneity-aware-federated-deep","slug":"splitavg-a-heterogeneity-aware-federated-deep","title":"SplitAVG: A heterogeneity-aware federated deep learning method for medical imaging","date":"2021-07-06","arxiv_id":"2107.02375","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-theory-for-imbalanced-binary","slug":"statistical-theory-for-imbalanced-binary","title":"Optimal Binary Classification Beyond Accuracy","date":"2021-07-05","arxiv_id":"2107.01777","repositories_listed":1,"syntology":null},{"url":"/paper/ucsl-a-machine-learning-expectation","slug":"ucsl-a-machine-learning-expectation","title":"UCSL : A Machine Learning Expectation-Maximization framework for Unsupervised Clustering driven by Supervised Learning","date":"2021-07-05","arxiv_id":"2107.01988","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/ucsl-a-machine-learning-expectation#ran","syntology_url":"https://syntology.ai/paper/2107.01988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01988"}},"official":{"repos":["neurospin-projects/2021_rlouiset_ucsl"],"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/sentiment-analysis-for-urdu-online-reviews","slug":"sentiment-analysis-for-urdu-online-reviews","title":"Sentiment analysis for Urdu online reviews using deep learning models","date":"2021-06-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-network-interpretability-for","slug":"neural-network-interpretability-for","title":"Neural network interpretability for forecasting of aggregated renewable generation","date":"2021-06-19","arxiv_id":"2106.10476","repositories_listed":1,"syntology":null},{"url":"/paper/probing-pre-trained-language-models-for","slug":"probing-pre-trained-language-models-for","title":"Probing Pre-Trained Language Models for Disease Knowledge","date":"2021-06-14","arxiv_id":"2106.07285","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-adversarial-negative-responses","slug":"synthesizing-adversarial-negative-responses","title":"Synthesizing Adversarial Negative Responses for Robust Response Ranking and Evaluation","date":"2021-06-10","arxiv_id":"2106.05894","repositories_listed":1,"syntology":null},{"url":"/paper/improvement-over-pinball-loss-support-vector","slug":"improvement-over-pinball-loss-support-vector","title":"Improvement over Pinball Loss Support Vector Machine","date":"2021-06-02","arxiv_id":"2106.01109","repositories_listed":1,"syntology":null},{"url":"/paper/cisco-at-semeval-2021-task-5-what-s-toxic","slug":"cisco-at-semeval-2021-task-5-what-s-toxic","title":"Cisco at SemEval-2021 Task 5: What's Toxic?: Leveraging Transformers for Multiple Toxic Span Extraction from Online Comments","date":"2021-05-28","arxiv_id":"2105.13959","repositories_listed":1,"syntology":null},{"url":"/paper/visitron-visual-semantics-aligned","slug":"visitron-visual-semantics-aligned","title":"VISITRON: Visual Semantics-Aligned Interactively Trained Object-Navigator","date":"2021-05-25","arxiv_id":"2105.11589","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/visitron-visual-semantics-aligned#ran","syntology_url":"https://syntology.ai/paper/2105.11589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11589"}},"official":{"repos":["alexa/visitron"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/negational-symmetry-of-quantum-neural","slug":"negational-symmetry-of-quantum-neural","title":"Negational Symmetry of Quantum Neural Networks for Binary Pattern Classification","date":"2021-05-20","arxiv_id":"2105.09580","repositories_listed":1,"syntology":null},{"url":"/paper/diff-resnets-for-few-shot-learning-an-ode","slug":"diff-resnets-for-few-shot-learning-an-ode","title":"Diffusion Mechanism in Residual Neural Network: Theory and Applications","date":"2021-05-07","arxiv_id":"2105.03155","repositories_listed":1,"syntology":null},{"url":"/paper/pairwise-fairness-for-ordinal-regression","slug":"pairwise-fairness-for-ordinal-regression","title":"Pairwise Fairness for Ordinal Regression","date":"2021-05-07","arxiv_id":"2105.03153","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pairwise-fairness-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/2105.03153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03153"}},"official":{"repos":["amazon-research/fair-ordinal-regression"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaboost-and-robust-one-bit-compressed","slug":"adaboost-and-robust-one-bit-compressed","title":"AdaBoost and robust one-bit compressed sensing","date":"2021-05-05","arxiv_id":"2105.02083","repositories_listed":1,"syntology":null},{"url":"/paper/deep-neural-network-as-an-alternative-to","slug":"deep-neural-network-as-an-alternative-to","title":"Deep Neural Network as an alternative to Boosted Decision Trees for PID","date":"2021-04-28","arxiv_id":"2104.14045","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-spatial-reasoning-on-multi-view","slug":"contrastive-spatial-reasoning-on-multi-view","title":"Self-supervised Spatial Reasoning on Multi-View Line Drawings","date":"2021-04-27","arxiv_id":"2104.13433","repositories_listed":1,"syntology":null},{"url":"/paper/constructing-long-short-stock-portfolio-with","slug":"constructing-long-short-stock-portfolio-with","title":"Constructing long-short stock portfolio with a new listwise learn-to-rank algorithm","date":"2021-04-26","arxiv_id":"2104.12484","repositories_listed":1,"syntology":null},{"url":"/paper/qmul-sds-at-sciver-step-by-step-binary","slug":"qmul-sds-at-sciver-step-by-step-binary","title":"QMUL-SDS at SCIVER: Step-by-Step Binary Classification for Scientific Claim Verification","date":"2021-04-23","arxiv_id":"2104.11572","repositories_listed":1,"syntology":null},{"url":"/paper/seed-word-selection-for-weakly-supervised","slug":"seed-word-selection-for-weakly-supervised","title":"Seed Word Selection for Weakly-Supervised Text Classification with Unsupervised Error Estimation","date":"2021-04-20","arxiv_id":"2104.09765","repositories_listed":1,"syntology":null},{"url":"/paper/uvce-iiitt-dravidianlangtech-eacl2021-tamil","slug":"uvce-iiitt-dravidianlangtech-eacl2021-tamil","title":"UVCE-IIITT@DravidianLangTech-EACL2021: Tamil Troll Meme Classification: You need to Pay more Attention","date":"2021-04-19","arxiv_id":"2104.09081","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-of-graph-based-approaches-for-semi","slug":"a-study-of-graph-based-approaches-for-semi","title":"An Empirical Study of Graph-Based Approaches for Semi-Supervised Time Series Classification","date":"2021-04-16","arxiv_id":"2104.08153","repositories_listed":1,"syntology":null},{"url":"/paper/bert-based-transformers-lead-the-way-in","slug":"bert-based-transformers-lead-the-way-in","title":"BERT based Transformers lead the way in Extraction of Health Information from Social Media","date":"2021-04-15","arxiv_id":"2104.07367","repositories_listed":1,"syntology":null},{"url":"/paper/conclusive-local-interpretation-rules-for","slug":"conclusive-local-interpretation-rules-for","title":"Conclusive Local Interpretation Rules for Random Forests","date":"2021-04-13","arxiv_id":"2104.06040","repositories_listed":1,"syntology":null},{"url":"/paper/sentiment-based-candidate-selection-for-nmt","slug":"sentiment-based-candidate-selection-for-nmt","title":"Sentiment-based Candidate Selection for NMT","date":"2021-04-10","arxiv_id":"2104.04840","repositories_listed":1,"syntology":null},{"url":"/paper/concentration-bounds-for-the-empirical","slug":"concentration-bounds-for-the-empirical","title":"Concentration bounds for the empirical angular measure with statistical learning applications","date":"2021-04-07","arxiv_id":"2104.03966","repositories_listed":1,"syntology":null},{"url":"/paper/an-expert-annotated-dataset-for-the-detection","slug":"an-expert-annotated-dataset-for-the-detection","title":"An Expert Annotated Dataset for the Detection of Online Misogyny","date":"2021-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-representation-learning-for","slug":"benchmarking-representation-learning-for","title":"Benchmarking Representation Learning for Natural World Image Collections","date":"2021-03-30","arxiv_id":"2103.16483","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/benchmarking-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2103.16483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16483"}},"official":{"repos":["visipedia/newt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/score-oriented-loss-sol-functions","slug":"score-oriented-loss-sol-functions","title":"Score-oriented loss (SOL) functions","date":"2021-03-29","arxiv_id":"2103.15522","repositories_listed":1,"syntology":null},{"url":"/paper/fbcnet-a-multi-view-convolutional-neural","slug":"fbcnet-a-multi-view-convolutional-neural","title":"FBCNet: A Multi-view Convolutional Neural Network for Brain-Computer Interface","date":"2021-03-17","arxiv_id":"2104.01233","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/fbcnet-a-multi-view-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/2104.01233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01233"}},"official":{"repos":["ravikiran-mane/FBCNet"],"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/robust-model-compression-using-deep","slug":"robust-model-compression-using-deep","title":"Robust Model Compression Using Deep Hypotheses","date":"2021-03-13","arxiv_id":"2103.07668","repositories_listed":1,"syntology":null},{"url":"/paper/multi-attentional-deepfake-detection","slug":"multi-attentional-deepfake-detection","title":"Multi-attentional Deepfake Detection","date":"2021-03-03","arxiv_id":"2103.02406","repositories_listed":1,"syntology":{"n":25,"n_ran":20,"n_constructed":10,"n_ran_checked":17,"n_instrument":3,"n_unverified":5,"n_honours":3,"n_violates":0,"n_no_contract":14,"n_pointer_only":25,"phrase":"20 ran (of which 10 constructed an object rather than computing a result; 17 with no instrument failure: 3 honoured, 0 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/multi-attentional-deepfake-detection#ran","syntology_url":"https://syntology.ai/paper/2103.02406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02406"}},"official":{"repos":["yoctta/multiple-attention"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":10,"n_ran_no_instrument_failure":17,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-zero-shot-and-open-set-visual","slug":"counterfactual-zero-shot-and-open-set-visual","title":"Counterfactual Zero-Shot and Open-Set Visual Recognition","date":"2021-03-01","arxiv_id":"2103.00887","repositories_listed":1,"syntology":null},{"url":"/paper/fermi-fair-empirical-risk-minimization-via","slug":"fermi-fair-empirical-risk-minimization-via","title":"A Stochastic Optimization Framework for Fair Risk Minimization","date":"2021-02-24","arxiv_id":"2102.12586","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/fermi-fair-empirical-risk-minimization-via#ran","syntology_url":"https://syntology.ai/paper/2102.12586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12586"}},"official":{"repos":["optimization-for-data-driven-science/FERMI"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/expanding-boundaries-of-gap-safe-screening","slug":"expanding-boundaries-of-gap-safe-screening","title":"Expanding boundaries of Gap Safe screening","date":"2021-02-22","arxiv_id":"2102.10846","repositories_listed":1,"syntology":null},{"url":"/paper/constrained-optimization-for-training-deep","slug":"constrained-optimization-for-training-deep","title":"Constrained Optimization to Train Neural Networks on Critical and Under-Represented Classes","date":"2021-02-21","arxiv_id":"2102.12894","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/constrained-optimization-for-training-deep#ran","syntology_url":"https://syntology.ai/paper/2102.12894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12894"}},"official":{"repos":["salusanga/alm-dnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/intrapapillary-capillary-loop-classification","slug":"intrapapillary-capillary-loop-classification","title":"Intrapapillary Capillary Loop Classification in Magnification Endoscopy: Open Dataset and Baseline Methodology","date":"2021-02-19","arxiv_id":"2102.09963","repositories_listed":1,"syntology":null},{"url":"/paper/bore-bayesian-optimization-by-density-ratio","slug":"bore-bayesian-optimization-by-density-ratio","title":"BORE: Bayesian Optimization by Density-Ratio Estimation","date":"2021-02-17","arxiv_id":"2102.09009","repositories_listed":1,"syntology":null},{"url":"/paper/stateconet-statistical-ecology-neural","slug":"stateconet-statistical-ecology-neural","title":"StatEcoNet: Statistical Ecology Neural Networks for Species Distribution Modeling","date":"2021-02-17","arxiv_id":"2102.08534","repositories_listed":1,"syntology":null},{"url":"/paper/the-melodic-family-for-simultaneous-binary","slug":"the-melodic-family-for-simultaneous-binary","title":"The MELODIC family for simultaneous binary logistic regression in a reduced space","date":"2021-02-16","arxiv_id":"2102.08232","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-based-approaches-for-breast","slug":"machine-learning-based-approaches-for-breast","title":"Machine Learning-Based Approaches For Breast Cancer Detection in Microwave Imaging","date":"2021-02-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/classifier-calibration-with-implications-to","slug":"classifier-calibration-with-implications-to","title":"Classifier Calibration: with application to threat scores in cybersecurity","date":"2021-02-09","arxiv_id":"2102.05143","repositories_listed":1,"syntology":null},{"url":"/paper/estimation-and-applications-of-quantiles-in","slug":"estimation-and-applications-of-quantiles-in","title":"Estimation and Applications of Quantiles in Deep Binary Classification","date":"2021-02-09","arxiv_id":"2102.06575","repositories_listed":1,"syntology":null},{"url":"/paper/binary-classification-from-multiple-unlabeled","slug":"binary-classification-from-multiple-unlabeled","title":"Binary Classification from Multiple Unlabeled Datasets via Surrogate Set Classification","date":"2021-02-01","arxiv_id":"2102.00678","repositories_listed":1,"syntology":null},{"url":"/paper/malware-detection-using-frequency-domain","slug":"malware-detection-using-frequency-domain","title":"Malware Detection Using Frequency Domain-Based Image Visualization and Deep Learning","date":"2021-01-26","arxiv_id":"2101.10578","repositories_listed":1,"syntology":null},{"url":"/paper/gigapixel-histopathological-image-analysis","slug":"gigapixel-histopathological-image-analysis","title":"Gigapixel Histopathological Image Analysis using Attention-based Neural Networks","date":"2021-01-25","arxiv_id":"2101.09992","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-online-and-offline-accuracy","slug":"evaluating-online-and-offline-accuracy","title":"Evaluating Online and Offline Accuracy Traversal Algorithms for k-Complete Neural Network Architectures","date":"2021-01-16","arxiv_id":"2101.06518","repositories_listed":1,"syntology":null},{"url":"/paper/towards-searching-efficient-and-accurate","slug":"towards-searching-efficient-and-accurate","title":"Towards Searching Efficient and Accurate Neural Network Architectures in Binary Classification Problems","date":"2021-01-16","arxiv_id":"2101.06511","repositories_listed":1,"syntology":null},{"url":"/paper/combating-hostility-covid-19-fake-news-and","slug":"combating-hostility-covid-19-fake-news-and","title":"Combating Hostility: Covid-19 Fake News and Hostile Post Detection in Social Media","date":"2021-01-09","arxiv_id":"2101.03291","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-approach-for-quantum-non","slug":"machine-learning-approach-for-quantum-non","title":"Machine learning classification of non-Markovian noise disturbing quantum dynamics","date":"2021-01-08","arxiv_id":"2101.03221","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-cost-sensitive-and-neyman-pearson","slug":"bridging-cost-sensitive-and-neyman-pearson","title":"Bridging Cost-sensitive and Neyman-Pearson Paradigms for Asymmetric Binary Classification","date":"2020-12-29","arxiv_id":"2012.14951","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-hate-speech-in-multi-modal-memes","slug":"detecting-hate-speech-in-multi-modal-memes","title":"Detecting Hate Speech in Multi-modal Memes","date":"2020-12-29","arxiv_id":"2012.14891","repositories_listed":1,"syntology":null},{"url":"/paper/on-using-classification-datasets-to-evaluate","slug":"on-using-classification-datasets-to-evaluate","title":"On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insights","date":"2020-12-23","arxiv_id":"2012.12931","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-using-classification-datasets-to-evaluate#ran","syntology_url":"https://syntology.ai/paper/2012.12931","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.12931"}},"official":{"repos":["LingxiaoShawn/GLOD-Issues"],"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/a-unified-framework-for-closed-form","slug":"a-unified-framework-for-closed-form","title":"A unified framework for closed-form nonparametric regression, classification, preference and mixed problems with Skew Gaussian Processes","date":"2020-12-12","arxiv_id":"2012.06846","repositories_listed":1,"syntology":null},{"url":"/paper/isikun-at-the-fincausal-2020-linguistically","slug":"isikun-at-the-fincausal-2020-linguistically","title":"ISIKUN at the FinCausal 2020: Linguistically informed Machine-learning Approach for Causality Identification in Financial Documents","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/similarity-or-deeper-understanding-analyzing","slug":"similarity-or-deeper-understanding-analyzing","title":"Similarity or deeper understanding? Analyzing the TED-Q dataset of evoked questions","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/task-aware-representation-of-sentences-for","slug":"task-aware-representation-of-sentences-for","title":"Task-Aware Representation of Sentences for Generic Text Classification","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/anomalous-sound-detection-as-a-simple-binary","slug":"anomalous-sound-detection-as-a-simple-binary","title":"Anomalous Sound Detection as a Simple Binary Classification Problem with Careful Selection of Proxy Outlier Examples","date":"2020-11-05","arxiv_id":"2011.02949","repositories_listed":1,"syntology":null},{"url":"/paper/datamafia-at-wnut-2020-task-2-a-study-of-pre","slug":"datamafia-at-wnut-2020-task-2-a-study-of-pre","title":"DATAMAFIA at WNUT-2020 Task 2: A Study of Pre-trained Language Models along with Regularization Techniques for Downstream Tasks","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-3d-classification-of-chest","slug":"weakly-supervised-3d-classification-of-chest","title":"Weakly Supervised 3D Classification of Chest CT using Aggregated Multi-Resolution Deep Segmentation Features","date":"2020-10-31","arxiv_id":"2011.00149","repositories_listed":1,"syntology":null},{"url":"/paper/an-algorithm-for-learning-smaller","slug":"an-algorithm-for-learning-smaller","title":"An Algorithm for Learning Smaller Representations of Models With Scarce Data","date":"2020-10-15","arxiv_id":"2010.07990","repositories_listed":1,"syntology":null},{"url":"/paper/xl-wic-a-multilingual-benchmark-for","slug":"xl-wic-a-multilingual-benchmark-for","title":"XL-WiC: A Multilingual Benchmark for Evaluating Semantic Contextualization","date":"2020-10-13","arxiv_id":"2010.06478","repositories_listed":1,"syntology":null},{"url":"/paper/learning-which-features-matter-roberta","slug":"learning-which-features-matter-roberta","title":"Learning Which Features Matter: RoBERTa Acquires a Preference for Linguistic Generalizations (Eventually)","date":"2020-10-11","arxiv_id":"2010.05358","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-systematic-literature-reviews-with","slug":"scaling-systematic-literature-reviews-with","title":"Scaling Systematic Literature Reviews with Machine Learning Pipelines","date":"2020-10-09","arxiv_id":"2010.04665","repositories_listed":1,"syntology":null},{"url":"/paper/learning-by-minimizing-the-sum-of-ranked","slug":"learning-by-minimizing-the-sum-of-ranked","title":"Learning by Minimizing the Sum of Ranked Range","date":"2020-10-05","arxiv_id":"2010.01741","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-by-minimizing-the-sum-of-ranked#ran","syntology_url":"https://syntology.ai/paper/2010.01741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01741"}},"official":{"repos":["discovershu/SoRR"],"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/understanding-tables-with-intermediate-pre","slug":"understanding-tables-with-intermediate-pre","title":"Understanding tables with intermediate pre-training","date":"2020-10-01","arxiv_id":"2010.00571","repositories_listed":1,"syntology":null},{"url":"/paper/do-response-selection-models-really-know-what","slug":"do-response-selection-models-really-know-what","title":"Do Response Selection Models Really Know What's Next? Utterance Manipulation Strategies for Multi-turn Response Selection","date":"2020-09-10","arxiv_id":"2009.04703","repositories_listed":1,"syntology":null},{"url":"/paper/binary-classification-as-a-phase-separation","slug":"binary-classification-as-a-phase-separation","title":"Binary Classification as a Phase Separation Process","date":"2020-09-05","arxiv_id":"2009.02467","repositories_listed":1,"syntology":null},{"url":"/paper/qutnocturnal-hasoc-19-cnn-for-hate-speech-and","slug":"qutnocturnal-hasoc-19-cnn-for-hate-speech-and","title":"QutNocturnal@HASOC'19: CNN for Hate Speech and Offensive Content Identification in Hindi Language","date":"2020-08-28","arxiv_id":"2008.12448","repositories_listed":1,"syntology":null},{"url":"/paper/the-effects-of-skin-lesion-segmentation-on","slug":"the-effects-of-skin-lesion-segmentation-on","title":"The Effects of Skin Lesion Segmentation on the Performance of Dermatoscopic Image Classification","date":"2020-08-28","arxiv_id":"2008.12602","repositories_listed":1,"syntology":null},{"url":"/paper/propensity-to-pay-machine-learning-for","slug":"propensity-to-pay-machine-learning-for","title":"Propensity-to-Pay: Machine Learning for Estimating Prediction Uncertainty","date":"2020-08-27","arxiv_id":"2008.12065","repositories_listed":1,"syntology":null},{"url":"/paper/on-transversality-of-bent-hyperplane","slug":"on-transversality-of-bent-hyperplane","title":"On transversality of bent hyperplane arrangements and the topological expressiveness of ReLU neural networks","date":"2020-08-20","arxiv_id":"2008.09052","repositories_listed":1,"syntology":null},{"url":"/paper/towards-adversarial-robustness-with-01-loss","slug":"towards-adversarial-robustness-with-01-loss","title":"Towards adversarial robustness with 01 loss neural networks","date":"2020-08-20","arxiv_id":"2008.09148","repositories_listed":1,"syntology":null},{"url":"/paper/rfnet-riemannian-fusion-network-for-eeg-based","slug":"rfnet-riemannian-fusion-network-for-eeg-based","title":"Spatio-Temporal EEG Representation Learning on Riemannian Manifold and Euclidean Space","date":"2020-08-19","arxiv_id":"2008.08633","repositories_listed":1,"syntology":null},{"url":"/paper/can-i-pour-into-it-robot-imagining-open","slug":"can-i-pour-into-it-robot-imagining-open","title":"Can I Pour into It? Robot Imagining Open Containability Affordance of Previously Unseen Objects via Physical Simulations","date":"2020-08-05","arxiv_id":"2008.02321","repositories_listed":1,"syntology":null},{"url":"/paper/dopant-network-processing-units-towards","slug":"dopant-network-processing-units-towards","title":"Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes","date":"2020-07-24","arxiv_id":"2007.12371","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-balanced-loss-for-multi-label","slug":"distribution-balanced-loss-for-multi-label","title":"Distribution-Balanced Loss for Multi-Label Classification in Long-Tailed Datasets","date":"2020-07-19","arxiv_id":"2007.09654","repositories_listed":1,"syntology":null},{"url":"/paper/robust-bayesian-classification-using-an","slug":"robust-bayesian-classification-using-an","title":"Robust Bayesian Classification Using an Optimistic Score Ratio","date":"2020-07-08","arxiv_id":"2007.04458","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/robust-bayesian-classification-using-an#ran","syntology_url":"https://syntology.ai/paper/2007.04458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04458"}},"official":{"repos":["nian-si/bsc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/consistent-structured-prediction-with-max-min","slug":"consistent-structured-prediction-with-max-min","title":"Consistent Structured Prediction with Max-Min Margin Markov Networks","date":"2020-07-02","arxiv_id":"2007.01012","repositories_listed":1,"syntology":null},{"url":"/paper/second-order-pac-bayesian-bounds-for-the","slug":"second-order-pac-bayesian-bounds-for-the","title":"Second Order PAC-Bayesian Bounds for the Weighted Majority Vote","date":"2020-07-01","arxiv_id":"2007.13532","repositories_listed":1,"syntology":null},{"url":"/paper/dynamically-mitigating-data-discrepancy-with","slug":"dynamically-mitigating-data-discrepancy-with","title":"Dynamically Mitigating Data Discrepancy with Balanced Focal Loss for Replay Attack Detection","date":"2020-06-25","arxiv_id":"2006.14563","repositories_listed":1,"syntology":null},{"url":"/paper/mantra-a-machine-learning-reference","slug":"mantra-a-machine-learning-reference","title":"MANTRA: A Machine Learning reference lightcurve dataset for astronomical transient event recognition","date":"2020-06-23","arxiv_id":"2006.13163","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-free-binary-classification","slug":"distribution-free-binary-classification","title":"Distribution-free binary classification: prediction sets, confidence intervals and calibration","date":"2020-06-18","arxiv_id":"2006.10564","repositories_listed":1,"syntology":null},{"url":"/paper/analysing-risk-of-coronary-heart-disease","slug":"analysing-risk-of-coronary-heart-disease","title":"Analysing Risk of Coronary Heart Disease through Discriminative Neural Networks","date":"2020-06-17","arxiv_id":"2008.02731","repositories_listed":1,"syntology":null},{"url":"/paper/signed-graph-metric-learning-via-gershgorin","slug":"signed-graph-metric-learning-via-gershgorin","title":"Signed Graph Metric Learning via Gershgorin Disc Perfect Alignment","date":"2020-06-15","arxiv_id":"2006.08816","repositories_listed":1,"syntology":null},{"url":"/paper/vietnamese-word-segmentation-with-svm","slug":"vietnamese-word-segmentation-with-svm","title":"Vietnamese Word Segmentation with SVM: Ambiguity Reduction and Suffix Capture","date":"2020-06-14","arxiv_id":"2006.07804","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-gradient-methods-converge-faster","slug":"adaptive-gradient-methods-converge-faster","title":"Adaptive Gradient Methods Converge Faster with Over-Parameterization (but you should do a line-search)","date":"2020-06-11","arxiv_id":"2006.06835","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-gradient-methods-converge-faster#ran","syntology_url":"https://syntology.ai/paper/2006.06835","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06835"}},"official":null}},{"url":"/paper/mc-bert-efficient-language-pre-training-via-a","slug":"mc-bert-efficient-language-pre-training-via-a","title":"MC-BERT: Efficient Language Pre-Training via a Meta Controller","date":"2020-06-10","arxiv_id":"2006.05744","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mc-bert-efficient-language-pre-training-via-a#ran","syntology_url":"https://syntology.ai/paper/2006.05744","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05744"}},"official":{"repos":["MC-BERT/MC-BERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-baseline-for-shapely-values-in-mlps-from","slug":"a-baseline-for-shapely-values-in-mlps-from","title":"A Baseline for Shapley Values in MLPs: from Missingness to Neutrality","date":"2020-06-08","arxiv_id":"2006.04896","repositories_listed":1,"syntology":null},{"url":"/paper/solution-path-algorithm-for-twin-multi-class","slug":"solution-path-algorithm-for-twin-multi-class","title":"Solution Path Algorithm for Twin Multi-class Support Vector Machine","date":"2020-05-30","arxiv_id":"2006.00276","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-detection-meets-transfer","slug":"counterfactual-detection-meets-transfer","title":"Counterfactual Detection meets Transfer Learning","date":"2020-05-27","arxiv_id":"2005.13125","repositories_listed":1,"syntology":null},{"url":"/paper/language-representation-models-for-fine","slug":"language-representation-models-for-fine","title":"Language Representation Models for Fine-Grained Sentiment Classification","date":"2020-05-27","arxiv_id":"2005.13619","repositories_listed":1,"syntology":null},{"url":"/paper/modularizing-deep-learning-via-pairwise","slug":"modularizing-deep-learning-via-pairwise","title":"Modularizing Deep Learning via Pairwise Learning With Kernels","date":"2020-05-12","arxiv_id":"2005.05541","repositories_listed":1,"syntology":null},{"url":"/paper/learning-representations-for-binary","slug":"learning-representations-for-binary","title":"Learning representations for binary-classification without backpropagation","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/wic-tsv-an-evaluation-benchmark-for-target","slug":"wic-tsv-an-evaluation-benchmark-for-target","title":"WiC-TSV: An Evaluation Benchmark for Target Sense Verification of Words in Context","date":"2020-04-30","arxiv_id":"2004.15016","repositories_listed":1,"syntology":null},{"url":"/paper/automated-detection-of-covid-19-cases-using","slug":"automated-detection-of-covid-19-cases-using","title":"Automated detection of COVID-19 cases using deep neural networks with X-ray images","date":"2020-04-28","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/automated-diagnosis-of-covid-19-with-limited","slug":"automated-diagnosis-of-covid-19-with-limited","title":"Automated diagnosis of COVID-19 with limited posteroanterior chest X-ray images using fine-tuned deep neural networks","date":"2020-04-23","arxiv_id":"2004.11676","repositories_listed":1,"syntology":null}],"record_sha256":"c9337fd036825ec871b4df4ccfb0363f3126397f1fb9ee26b707932ae1195f9d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}