{"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/robust-classification/papers/ran/1","list_of":"/task/robust-classification","task":"Robust 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,38],"of":38,"counts":{"archive_papers_tagged":295,"with_a_code_link":122,"where_syntology_ran_a_sample":38,"not_listed_spam_title":0,"listed":295,"listed_where_code_ran":38,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":32,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":32,"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/robust-classification/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/adversarial-training-for-defense-against","slug":"adversarial-training-for-defense-against","title":"Adversarial Training for Defense Against Label Poisoning Attacks","date":"2025-02-24","arxiv_id":"2502.17121","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/adversarial-training-for-defense-against#ran","syntology_url":"https://syntology.ai/paper/2502.17121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17121"}},"official":{"repos":["melisilaydabal/floral"],"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/optimal-classification-under-performative","slug":"optimal-classification-under-performative","title":"Optimal Classification under Performative Distribution Shift","date":"2024-11-04","arxiv_id":"2411.02023","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"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) · 1 unverified","sample_list":"/paper/optimal-classification-under-performative#ran","syntology_url":"https://syntology.ai/paper/2411.02023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02023"}},"official":{"repos":["totilas/PerfOpti"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unifying-causal-representation-learning-with","slug":"unifying-causal-representation-learning-with","title":"Unifying Causal Representation Learning with the Invariance Principle","date":"2024-09-04","arxiv_id":"2409.02772","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/unifying-causal-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2409.02772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.02772"}},"official":null}},{"url":"/paper/dual-stage-hyperspectral-image-classification","slug":"dual-stage-hyperspectral-image-classification","title":"Dual-stage Hyperspectral Image Classification Model with Spectral Supertoken","date":"2024-07-10","arxiv_id":"2407.07307","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dual-stage-hyperspectral-image-classification#ran","syntology_url":"https://syntology.ai/paper/2407.07307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07307"}},"official":{"repos":["laprf/dstc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/allenoise-large-scale-text-classification","slug":"allenoise-large-scale-text-classification","title":"AlleNoise: large-scale text classification benchmark dataset with real-world label noise","date":"2024-06-24","arxiv_id":"2407.10992","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/allenoise-large-scale-text-classification#ran","syntology_url":"https://syntology.ai/paper/2407.10992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10992"}},"official":{"repos":["allegro/allenoise"],"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-classification-by-coupling-data","slug":"robust-classification-by-coupling-data","title":"Robust Classification by Coupling Data Mollification with Label Smoothing","date":"2024-06-03","arxiv_id":"2406.01494","repositories_listed":1,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":20,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/robust-classification-by-coupling-data#ran","syntology_url":"https://syntology.ai/paper/2406.01494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.01494"}},"official":{"repos":["markusheinonen/supervised-mollification"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/your-diffusion-model-is-secretly-a","slug":"your-diffusion-model-is-secretly-a","title":"Diffusion Models are Certifiably Robust Classifiers","date":"2024-02-04","arxiv_id":"2402.02316","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/your-diffusion-model-is-secretly-a#ran","syntology_url":"https://syntology.ai/paper/2402.02316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02316"}},"official":{"repos":["huanranchen/NoisedDiffusionClassifiers"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mixednuts-training-free-accuracy-robustness","slug":"mixednuts-training-free-accuracy-robustness","title":"MixedNUTS: Training-Free Accuracy-Robustness Balance via Nonlinearly Mixed Classifiers","date":"2024-02-03","arxiv_id":"2402.02263","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixednuts-training-free-accuracy-robustness#ran","syntology_url":"https://syntology.ai/paper/2402.02263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02263"}},"official":{"repos":["Bai-YT/MixedNUTS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convnet-vs-transformer-supervised-vs-clip","slug":"convnet-vs-transformer-supervised-vs-clip","title":"ConvNet vs Transformer, Supervised vs CLIP: Beyond ImageNet Accuracy","date":"2023-11-15","arxiv_id":"2311.09215","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/convnet-vs-transformer-supervised-vs-clip#ran","syntology_url":"https://syntology.ai/paper/2311.09215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.09215"}},"official":{"repos":["kirill-vish/beyond-inet"],"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/critical-points-an-agile-point-cloud","slug":"critical-points-an-agile-point-cloud","title":"Robustifying Point Cloud Networks by Refocusing","date":"2023-08-10","arxiv_id":"2308.05525","repositories_listed":2,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":14,"n_instrument":2,"n_unverified":6,"n_honours":2,"n_violates":1,"n_no_contract":11,"n_pointer_only":22,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 2 honoured, 1 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/critical-points-an-agile-point-cloud#ran","syntology_url":"https://syntology.ai/paper/2308.05525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05525"}},"official":{"repos":["yossilevii100/critical_points2","yossilevii100/refocusing"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/eventclip-adapting-clip-for-event-based","slug":"eventclip-adapting-clip-for-event-based","title":"EventCLIP: Adapting CLIP for Event-based Object Recognition","date":"2023-06-10","arxiv_id":"2306.06354","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/eventclip-adapting-clip-for-event-based#ran","syntology_url":"https://syntology.ai/paper/2306.06354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06354"}},"official":{"repos":["Wuziyi616/EventCLIP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stratified-adversarial-robustness-with","slug":"stratified-adversarial-robustness-with","title":"Stratified Adversarial Robustness with Rejection","date":"2023-05-02","arxiv_id":"2305.01139","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stratified-adversarial-robustness-with#ran","syntology_url":"https://syntology.ai/paper/2305.01139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.01139"}},"official":{"repos":["jfc43/stratified-adv-rej"],"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/classifier-robustness-enhancement-via-test","slug":"classifier-robustness-enhancement-via-test","title":"Class-Conditioned Transformation for Enhanced Robust Image Classification","date":"2023-03-27","arxiv_id":"2303.15409","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/classifier-robustness-enhancement-via-test#ran","syntology_url":"https://syntology.ai/paper/2303.15409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.15409"}},"official":{"repos":["tsachiblau/Class-Conditioned-Transformation-for-Enhanced-Robust-Image-Classification"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/leaving-reality-to-imagination-robust","slug":"leaving-reality-to-imagination-robust","title":"Leaving Reality to Imagination: Robust Classification via Generated Datasets","date":"2023-02-05","arxiv_id":"2302.02503","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":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) · 2 unverified","sample_list":"/paper/leaving-reality-to-imagination-robust#ran","syntology_url":"https://syntology.ai/paper/2302.02503","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.02503"}},"official":{"repos":["hritikbansal/generative-robustness"],"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/accelerating-spiking-neural-network-training","slug":"accelerating-spiking-neural-network-training","title":"Robust and accelerated single-spike spiking neural network training with applicability to challenging temporal tasks","date":"2022-05-30","arxiv_id":"2205.15286","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/accelerating-spiking-neural-network-training#ran","syntology_url":"https://syntology.ai/paper/2205.15286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15286"}},"official":{"repos":["webstorms/fastsnn"],"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/memseg-a-semi-supervised-method-for-image","slug":"memseg-a-semi-supervised-method-for-image","title":"MemSeg: A semi-supervised method for image surface defect detection using differences and commonalities","date":"2022-05-02","arxiv_id":"2205.00908","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/memseg-a-semi-supervised-method-for-image#ran","syntology_url":"https://syntology.ai/paper/2205.00908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00908"}},"official":null}},{"url":"/paper/the-multimarginal-optimal-transport","slug":"the-multimarginal-optimal-transport","title":"The Multimarginal Optimal Transport Formulation of Adversarial Multiclass Classification","date":"2022-04-27","arxiv_id":"2204.12676","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-multimarginal-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/2204.12676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12676"}},"official":null}},{"url":"/paper/ev-tta-test-time-adaptation-for-event-based","slug":"ev-tta-test-time-adaptation-for-event-based","title":"Ev-TTA: Test-Time Adaptation for Event-Based Object Recognition","date":"2022-03-23","arxiv_id":"2203.12247","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/ev-tta-test-time-adaptation-for-event-based#ran","syntology_url":"https://syntology.ai/paper/2203.12247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12247"}},"official":{"repos":["82magnolia/ev_tta"],"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/stochastic-local-winner-takes-all-networks","slug":"stochastic-local-winner-takes-all-networks","title":"Stochastic Local Winner-Takes-All Networks Enable Profound Adversarial Robustness","date":"2021-12-05","arxiv_id":"2112.02671","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"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) · 0 unverified","sample_list":"/paper/stochastic-local-winner-takes-all-networks#ran","syntology_url":"https://syntology.ai/paper/2112.02671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02671"}},"official":{"repos":["konpanousis/adversarial-lwta-autoattack"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/recognizing-bird-species-in-diverse","slug":"recognizing-bird-species-in-diverse","title":"Recognizing bird species in diverse soundscapes under weak supervision","date":"2021-07-16","arxiv_id":"2107.07728","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":1,"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/recognizing-bird-species-in-diverse#ran","syntology_url":"https://syntology.ai/paper/2107.07728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07728"}},"official":{"repos":["ChristofHenkel/kaggle-birdclef2021-2nd-place"],"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/towards-robust-classification-model-by","slug":"towards-robust-classification-model-by","title":"Towards Robust Classification Model by Counterfactual and Invariant Data Generation","date":"2021-06-02","arxiv_id":"2106.01127","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-robust-classification-model-by#ran","syntology_url":"https://syntology.ai/paper/2106.01127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01127"}},"official":{"repos":["zzzace2000/robust_cls_model"],"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/vision-transformers-are-robust-learners","slug":"vision-transformers-are-robust-learners","title":"Vision Transformers are Robust Learners","date":"2021-05-17","arxiv_id":"2105.07581","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vision-transformers-are-robust-learners#ran","syntology_url":"https://syntology.ai/paper/2105.07581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.07581"}},"official":{"repos":["sayakpaul/robustness-vit"],"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/adapting-imagenet-scale-models-to-complex","slug":"adapting-imagenet-scale-models-to-complex","title":"If your data distribution shifts, use self-learning","date":"2021-04-27","arxiv_id":"2104.12928","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":0,"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/adapting-imagenet-scale-models-to-complex#ran","syntology_url":"https://syntology.ai/paper/2104.12928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12928"}},"official":{"repos":["bethgelab/robustness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-generalization-needs-stochastic-weight","slug":"domain-generalization-needs-stochastic-weight","title":"SWAD: Domain Generalization by Seeking Flat Minima","date":"2021-02-17","arxiv_id":"2102.08604","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"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 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/domain-generalization-needs-stochastic-weight#ran","syntology_url":"https://syntology.ai/paper/2102.08604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08604"}},"official":{"repos":["khanrc/swad"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-robust-classification-with-deep","slug":"towards-robust-classification-with-deep","title":"Towards Robust Classification with Deep Generative Forests","date":"2020-07-11","arxiv_id":"2007.05721","repositories_listed":1,"syntology":{"n":25,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/towards-robust-classification-with-deep#ran","syntology_url":"https://syntology.ai/paper/2007.05721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05721"}},"official":{"repos":["AlCorreia/GeFs"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/proper-network-interpretability-helps","slug":"proper-network-interpretability-helps","title":"Proper Network Interpretability Helps Adversarial Robustness in Classification","date":"2020-06-26","arxiv_id":"2006.14748","repositories_listed":1,"syntology":{"n":17,"n_ran":6,"n_constructed":1,"n_ran_checked":3,"n_instrument":3,"n_unverified":11,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"6 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/proper-network-interpretability-helps#ran","syntology_url":"https://syntology.ai/paper/2006.14748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14748"}},"official":{"repos":["AkhilanB/Proper-Interpretability"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/black-box-smoothing-a-provable-defense-for","slug":"black-box-smoothing-a-provable-defense-for","title":"Denoised Smoothing: A Provable Defense for Pretrained Classifiers","date":"2020-03-04","arxiv_id":"2003.01908","repositories_listed":4,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/black-box-smoothing-a-provable-defense-for#ran","syntology_url":"https://syntology.ai/paper/2003.01908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.01908"}},"official":{"repos":["microsoft/blackbox-smoothing","microsoft/denoised-smoothing"],"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":["listed","official"]}}},{"url":"/paper/siamfc-towards-robust-and-accurate-visual","slug":"siamfc-towards-robust-and-accurate-visual","title":"SiamFC++: Towards Robust and Accurate Visual Tracking with Target Estimation Guidelines","date":"2019-11-14","arxiv_id":"1911.06188","repositories_listed":6,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/siamfc-towards-robust-and-accurate-visual#ran","syntology_url":"https://syntology.ai/paper/1911.06188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06188"}},"official":{"repos":["MegviiDetection/video_analyst"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/improved-sample-complexities-for-deep","slug":"improved-sample-complexities-for-deep","title":"Improved Sample Complexities for Deep Networks and Robust Classification via an All-Layer Margin","date":"2019-10-09","arxiv_id":"1910.04284","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/improved-sample-complexities-for-deep#ran","syntology_url":"https://syntology.ai/paper/1910.04284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.04284"}},"official":{"repos":["cwein3/all-layer-margin-opt"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/unlabeled-data-improves-adversarial","slug":"unlabeled-data-improves-adversarial","title":"Unlabeled Data Improves Adversarial Robustness","date":"2019-05-31","arxiv_id":"1905.13736","repositories_listed":4,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unlabeled-data-improves-adversarial#ran","syntology_url":"https://syntology.ai/paper/1905.13736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13736"}},"official":{"repos":["yaircarmon/semisup-adv","worksheets.codalab.org/worksheets/0x9df253b24dac4a2b930108be9c6e5496"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/end-to-end-learning-of-representations-for","slug":"end-to-end-learning-of-representations-for","title":"End-to-End Learning of Representations for Asynchronous Event-Based Data","date":"2019-04-17","arxiv_id":"1904.08245","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/end-to-end-learning-of-representations-for#ran","syntology_url":"https://syntology.ai/paper/1904.08245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.08245"}},"official":{"repos":["uzh-rpg/rpg_event_representation_learning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-generation-and-generalization-in","slug":"implicit-generation-and-generalization-in","title":"Implicit Generation and Generalization in Energy-Based Models","date":"2019-03-20","arxiv_id":"1903.08689","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-generation-and-generalization-in#ran","syntology_url":"https://syntology.ai/paper/1903.08689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.08689"}},"official":null}},{"url":"/paper/label-noise-robust-generative-adversarial","slug":"label-noise-robust-generative-adversarial","title":"Label-Noise Robust Generative Adversarial Networks","date":"2018-11-27","arxiv_id":"1811.11165","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/label-noise-robust-generative-adversarial#ran","syntology_url":"https://syntology.ai/paper/1811.11165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11165"}},"official":{"repos":["takuhirok/rGAN"],"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":["listed","official"]}}},{"url":"/paper/deepweeds-a-multiclass-weed-species-image","slug":"deepweeds-a-multiclass-weed-species-image","title":"DeepWeeds: A Multiclass Weed Species Image Dataset for Deep Learning","date":"2018-10-09","arxiv_id":"1810.05726","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":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) · 1 unverified","sample_list":"/paper/deepweeds-a-multiclass-weed-species-image#ran","syntology_url":"https://syntology.ai/paper/1810.05726","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05726"}},"official":{"repos":["AlexOlsen/DeepWeeds"],"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/towards-the-first-adversarially-robust-neural","slug":"towards-the-first-adversarially-robust-neural","title":"Towards the first adversarially robust neural network model on MNIST","date":"2018-05-23","arxiv_id":"1805.09190","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/towards-the-first-adversarially-robust-neural#ran","syntology_url":"https://syntology.ai/paper/1805.09190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.09190"}},"official":null}},{"url":"/paper/robust-classification-with-convolutional","slug":"robust-classification-with-convolutional","title":"Robust Classification with Convolutional Prototype Learning","date":"2018-05-09","arxiv_id":"1805.03438","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robust-classification-with-convolutional#ran","syntology_url":"https://syntology.ai/paper/1805.03438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.03438"}},"official":{"repos":["YangHM/Convolutional-Prototype-Learning"],"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":["listed","unlocated"]}}},{"url":"/paper/towards-deep-learning-models-resistant-to","slug":"towards-deep-learning-models-resistant-to","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","date":"2017-06-19","arxiv_id":"1706.06083","repositories_listed":59,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":2,"n_instrument":7,"n_unverified":8,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":13,"phrase":"9 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; 7 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/towards-deep-learning-models-resistant-to#ran","syntology_url":"https://syntology.ai/paper/1706.06083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.06083"}},"official":{"repos":["MadryLab/cifar10_challenge","MadryLab/mnist_challenge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-with-confident-examples-rank-pruning","slug":"learning-with-confident-examples-rank-pruning","title":"Learning with Confident Examples: Rank Pruning for Robust Classification with Noisy Labels","date":"2017-05-04","arxiv_id":"1705.01936","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/learning-with-confident-examples-rank-pruning#ran","syntology_url":"https://syntology.ai/paper/1705.01936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.01936"}},"official":{"repos":["cgnorthcutt/rankpruning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"50f28073f362ef95af3377e7bcc61050899b631efbcad162454a848795b30ad5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}