{"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/multi-class-classification/papers/ran/1","list_of":"/task/multi-class-classification","task":"Multi-class 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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,34],"of":34,"counts":{"archive_papers_tagged":903,"with_a_code_link":289,"where_syntology_ran_a_sample":34,"not_listed_spam_title":0,"listed":903,"listed_where_code_ran":34,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":28,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":28,"listed_every_run_a_failure_of_syntologys_instrument":6,"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/multi-class-classification/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/fedfact-a-provable-framework-for-controllable","slug":"fedfact-a-provable-framework-for-controllable","title":"FedFACT: A Provable Framework for Controllable Group-Fairness Calibration in Federated Learning","date":"2025-06-04","arxiv_id":"2506.03777","repositories_listed":0,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fedfact-a-provable-framework-for-controllable#ran","syntology_url":"https://syntology.ai/paper/2506.03777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.03777"}},"official":null}},{"url":"/paper/on-the-utility-of-speech-and-audio-foundation","slug":"on-the-utility-of-speech-and-audio-foundation","title":"On the Utility of Speech and Audio Foundation Models for Marmoset Call Analysis","date":"2024-07-23","arxiv_id":"2407.16417","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/on-the-utility-of-speech-and-audio-foundation#ran","syntology_url":"https://syntology.ai/paper/2407.16417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.16417"}},"official":{"repos":["idiap/speech-utility-bioacoustics"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/interval-abstractions-for-robust","slug":"interval-abstractions-for-robust","title":"Interval Abstractions for Robust Counterfactual Explanations","date":"2024-04-21","arxiv_id":"2404.13736","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 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) · 8 unverified","sample_list":"/paper/interval-abstractions-for-robust#ran","syntology_url":"https://syntology.ai/paper/2404.13736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13736"}},"official":{"repos":["junqi-jiang/interval-abstractions"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/hyper-evidential-deep-learning-to-quantify","slug":"hyper-evidential-deep-learning-to-quantify","title":"Hyper Evidential Deep Learning to Quantify Composite Classification Uncertainty","date":"2024-04-17","arxiv_id":"2404.10980","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":1,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hyper-evidential-deep-learning-to-quantify#ran","syntology_url":"https://syntology.ai/paper/2404.10980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.10980"}},"official":{"repos":["hugo101/hyperevidentialnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-with-complementary-labels-revisited","slug":"learning-with-complementary-labels-revisited","title":"Learning with Complementary Labels Revisited: The Selected-Completely-at-Random Setting Is More Practical","date":"2023-11-27","arxiv_id":"2311.15502","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"9 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-with-complementary-labels-revisited#ran","syntology_url":"https://syntology.ai/paper/2311.15502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15502"}},"official":{"repos":["wwangwitsel/scarce"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-deep-representation-learning","slug":"understanding-deep-representation-learning","title":"Understanding Deep Representation Learning via Layerwise Feature Compression and Discrimination","date":"2023-11-06","arxiv_id":"2311.02960","repositories_listed":1,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":17,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/understanding-deep-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2311.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02960"}},"official":{"repos":["heimine/pnc_dln"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-collapse-in-multi-label-learning-with","slug":"neural-collapse-in-multi-label-learning-with","title":"Neural Collapse in Multi-label Learning with Pick-all-label Loss","date":"2023-10-24","arxiv_id":"2310.15903","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":9,"phrase":"4 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/neural-collapse-in-multi-label-learning-with#ran","syntology_url":"https://syntology.ai/paper/2310.15903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15903"}},"official":{"repos":["heimine/nc_mlab"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/taming-the-sigmoid-bottleneck-provably","slug":"taming-the-sigmoid-bottleneck-provably","title":"Taming the Sigmoid Bottleneck: Provably Argmaxable Sparse Multi-Label Classification","date":"2023-10-16","arxiv_id":"2310.10443","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/taming-the-sigmoid-bottleneck-provably#ran","syntology_url":"https://syntology.ai/paper/2310.10443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10443"}},"official":{"repos":["andreasgrv/sigmoid-bottleneck"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-estimation-of-the-local-robustness","slug":"efficient-estimation-of-the-local-robustness","title":"Characterizing Data Point Vulnerability via Average-Case Robustness","date":"2023-07-26","arxiv_id":"2307.13885","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-estimation-of-the-local-robustness#ran","syntology_url":"https://syntology.ai/paper/2307.13885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13885"}},"official":{"repos":["ai4life-group/average-case-robustness"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/open-ended-medical-visual-question-answering","slug":"open-ended-medical-visual-question-answering","title":"Open-Ended Medical Visual Question Answering Through Prefix Tuning of Language Models","date":"2023-03-10","arxiv_id":"2303.05977","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/open-ended-medical-visual-question-answering#ran","syntology_url":"https://syntology.ai/paper/2303.05977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.05977"}},"official":{"repos":["tjvsonsbeek/open-ended-medical-vqa"],"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/characterizing-the-optimal-0-1-loss-for-multi","slug":"characterizing-the-optimal-0-1-loss-for-multi","title":"Characterizing the Optimal 0-1 Loss for Multi-class Classification with a Test-time Attacker","date":"2023-02-21","arxiv_id":"2302.10722","repositories_listed":0,"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/characterizing-the-optimal-0-1-loss-for-multi#ran","syntology_url":"https://syntology.ai/paper/2302.10722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10722"}},"official":null}},{"url":"/paper/conformal-inference-is-almost-free-for-neural","slug":"conformal-inference-is-almost-free-for-neural","title":"Conformal inference is (almost) free for neural networks trained with early stopping","date":"2023-01-27","arxiv_id":"2301.11556","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/conformal-inference-is-almost-free-for-neural#ran","syntology_url":"https://syntology.ai/paper/2301.11556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11556"}},"official":{"repos":["ziyiliang/conformalized_early_stopping"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/what-makes-graph-neural-networks","slug":"what-makes-graph-neural-networks","title":"What Makes Graph Neural Networks Miscalibrated?","date":"2022-10-12","arxiv_id":"2210.06391","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/what-makes-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2210.06391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06391"}},"official":{"repos":["hans66hsu/gats"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-collapse-with-normalized-features-a","slug":"neural-collapse-with-normalized-features-a","title":"Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold","date":"2022-09-19","arxiv_id":"2209.09211","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-collapse-with-normalized-features-a#ran","syntology_url":"https://syntology.ai/paper/2209.09211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.09211"}},"official":{"repos":["cjyaras/normalized-neural-collapse"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mapie-an-open-source-library-for-distribution","slug":"mapie-an-open-source-library-for-distribution","title":"MAPIE: an open-source library for distribution-free uncertainty quantification","date":"2022-07-25","arxiv_id":"2207.12274","repositories_listed":3,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mapie-an-open-source-library-for-distribution#ran","syntology_url":"https://syntology.ai/paper/2207.12274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.12274"}},"official":{"repos":["scikit-learn-contrib/mapie"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/truly-unordered-probabilistic-rule-sets-for","slug":"truly-unordered-probabilistic-rule-sets-for","title":"Truly Unordered Probabilistic Rule Sets for Multi-class Classification","date":"2022-06-17","arxiv_id":"2206.08804","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/truly-unordered-probabilistic-rule-sets-for#ran","syntology_url":"https://syntology.ai/paper/2206.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08804"}},"official":{"repos":["ylincen/turs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unified-dro-view-of-multi-class-loss","slug":"a-unified-dro-view-of-multi-class-loss","title":"Label Distributionally Robust Losses for Multi-class Classification: Consistency, Robustness and Adaptivity","date":"2021-12-30","arxiv_id":"2112.14869","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-unified-dro-view-of-multi-class-loss#ran","syntology_url":"https://syntology.ai/paper/2112.14869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14869"}},"official":{"repos":["optimization-ai/icml2023_ldr"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/can-multi-label-classification-networks-know","slug":"can-multi-label-classification-networks-know","title":"Can multi-label classification networks know what they don't know?","date":"2021-09-29","arxiv_id":"2109.14162","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/can-multi-label-classification-networks-know#ran","syntology_url":"https://syntology.ai/paper/2109.14162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.14162"}},"official":{"repos":["deeplearning-wisc/multi-label-ood"],"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/language-models-are-few-shot-multilingual","slug":"language-models-are-few-shot-multilingual","title":"Language Models are Few-shot Multilingual Learners","date":"2021-09-16","arxiv_id":"2109.07684","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/language-models-are-few-shot-multilingual#ran","syntology_url":"https://syntology.ai/paper/2109.07684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.07684"}},"official":{"repos":["gentaiscool/few-shot-lm"],"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/towards-automatic-instrumentation-by-learning","slug":"towards-automatic-instrumentation-by-learning","title":"Towards Automatic Instrumentation by Learning to Separate Parts in Symbolic Multitrack Music","date":"2021-07-13","arxiv_id":"2107.05916","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 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) · 3 unverified","sample_list":"/paper/towards-automatic-instrumentation-by-learning#ran","syntology_url":"https://syntology.ai/paper/2107.05916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05916"}},"official":{"repos":["salu133445/arranger"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/kdexplainer-a-task-oriented-attention-model","slug":"kdexplainer-a-task-oriented-attention-model","title":"KDExplainer: A Task-oriented Attention Model for Explaining Knowledge Distillation","date":"2021-05-10","arxiv_id":"2105.04181","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/kdexplainer-a-task-oriented-attention-model#ran","syntology_url":"https://syntology.ai/paper/2105.04181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04181"}},"official":null}},{"url":"/paper/towards-good-practices-for-efficiently","slug":"towards-good-practices-for-efficiently","title":"Towards Good Practices for Efficiently Annotating Large-Scale Image Classification Datasets","date":"2021-04-26","arxiv_id":"2104.12690","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/towards-good-practices-for-efficiently#ran","syntology_url":"https://syntology.ai/paper/2104.12690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12690"}},"official":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/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/achieving-equalized-odds-by-resampling","slug":"achieving-equalized-odds-by-resampling","title":"Achieving Equalized Odds by Resampling Sensitive Attributes","date":"2020-06-08","arxiv_id":"2006.04292","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/achieving-equalized-odds-by-resampling#ran","syntology_url":"https://syntology.ai/paper/2006.04292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04292"}},"official":{"repos":["yromano/fair_dummies"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/semg-gesture-recognition-with-a-simple-model","slug":"semg-gesture-recognition-with-a-simple-model","title":"sEMG Gesture Recognition with a Simple Model of Attention","date":"2020-06-05","arxiv_id":"2006.03645","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/semg-gesture-recognition-with-a-simple-model#ran","syntology_url":"https://syntology.ai/paper/2006.03645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03645"}},"official":{"repos":["josephsdavid/semg_repro"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/domain-adaptation-with-conditional","slug":"domain-adaptation-with-conditional","title":"Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift","date":"2020-03-10","arxiv_id":"2003.04475","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/domain-adaptation-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2003.04475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04475"}},"official":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/unsupervised-multi-class-domain-adaptation","slug":"unsupervised-multi-class-domain-adaptation","title":"Unsupervised Multi-Class Domain Adaptation: Theory, Algorithms, and Practice","date":"2020-02-20","arxiv_id":"2002.08681","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-multi-class-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/2002.08681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.08681"}},"official":{"repos":["YBZh/MultiClassDA"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/non-parametric-calibration-for-classification","slug":"non-parametric-calibration-for-classification","title":"Non-Parametric Calibration for Classification","date":"2019-06-12","arxiv_id":"1906.04933","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/non-parametric-calibration-for-classification#ran","syntology_url":"https://syntology.ai/paper/1906.04933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04933"}},"official":{"repos":["JonathanWenger/pycalib"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-based-context-aggregation-network","slug":"attention-based-context-aggregation-network","title":"Attention-based Context Aggregation Network for Monocular Depth Estimation","date":"2019-01-29","arxiv_id":"1901.10137","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/attention-based-context-aggregation-network#ran","syntology_url":"https://syntology.ai/paper/1901.10137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10137"}},"official":{"repos":["miraiaroha/ACAN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-class-classification-without-multi","slug":"multi-class-classification-without-multi","title":"Multi-class Classification without Multi-class Labels","date":"2019-01-02","arxiv_id":"1901.00544","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/multi-class-classification-without-multi#ran","syntology_url":"https://syntology.ai/paper/1901.00544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.00544"}},"official":{"repos":["GT-RIPL/L2C"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/evidential-deep-learning-to-quantify","slug":"evidential-deep-learning-to-quantify","title":"Evidential Deep Learning to Quantify Classification Uncertainty","date":"2018-06-05","arxiv_id":"1806.01768","repositories_listed":10,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 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) · 0 unverified","sample_list":"/paper/evidential-deep-learning-to-quantify#ran","syntology_url":"https://syntology.ai/paper/1806.01768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01768"}},"official":null}},{"url":"/paper/senteval-an-evaluation-toolkit-for-universal","slug":"senteval-an-evaluation-toolkit-for-universal","title":"SentEval: An Evaluation Toolkit for Universal Sentence Representations","date":"2018-03-14","arxiv_id":"1803.05449","repositories_listed":11,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/senteval-an-evaluation-toolkit-for-universal#ran","syntology_url":"https://syntology.ai/paper/1803.05449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05449"}},"official":{"repos":["facebookresearch/SentEval"],"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":["listed","official"]}}}],"record_sha256":"99281d7a3b3c80e1a752a039c5bad2f0171c582f1d7e656733e62cdc5d59d437","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}