{"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/adversarial-robustness/papers/ran/2","list_of":"/task/adversarial-robustness","task":"Adversarial Robustness","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":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":261,"counts":{"archive_papers_tagged":1746,"with_a_code_link":788,"where_syntology_ran_a_sample":261,"not_listed_spam_title":0,"listed":1746,"listed_where_code_ran":261,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":205,"every_run_a_failure_of_syntologys_instrument":56,"listed_with_a_run_with_no_instrument_failure":205,"listed_every_run_a_failure_of_syntologys_instrument":56,"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/adversarial-robustness/papers/ran/1","prev":"/task/adversarial-robustness/papers/ran/1","next":"/task/adversarial-robustness/papers/ran/3","papers":[{"url":"/paper/beyond-pretrained-features-noisy-image-1","slug":"beyond-pretrained-features-noisy-image-1","title":"Beyond Pretrained Features: Noisy Image Modeling Provides Adversarial Defense","date":"2023-02-02","arxiv_id":"2302.01056","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"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 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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/beyond-pretrained-features-noisy-image-1#ran","syntology_url":"https://syntology.ai/paper/2302.01056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01056"}},"official":{"repos":["youzunzhi/nim-advdef"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/certvit-certified-robustness-of-pre-trained","slug":"certvit-certified-robustness-of-pre-trained","title":"CertViT: Certified Robustness of Pre-Trained Vision Transformers","date":"2023-02-01","arxiv_id":"2302.10287","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/certvit-certified-robustness-of-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2302.10287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10287"}},"official":{"repos":["sagarverma/transformer-lipschitz"],"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/adversarial-training-of-self-supervised","slug":"adversarial-training-of-self-supervised","title":"Adversarial Training of Self-supervised Monocular Depth Estimation against Physical-World Attacks","date":"2023-01-31","arxiv_id":"2301.13487","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-training-of-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2301.13487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13487"}},"official":{"repos":["Bob-cheng/DepthModelHardening"],"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/improving-the-accuracy-robustness-trade-off","slug":"improving-the-accuracy-robustness-trade-off","title":"Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing","date":"2023-01-29","arxiv_id":"2301.12554","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/improving-the-accuracy-robustness-trade-off#ran","syntology_url":"https://syntology.ai/paper/2301.12554","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.12554"}},"official":{"repos":["bai-yt/adaptivesmoothing"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/randomized-message-interception-smoothing","slug":"randomized-message-interception-smoothing","title":"Randomized Message-Interception Smoothing: Gray-box Certificates for Graph Neural Networks","date":"2023-01-05","arxiv_id":"2301.02039","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/randomized-message-interception-smoothing#ran","syntology_url":"https://syntology.ai/paper/2301.02039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02039"}},"official":null}},{"url":"/paper/revisiting-residual-networks-for-adversarial","slug":"revisiting-residual-networks-for-adversarial","title":"Revisiting Residual Networks for Adversarial Robustness: An Architectural Perspective","date":"2022-12-21","arxiv_id":"2212.11005","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/revisiting-residual-networks-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2212.11005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.11005"}},"official":{"repos":["zhichao-lu/robust-residual-network"],"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/textgrad-advancing-robustness-evaluation-in","slug":"textgrad-advancing-robustness-evaluation-in","title":"TextGrad: Advancing Robustness Evaluation in NLP by Gradient-Driven Optimization","date":"2022-12-19","arxiv_id":"2212.09254","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/textgrad-advancing-robustness-evaluation-in#ran","syntology_url":"https://syntology.ai/paper/2212.09254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09254"}},"official":{"repos":["ucsb-nlp-chang/textgrad"],"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/confidence-aware-training-of-smoothed-1","slug":"confidence-aware-training-of-smoothed-1","title":"Confidence-aware Training of Smoothed Classifiers for Certified Robustness","date":"2022-12-18","arxiv_id":"2212.09000","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/confidence-aware-training-of-smoothed-1#ran","syntology_url":"https://syntology.ai/paper/2212.09000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09000"}},"official":{"repos":["alinlab/smoothing-catrs"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-perception-through-equivariance","slug":"robust-perception-through-equivariance","title":"Robust Perception through Equivariance","date":"2022-12-12","arxiv_id":"2212.06079","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/robust-perception-through-equivariance#ran","syntology_url":"https://syntology.ai/paper/2212.06079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.06079"}},"official":{"repos":["cvlab-columbia/equi4rob"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-the-impact-of-adversarial","slug":"understanding-the-impact-of-adversarial","title":"Understanding the Impact of Adversarial Robustness on Accuracy Disparity","date":"2022-11-28","arxiv_id":"2211.15762","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/understanding-the-impact-of-adversarial#ran","syntology_url":"https://syntology.ai/paper/2211.15762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.15762"}},"official":{"repos":["accuracy-disparity/at-on-ad"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-practical-control-of-singular-values","slug":"towards-practical-control-of-singular-values","title":"Towards Practical Control of Singular Values of Convolutional Layers","date":"2022-11-24","arxiv_id":"2211.13771","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-practical-control-of-singular-values#ran","syntology_url":"https://syntology.ai/paper/2211.13771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.13771"}},"official":{"repos":["whiteteadragon/practical_svd_conv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/improved-techniques-for-deterministic-l2","slug":"improved-techniques-for-deterministic-l2","title":"Improved techniques for deterministic l2 robustness","date":"2022-11-15","arxiv_id":"2211.08453","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":2,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"6 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improved-techniques-for-deterministic-l2#ran","syntology_url":"https://syntology.ai/paper/2211.08453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.08453"}},"official":{"repos":["singlasahil14/improved_l2_robustness"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/demystify-transformers-convolutions-in-modern","slug":"demystify-transformers-convolutions-in-modern","title":"Demystify Transformers & Convolutions in Modern Image Deep Networks","date":"2022-11-10","arxiv_id":"2211.05781","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/demystify-transformers-convolutions-in-modern#ran","syntology_url":"https://syntology.ai/paper/2211.05781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.05781"}},"official":{"repos":["opengvlab/stm-evaluation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-training-with-complementary","slug":"adversarial-training-with-complementary","title":"Adversarial Training with Complementary Labels: On the Benefit of Gradually Informative Attacks","date":"2022-11-01","arxiv_id":"2211.00269","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-training-with-complementary#ran","syntology_url":"https://syntology.ai/paper/2211.00269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.00269"}},"official":{"repos":["RoyalSkye/ATCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/broken-neural-scaling-laws","slug":"broken-neural-scaling-laws","title":"Broken Neural Scaling Laws","date":"2022-10-26","arxiv_id":"2210.14891","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/broken-neural-scaling-laws#ran","syntology_url":"https://syntology.ai/paper/2210.14891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.14891"}},"official":{"repos":["ethancaballero/broken_neural_scaling_laws"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lot-layer-wise-orthogonal-training-on","slug":"lot-layer-wise-orthogonal-training-on","title":"LOT: Layer-wise Orthogonal Training on Improving $\\ell_2$ Certified Robustness","date":"2022-10-20","arxiv_id":"2210.11620","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 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) · 0 unverified","sample_list":"/paper/lot-layer-wise-orthogonal-training-on#ran","syntology_url":"https://syntology.ai/paper/2210.11620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.11620"}},"official":{"repos":["ai-secure/layerwise-orthogonal-training"],"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","unlocated"]}}},{"url":"/paper/scaling-adversarial-training-to-large","slug":"scaling-adversarial-training-to-large","title":"Scaling Adversarial Training to Large Perturbation Bounds","date":"2022-10-18","arxiv_id":"2210.09852","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/scaling-adversarial-training-to-large#ran","syntology_url":"https://syntology.ai/paper/2210.09852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09852"}},"official":{"repos":["val-iisc/oaat"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/demystifying-self-supervised-trojan-attacks","slug":"demystifying-self-supervised-trojan-attacks","title":"An Embarrassingly Simple Backdoor Attack on Self-supervised Learning","date":"2022-10-13","arxiv_id":"2210.07346","repositories_listed":4,"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/demystifying-self-supervised-trojan-attacks#ran","syntology_url":"https://syntology.ai/paper/2210.07346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07346"}},"official":{"repos":["meet-cjli/ctrl","CCCjiang/CTRL"],"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/visual-prompting-for-adversarial-robustness","slug":"visual-prompting-for-adversarial-robustness","title":"Visual Prompting for Adversarial Robustness","date":"2022-10-12","arxiv_id":"2210.06284","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/visual-prompting-for-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2210.06284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06284"}},"official":{"repos":["Phoveran/vp-for-adversarial-robustness"],"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/certified-training-small-boxes-are-all-you","slug":"certified-training-small-boxes-are-all-you","title":"Certified Training: Small Boxes are All You Need","date":"2022-10-10","arxiv_id":"2210.04871","repositories_listed":1,"syntology":{"n":12,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 8 unverified","sample_list":"/paper/certified-training-small-boxes-are-all-you#ran","syntology_url":"https://syntology.ai/paper/2210.04871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04871"}},"official":{"repos":["eth-sri/sabr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/pruning-adversarially-robust-neural-networks","slug":"pruning-adversarially-robust-neural-networks","title":"Pruning Adversarially Robust Neural Networks without Adversarial Examples","date":"2022-10-09","arxiv_id":"2210.04311","repositories_listed":1,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/pruning-adversarially-robust-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2210.04311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.04311"}},"official":{"repos":["neu-spiral/pwoa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-out-of-distribution-adversarial","slug":"towards-out-of-distribution-adversarial","title":"Towards Out-of-Distribution Adversarial Robustness","date":"2022-10-06","arxiv_id":"2210.03150","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":3,"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-out-of-distribution-adversarial#ran","syntology_url":"https://syntology.ai/paper/2210.03150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03150"}},"official":{"repos":["aiproj/towards-out-of-distribution-adversarial-robustness"],"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/adaptive-smoothness-weighted-adversarial","slug":"adaptive-smoothness-weighted-adversarial","title":"Adaptive Smoothness-weighted Adversarial Training for Multiple Perturbations with Its Stability Analysis","date":"2022-10-02","arxiv_id":"2210.00557","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-smoothness-weighted-adversarial#ran","syntology_url":"https://syntology.ai/paper/2210.00557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00557"}},"official":{"repos":["JiancongXiao/Adaptive-Smoothness-Weighted-AT"],"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/adaptive-weight-decay-on-the-fly-weight-decay","slug":"adaptive-weight-decay-on-the-fly-weight-decay","title":"Improving Robustness with Adaptive Weight Decay","date":"2022-09-30","arxiv_id":"2210.00094","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/adaptive-weight-decay-on-the-fly-weight-decay#ran","syntology_url":"https://syntology.ai/paper/2210.00094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00094"}},"official":null}},{"url":"/paper/towards-bridging-the-performance-gaps-of","slug":"towards-bridging-the-performance-gaps-of","title":"Towards Bridging the Performance Gaps of Joint Energy-based Models","date":"2022-09-16","arxiv_id":"2209.07959","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 4 unverified","sample_list":"/paper/towards-bridging-the-performance-gaps-of#ran","syntology_url":"https://syntology.ai/paper/2209.07959","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.07959"}},"official":{"repos":["sndnyang/sadajem"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/scattering-model-guided-adversarial-examples","slug":"scattering-model-guided-adversarial-examples","title":"Scattering Model Guided Adversarial Examples for SAR Target Recognition: Attack and Defense","date":"2022-09-11","arxiv_id":"2209.04779","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":0,"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/scattering-model-guided-adversarial-examples#ran","syntology_url":"https://syntology.ai/paper/2209.04779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04779"}},"official":{"repos":["scenarri/SMGAA"],"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/bispectral-neural-networks","slug":"bispectral-neural-networks","title":"Bispectral Neural Networks","date":"2022-09-07","arxiv_id":"2209.03416","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/bispectral-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2209.03416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.03416"}},"official":{"repos":["sophiaas/bispectral-networks"],"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/on-the-privacy-effect-of-data-enhancement-via","slug":"on-the-privacy-effect-of-data-enhancement-via","title":"On the Privacy Effect of Data Enhancement via the Lens of Memorization","date":"2022-08-17","arxiv_id":"2208.08270","repositories_listed":1,"syntology":{"n":17,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":1,"phrase":"14 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-privacy-effect-of-data-enhancement-via#ran","syntology_url":"https://syntology.ai/paper/2208.08270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08270"}},"official":{"repos":["lixiaothu/privacy_and_aug"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/visual-correspondence-based-explanations","slug":"visual-correspondence-based-explanations","title":"Visual correspondence-based explanations improve AI robustness and human-AI team accuracy","date":"2022-07-26","arxiv_id":"2208.00780","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/visual-correspondence-based-explanations#ran","syntology_url":"https://syntology.ai/paper/2208.00780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.00780"}},"official":{"repos":["anguyen8/visual-correspondence-xai"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/decoupled-adversarial-contrastive-learning","slug":"decoupled-adversarial-contrastive-learning","title":"Decoupled Adversarial Contrastive Learning for Self-supervised Adversarial Robustness","date":"2022-07-22","arxiv_id":"2207.10899","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/decoupled-adversarial-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2207.10899","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10899"}},"official":{"repos":["pantheon5100/deacl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/assaying-out-of-distribution-generalization","slug":"assaying-out-of-distribution-generalization","title":"Assaying Out-Of-Distribution Generalization in Transfer Learning","date":"2022-07-19","arxiv_id":"2207.09239","repositories_listed":1,"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/assaying-out-of-distribution-generalization#ran","syntology_url":"https://syntology.ai/paper/2207.09239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09239"}},"official":{"repos":["amazon-research/assaying-ood"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-contrastive-learning-via","slug":"adversarial-contrastive-learning-via","title":"Adversarial Contrastive Learning via Asymmetric InfoNCE","date":"2022-07-18","arxiv_id":"2207.08374","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/adversarial-contrastive-learning-via#ran","syntology_url":"https://syntology.ai/paper/2207.08374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08374"}},"official":{"repos":["yqy2001/a-infonce"],"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/carben-composite-adversarial-robustness","slug":"carben-composite-adversarial-robustness","title":"CARBEN: Composite Adversarial Robustness Benchmark","date":"2022-07-16","arxiv_id":"2207.07797","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/carben-composite-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2207.07797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.07797"}},"official":{"repos":["IBM/composite-adv"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/removing-batch-normalization-boosts","slug":"removing-batch-normalization-boosts","title":"Removing Batch Normalization Boosts Adversarial Training","date":"2022-07-04","arxiv_id":"2207.01156","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/removing-batch-normalization-boosts#ran","syntology_url":"https://syntology.ai/paper/2207.01156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01156"}},"official":{"repos":["amazon-research/normalizer-free-robust-training"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-deep-reinforcement-learning-through-1","slug":"robust-deep-reinforcement-learning-through-1","title":"Robust Deep Reinforcement Learning through Bootstrapped Opportunistic Curriculum","date":"2022-06-21","arxiv_id":"2206.10057","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/robust-deep-reinforcement-learning-through-1#ran","syntology_url":"https://syntology.ai/paper/2206.10057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10057"}},"official":{"repos":["jlwu002/bcl"],"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/certified-adversarial-robustness-for-free","slug":"certified-adversarial-robustness-for-free","title":"(Certified!!) Adversarial Robustness for Free!","date":"2022-06-21","arxiv_id":"2206.10550","repositories_listed":3,"syntology":{"n":34,"n_ran":28,"n_constructed":0,"n_ran_checked":21,"n_instrument":7,"n_unverified":6,"n_honours":3,"n_violates":0,"n_no_contract":18,"n_pointer_only":13,"phrase":"28 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 3 honoured, 0 violated, 18 with no contract checked; 7 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/certified-adversarial-robustness-for-free#ran","syntology_url":"https://syntology.ai/paper/2206.10550","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10550"}},"official":{"repos":["ethz-privsec/diffusion_denoised_smoothing"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-limitations-of-stochastic-pre","slug":"on-the-limitations-of-stochastic-pre","title":"On the Limitations of Stochastic Pre-processing Defenses","date":"2022-06-19","arxiv_id":"2206.09491","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/on-the-limitations-of-stochastic-pre#ran","syntology_url":"https://syntology.ai/paper/2206.09491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09491"}},"official":{"repos":["wi-pi/stochastic-preprocessing-defenses"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/demystifying-the-adversarial-robustness-of-1","slug":"demystifying-the-adversarial-robustness-of-1","title":"Demystifying the Adversarial Robustness of Random Transformation Defenses","date":"2022-06-18","arxiv_id":"2207.03574","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/demystifying-the-adversarial-robustness-of-1#ran","syntology_url":"https://syntology.ai/paper/2207.03574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03574"}},"official":{"repos":["wagner-group/demystify-random-transform"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-robust-overfitting-of","slug":"understanding-robust-overfitting-of","title":"Understanding Robust Overfitting of Adversarial Training and Beyond","date":"2022-06-17","arxiv_id":"2206.08675","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/understanding-robust-overfitting-of#ran","syntology_url":"https://syntology.ai/paper/2206.08675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08675"}},"official":{"repos":["chaojianyu/understanding-robust-overfitting"],"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":["unlocated"]}}},{"url":"/paper/adversarial-vulnerability-of-randomized","slug":"adversarial-vulnerability-of-randomized","title":"Adversarial Vulnerability of Randomized Ensembles","date":"2022-06-14","arxiv_id":"2206.06737","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"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) · 4 unverified","sample_list":"/paper/adversarial-vulnerability-of-randomized#ran","syntology_url":"https://syntology.ai/paper/2206.06737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.06737"}},"official":{"repos":["hsndbk4/arc"],"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/flatten-the-curve-efficiently-training-low","slug":"flatten-the-curve-efficiently-training-low","title":"Efficiently Training Low-Curvature Neural Networks","date":"2022-06-14","arxiv_id":"2206.07144","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/flatten-the-curve-efficiently-training-low#ran","syntology_url":"https://syntology.ai/paper/2206.07144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07144"}},"official":{"repos":["kylematoba/lcnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-regularization-for-adversarial","slug":"adaptive-regularization-for-adversarial","title":"Improving Adversarial Robustness by Putting More Regularizations on Less Robust Samples","date":"2022-06-07","arxiv_id":"2206.03353","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/adaptive-regularization-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2206.03353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03353"}},"official":{"repos":["dyoony/arow"],"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/building-robust-ensembles-via-margin-boosting","slug":"building-robust-ensembles-via-margin-boosting","title":"Building Robust Ensembles via Margin Boosting","date":"2022-06-07","arxiv_id":"2206.03362","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/building-robust-ensembles-via-margin-boosting#ran","syntology_url":"https://syntology.ai/paper/2206.03362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03362"}},"official":{"repos":["zdhnarsil/margin-boosting"],"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/calfat-calibrated-federated-adversarial","slug":"calfat-calibrated-federated-adversarial","title":"CalFAT: Calibrated Federated Adversarial Training with Label Skewness","date":"2022-05-30","arxiv_id":"2205.14926","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/calfat-calibrated-federated-adversarial#ran","syntology_url":"https://syntology.ai/paper/2205.14926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14926"}},"official":{"repos":["cc233/calfat"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/collaborative-adversarial-training","slug":"collaborative-adversarial-training","title":"Squeeze Training for Adversarial Robustness","date":"2022-05-23","arxiv_id":"2205.11156","repositories_listed":1,"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":5,"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/collaborative-adversarial-training#ran","syntology_url":"https://syntology.ai/paper/2205.11156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11156"}},"official":{"repos":["qizhangli/st-at"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fednest-federated-bilevel-minimax-and","slug":"fednest-federated-bilevel-minimax-and","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","date":"2022-05-04","arxiv_id":"2205.02215","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"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, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fednest-federated-bilevel-minimax-and#ran","syntology_url":"https://syntology.ai/paper/2205.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02215"}},"official":{"repos":["ucr-optml/FedNest"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","named_in_paper"]}}},{"url":"/paper/distilling-robust-and-non-robust-features-in-1","slug":"distilling-robust-and-non-robust-features-in-1","title":"Distilling Robust and Non-Robust Features in Adversarial Examples by Information Bottleneck","date":"2022-04-06","arxiv_id":"2204.02735","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"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, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distilling-robust-and-non-robust-features-in-1#ran","syntology_url":"https://syntology.ai/paper/2204.02735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02735"}},"official":{"repos":["ByungKwanLee/Adversarial-Information-Bottleneck"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/masking-adversarial-damage-finding","slug":"masking-adversarial-damage-finding","title":"Masking Adversarial Damage: Finding Adversarial Saliency for Robust and Sparse Network","date":"2022-04-06","arxiv_id":"2204.02738","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":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) · 0 unverified","sample_list":"/paper/masking-adversarial-damage-finding#ran","syntology_url":"https://syntology.ai/paper/2204.02738","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02738"}},"official":{"repos":["ByungKwanLee/Masking-Adversarial-Damage"],"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/practical-evaluation-of-adversarial","slug":"practical-evaluation-of-adversarial","title":"Practical Evaluation of Adversarial Robustness via Adaptive Auto Attack","date":"2022-03-10","arxiv_id":"2203.05154","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/practical-evaluation-of-adversarial#ran","syntology_url":"https://syntology.ai/paper/2203.05154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05154"}},"official":{"repos":["liuye6666/adaptive_auto_attack"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/enhancing-adversarial-robustness-for-deep","slug":"enhancing-adversarial-robustness-for-deep","title":"Enhancing Adversarial Robustness for Deep Metric Learning","date":"2022-03-02","arxiv_id":"2203.01439","repositories_listed":2,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/enhancing-adversarial-robustness-for-deep#ran","syntology_url":"https://syntology.ai/paper/2203.01439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01439"}},"official":{"repos":["cdluminate/robdml"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/evaluating-the-adversarial-robustness-of","slug":"evaluating-the-adversarial-robustness-of","title":"Evaluating the Adversarial Robustness of Adaptive Test-time Defenses","date":"2022-02-28","arxiv_id":"2202.13711","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 2 unverified","sample_list":"/paper/evaluating-the-adversarial-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2202.13711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.13711"}},"official":{"repos":["fra31/evaluating-adaptive-test-time-defenses"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/transferring-adversarial-robustness-through","slug":"transferring-adversarial-robustness-through","title":"Transferring Adversarial Robustness Through Robust Representation Matching","date":"2022-02-21","arxiv_id":"2202.09994","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":0,"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/transferring-adversarial-robustness-through#ran","syntology_url":"https://syntology.ai/paper/2202.09994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09994"}},"official":{"repos":["ethos-lab/robust-representation-matching"],"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/lyanet-a-lyapunov-framework-for-training","slug":"lyanet-a-lyapunov-framework-for-training","title":"LyaNet: A Lyapunov Framework for Training Neural ODEs","date":"2022-02-05","arxiv_id":"2202.02526","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/lyanet-a-lyapunov-framework-for-training#ran","syntology_url":"https://syntology.ai/paper/2202.02526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02526"}},"official":{"repos":["ivandariojr/lyapunovlearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/garnet-reduced-rank-topology-learning-for","slug":"garnet-reduced-rank-topology-learning-for","title":"GARNET: Reduced-Rank Topology Learning for Robust and Scalable Graph Neural Networks","date":"2022-01-30","arxiv_id":"2201.12741","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/garnet-reduced-rank-topology-learning-for#ran","syntology_url":"https://syntology.ai/paper/2201.12741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12741"}},"official":{"repos":["cornell-zhang/garnet"],"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/improving-corruption-and-adversarial","slug":"improving-corruption-and-adversarial","title":"Improving Robustness by Enhancing Weak Subnets","date":"2022-01-30","arxiv_id":"2201.12765","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-corruption-and-adversarial#ran","syntology_url":"https://syntology.ai/paper/2201.12765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12765"}},"official":{"repos":["guoyongcs/ews"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-adversarial-robustness-of-trajectory","slug":"on-adversarial-robustness-of-trajectory","title":"On Adversarial Robustness of Trajectory Prediction for Autonomous Vehicles","date":"2022-01-13","arxiv_id":"2201.05057","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":2,"n_ran_checked":5,"n_instrument":8,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":13,"phrase":"13 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 8 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-adversarial-robustness-of-trajectory#ran","syntology_url":"https://syntology.ai/paper/2201.05057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05057"}},"official":null}},{"url":"/paper/how-should-pre-trained-language-models-be-1","slug":"how-should-pre-trained-language-models-be-1","title":"How Should Pre-Trained Language Models Be Fine-Tuned Towards Adversarial Robustness?","date":"2021-12-22","arxiv_id":"2112.11668","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":0,"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/how-should-pre-trained-language-models-be-1#ran","syntology_url":"https://syntology.ai/paper/2112.11668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11668"}},"official":{"repos":["dongxinshuai/rift-neurips2021"],"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/pixmix-dreamlike-pictures-comprehensively","slug":"pixmix-dreamlike-pictures-comprehensively","title":"PixMix: Dreamlike Pictures Comprehensively Improve Safety Measures","date":"2021-12-09","arxiv_id":"2112.05135","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":2,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 2 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pixmix-dreamlike-pictures-comprehensively#ran","syntology_url":"https://syntology.ai/paper/2112.05135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05135"}},"official":{"repos":["andyzoujm/pixmix"],"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":["listed","official","unlocated"]}}},{"url":"/paper/segment-and-complete-defending-object","slug":"segment-and-complete-defending-object","title":"Segment and Complete: Defending Object Detectors against Adversarial Patch Attacks with Robust Patch Detection","date":"2021-12-08","arxiv_id":"2112.04532","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/segment-and-complete-defending-object#ran","syntology_url":"https://syntology.ai/paper/2112.04532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04532"}},"official":{"repos":["joellliu/segmentandcomplete"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"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/clustering-effect-of-linearized-adversarial","slug":"clustering-effect-of-linearized-adversarial","title":"Clustering Effect of (Linearized) Adversarial Robust Models","date":"2021-11-25","arxiv_id":"2111.12922","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/clustering-effect-of-linearized-adversarial#ran","syntology_url":"https://syntology.ai/paper/2111.12922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12922"}},"official":{"repos":["bymavis/adv_weight_neurips2021"],"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/graph-robustness-benchmark-benchmarking-the","slug":"graph-robustness-benchmark-benchmarking-the","title":"Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learning","date":"2021-11-08","arxiv_id":"2111.04314","repositories_listed":1,"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/graph-robustness-benchmark-benchmarking-the#ran","syntology_url":"https://syntology.ai/paper/2111.04314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04314"}},"official":{"repos":["thudm/grb"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-attacks-on-graph-classification","slug":"adversarial-attacks-on-graph-classification","title":"Adversarial Attacks on Graph Classification via Bayesian Optimisation","date":"2021-11-04","arxiv_id":"2111.02842","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/adversarial-attacks-on-graph-classification#ran","syntology_url":"https://syntology.ai/paper/2111.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02842"}},"official":{"repos":["xingchenwan/grabnel"],"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":["found_in_text"]}}},{"url":"/paper/when-does-contrastive-learning-preserve","slug":"when-does-contrastive-learning-preserve","title":"When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?","date":"2021-11-01","arxiv_id":"2111.01124","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"10 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-does-contrastive-learning-preserve#ran","syntology_url":"https://syntology.ai/paper/2111.01124","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.01124"}},"official":{"repos":["lijiefan/advcl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-evaluating-the-robustness-of-neural-2","slug":"towards-evaluating-the-robustness-of-neural-2","title":"Towards Evaluating the Robustness of Neural Networks Learned by Transduction","date":"2021-10-27","arxiv_id":"2110.14735","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/towards-evaluating-the-robustness-of-neural-2#ran","syntology_url":"https://syntology.ai/paper/2110.14735","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14735"}},"official":{"repos":["jfc43/eval-transductive-robustness"],"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/drawing-robust-scratch-tickets-subnetworks","slug":"drawing-robust-scratch-tickets-subnetworks","title":"Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networks","date":"2021-10-26","arxiv_id":"2110.14068","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/drawing-robust-scratch-tickets-subnetworks#ran","syntology_url":"https://syntology.ai/paper/2110.14068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14068"}},"official":{"repos":["rice-eic/robust-scratch-ticket"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-robustness-using-generated-data","slug":"improving-robustness-using-generated-data","title":"Improving Robustness using Generated Data","date":"2021-10-18","arxiv_id":"2110.09468","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"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; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-robustness-using-generated-data#ran","syntology_url":"https://syntology.ai/paper/2110.09468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.09468"}},"official":null}},{"url":"/paper/exploring-architectural-ingredients-of","slug":"exploring-architectural-ingredients-of","title":"Exploring Architectural Ingredients of Adversarially Robust Deep Neural Networks","date":"2021-10-07","arxiv_id":"2110.03825","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/exploring-architectural-ingredients-of#ran","syntology_url":"https://syntology.ai/paper/2110.03825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.03825"}},"official":{"repos":["HanxunH/RobustWRN"],"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/robustart-benchmarking-robustness-on","slug":"robustart-benchmarking-robustness-on","title":"RobustART: Benchmarking Robustness on Architecture Design and Training Techniques","date":"2021-09-11","arxiv_id":"2109.05211","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/robustart-benchmarking-robustness-on#ran","syntology_url":"https://syntology.ai/paper/2109.05211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05211"}},"official":null}},{"url":"/paper/advdrop-adversarial-attack-to-dnns-by","slug":"advdrop-adversarial-attack-to-dnns-by","title":"AdvDrop: Adversarial Attack to DNNs by Dropping Information","date":"2021-08-20","arxiv_id":"2108.09034","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/advdrop-adversarial-attack-to-dnns-by#ran","syntology_url":"https://syntology.ai/paper/2108.09034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09034"}},"official":{"repos":["rjduan/advdrop"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-adversarial-robustness","slug":"revisiting-adversarial-robustness","title":"Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Better","date":"2021-08-18","arxiv_id":"2108.07969","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-adversarial-robustness#ran","syntology_url":"https://syntology.ai/paper/2108.07969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07969"}},"official":{"repos":["zibojia/rslad"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/agkd-bml-defense-against-adversarial-attack","slug":"agkd-bml-defense-against-adversarial-attack","title":"AGKD-BML: Defense Against Adversarial Attack by Attention Guided Knowledge Distillation and Bi-directional Metric Learning","date":"2021-08-13","arxiv_id":"2108.06017","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":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/agkd-bml-defense-against-adversarial-attack#ran","syntology_url":"https://syntology.ai/paper/2108.06017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.06017"}},"official":{"repos":["hongw579/agkd-bml"],"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/householder-activations-for-provable","slug":"householder-activations-for-provable","title":"Improved deterministic l2 robustness on CIFAR-10 and CIFAR-100","date":"2021-08-05","arxiv_id":"2108.04062","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/householder-activations-for-provable#ran","syntology_url":"https://syntology.ai/paper/2108.04062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04062"}},"official":{"repos":["singlasahil14/SOC"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-adversarial-robustness-via-test","slug":"enhancing-adversarial-robustness-via-test","title":"Enhancing Adversarial Robustness via Test-time Transformation Ensembling","date":"2021-07-29","arxiv_id":"2107.14110","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/enhancing-adversarial-robustness-via-test#ran","syntology_url":"https://syntology.ai/paper/2107.14110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.14110"}},"official":{"repos":["juancprzs/TTE"],"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/long-term-cross-adversarial-training-a-robust","slug":"long-term-cross-adversarial-training-a-robust","title":"Long-term Cross Adversarial Training: A Robust Meta-learning Method for Few-shot Classification Tasks","date":"2021-06-22","arxiv_id":"2106.12900","repositories_listed":1,"syntology":{"n":9,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/long-term-cross-adversarial-training-a-robust#ran","syntology_url":"https://syntology.ai/paper/2106.12900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12900"}},"official":{"repos":["Gnomeek/Long-term-Cross-Adversarial-Training"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/indicators-of-attack-failure-debugging-and","slug":"indicators-of-attack-failure-debugging-and","title":"Indicators of Attack Failure: Debugging and Improving Optimization of Adversarial Examples","date":"2021-06-18","arxiv_id":"2106.09947","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/indicators-of-attack-failure-debugging-and#ran","syntology_url":"https://syntology.ai/paper/2106.09947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09947"}},"official":{"repos":["pralab/IndicatorsOfAttackFailure"],"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/federated-robustness-propagation-sharing","slug":"federated-robustness-propagation-sharing","title":"Federated Robustness Propagation: Sharing Robustness in Heterogeneous Federated Learning","date":"2021-06-18","arxiv_id":"2106.10196","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/federated-robustness-propagation-sharing#ran","syntology_url":"https://syntology.ai/paper/2106.10196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10196"}},"official":{"repos":["illidanlab/FedRBN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cartl-cooperative-adversarially-robust","slug":"cartl-cooperative-adversarially-robust","title":"CARTL: Cooperative Adversarially-Robust Transfer Learning","date":"2021-06-12","arxiv_id":"2106.06667","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/cartl-cooperative-adversarially-robust#ran","syntology_url":"https://syntology.ai/paper/2106.06667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06667"}},"official":{"repos":["NISP-official/CARTL"],"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/reliable-adversarial-distillation-with","slug":"reliable-adversarial-distillation-with","title":"Reliable Adversarial Distillation with Unreliable Teachers","date":"2021-06-09","arxiv_id":"2106.04928","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/reliable-adversarial-distillation-with#ran","syntology_url":"https://syntology.ai/paper/2106.04928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04928"}},"official":{"repos":["zfancy/iad"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/k-mixup-regularization-for-deep-learning-via","slug":"k-mixup-regularization-for-deep-learning-via","title":"k-Mixup Regularization for Deep Learning via Optimal Transport","date":"2021-06-05","arxiv_id":"2106.02933","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/k-mixup-regularization-for-deep-learning-via#ran","syntology_url":"https://syntology.ai/paper/2106.02933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02933"}},"official":{"repos":["anminggu/kmixup-cifar10"],"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/revisiting-hilbert-schmidt-information","slug":"revisiting-hilbert-schmidt-information","title":"Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness","date":"2021-06-04","arxiv_id":"2106.02734","repositories_listed":1,"syntology":{"n":16,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/revisiting-hilbert-schmidt-information#ran","syntology_url":"https://syntology.ai/paper/2106.02734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02734"}},"official":{"repos":["neu-spiral/hbar"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/pdpgd-primal-dual-proximal-gradient-descent","slug":"pdpgd-primal-dual-proximal-gradient-descent","title":"PDPGD: Primal-Dual Proximal Gradient Descent Adversarial Attack","date":"2021-06-03","arxiv_id":"2106.01538","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/pdpgd-primal-dual-proximal-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/2106.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01538"}},"official":{"repos":["aam-at/cpgd"],"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/robust-learning-via-persistency-of-excitation","slug":"robust-learning-via-persistency-of-excitation","title":"Improving Neural Network Robustness via Persistency of Excitation","date":"2021-06-03","arxiv_id":"2106.02078","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/robust-learning-via-persistency-of-excitation#ran","syntology_url":"https://syntology.ai/paper/2106.02078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02078"}},"official":{"repos":["kaustubhsridhar/PoE-robustness"],"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/the-sobolev-regularization-effect-of","slug":"the-sobolev-regularization-effect-of","title":"On Linear Stability of SGD and Input-Smoothness of Neural Networks","date":"2021-05-27","arxiv_id":"2105.13462","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":2,"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/the-sobolev-regularization-effect-of#ran","syntology_url":"https://syntology.ai/paper/2105.13462","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13462"}},"official":{"repos":["ChaoMa93/Sobolev-Reg-of-SGD"],"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/adversarial-robustness-against-multiple-l-p","slug":"adversarial-robustness-against-multiple-l-p","title":"Adversarial Robustness against Multiple and Single $l_p$-Threat Models via Quick Fine-Tuning of Robust Classifiers","date":"2021-05-26","arxiv_id":"2105.12508","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":1,"n_instrument":6,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-against-multiple-l-p#ran","syntology_url":"https://syntology.ai/paper/2105.12508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12508"}},"official":{"repos":["fra31/robust-finetuning"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/skew-orthogonal-convolutions","slug":"skew-orthogonal-convolutions","title":"Skew Orthogonal Convolutions","date":"2021-05-24","arxiv_id":"2105.11417","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":0,"n_instrument":8,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"8 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; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/skew-orthogonal-convolutions#ran","syntology_url":"https://syntology.ai/paper/2105.11417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11417"}},"official":{"repos":["singlasahil14/SOC"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/an-orthogonal-classifier-for-improving-the","slug":"an-orthogonal-classifier-for-improving-the","title":"An Orthogonal Classifier for Improving the Adversarial Robustness of Neural Networks","date":"2021-05-19","arxiv_id":"2105.09109","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/an-orthogonal-classifier-for-improving-the#ran","syntology_url":"https://syntology.ai/paper/2105.09109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09109"}},"official":{"repos":["MTandHJ/roboc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-robust-experts-more-a-flexible","slug":"mixture-of-robust-experts-more-a-flexible","title":"Mixture of Robust Experts (MoRE):A Robust Denoising Method towards multiple perturbations","date":"2021-04-21","arxiv_id":"2104.10586","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixture-of-robust-experts-more-a-flexible#ran","syntology_url":"https://syntology.ai/paper/2104.10586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.10586"}},"official":null}},{"url":"/paper/does-language-help-generalization-in-vision","slug":"does-language-help-generalization-in-vision","title":"Does language help generalization in vision models?","date":"2021-04-16","arxiv_id":"2104.08313","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/does-language-help-generalization-in-vision#ran","syntology_url":"https://syntology.ai/paper/2104.08313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08313"}},"official":{"repos":["bdvllrs/generalization-vision"],"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/orthogonalizing-convolutional-layers-with-the-1","slug":"orthogonalizing-convolutional-layers-with-the-1","title":"Orthogonalizing Convolutional Layers with the Cayley Transform","date":"2021-04-14","arxiv_id":"2104.07167","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/orthogonalizing-convolutional-layers-with-the-1#ran","syntology_url":"https://syntology.ai/paper/2104.07167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07167"}},"official":{"repos":["locuslab/orthogonal-convolutions"],"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/adversarial-robustness-under-long-tailed","slug":"adversarial-robustness-under-long-tailed","title":"Adversarial Robustness under Long-Tailed Distribution","date":"2021-04-06","arxiv_id":"2104.02703","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/adversarial-robustness-under-long-tailed#ran","syntology_url":"https://syntology.ai/paper/2104.02703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.02703"}},"official":{"repos":["wutong16/Adversarial_Long-Tail"],"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/drop-bottleneck-learning-discrete-compressed-1","slug":"drop-bottleneck-learning-discrete-compressed-1","title":"Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Exploration","date":"2021-03-23","arxiv_id":"2103.12300","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/drop-bottleneck-learning-discrete-compressed-1#ran","syntology_url":"https://syntology.ai/paper/2103.12300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12300"}},"official":{"repos":["jaekyeom/drop-bottleneck"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/shift-invariance-can-reduce-adversarial","slug":"shift-invariance-can-reduce-adversarial","title":"Shift Invariance Can Reduce Adversarial Robustness","date":"2021-03-03","arxiv_id":"2103.02695","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/shift-invariance-can-reduce-adversarial#ran","syntology_url":"https://syntology.ai/paper/2103.02695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02695"}},"official":{"repos":["SongweiGe/shift-invariance-adv-robustness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mind-the-box-l-1-apgd-for-sparse-adversarial","slug":"mind-the-box-l-1-apgd-for-sparse-adversarial","title":"Mind the box: $l_1$-APGD for sparse adversarial attacks on image classifiers","date":"2021-03-01","arxiv_id":"2103.01208","repositories_listed":2,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":1,"n_instrument":9,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 9 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mind-the-box-l-1-apgd-for-sparse-adversarial#ran","syntology_url":"https://syntology.ai/paper/2103.01208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01208"}},"official":{"repos":["fra31/auto-attack","jeromerony/adversarial-library"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-minimum-norm-adversarial-attacks-through","slug":"fast-minimum-norm-adversarial-attacks-through","title":"Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraints","date":"2021-02-25","arxiv_id":"2102.12827","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-minimum-norm-adversarial-attacks-through#ran","syntology_url":"https://syntology.ai/paper/2102.12827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12827"}},"official":{"repos":["pralab/Fast-Minimum-Norm-FMN-Attack"],"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/adversarial-robustness-with-non-uniform","slug":"adversarial-robustness-with-non-uniform","title":"Adversarial Robustness with Non-uniform Perturbations","date":"2021-02-24","arxiv_id":"2102.12002","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":0,"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/adversarial-robustness-with-non-uniform#ran","syntology_url":"https://syntology.ai/paper/2102.12002","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12002"}},"official":{"repos":["amazon-research/adversarial-robustness-with-nonuniform-perturbations"],"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/center-smoothing-for-certifiably-robust","slug":"center-smoothing-for-certifiably-robust","title":"Center Smoothing: Certified Robustness for Networks with Structured Outputs","date":"2021-02-19","arxiv_id":"2102.09701","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/center-smoothing-for-certifiably-robust#ran","syntology_url":"https://syntology.ai/paper/2102.09701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09701"}},"official":{"repos":["aounon/center-smoothing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridging-the-gap-between-adversarial","slug":"bridging-the-gap-between-adversarial","title":"Bridging the Gap Between Adversarial Robustness and Optimization Bias","date":"2021-02-17","arxiv_id":"2102.08868","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-the-gap-between-adversarial#ran","syntology_url":"https://syntology.ai/paper/2102.08868","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.08868"}},"official":{"repos":["fartashf/robust_bias"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-robust-classifier-with","slug":"adversarially-robust-classifier-with","title":"Towards Bridging the gap between Empirical and Certified Robustness against Adversarial Examples","date":"2021-02-09","arxiv_id":"2102.05096","repositories_listed":0,"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":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) · 3 unverified","sample_list":"/paper/adversarially-robust-classifier-with#ran","syntology_url":"https://syntology.ai/paper/2102.05096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.05096"}},"official":null}},{"url":"/paper/composite-adversarial-attacks","slug":"composite-adversarial-attacks","title":"Composite Adversarial Attacks","date":"2020-12-10","arxiv_id":"2012.05434","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/composite-adversarial-attacks#ran","syntology_url":"https://syntology.ai/paper/2012.05434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.05434"}},"official":{"repos":["vtddggg/CAA"],"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"]}}}],"record_sha256":"463a2ce54ad2afaa0abd03d717c84eedda82c865a3035f4245dd1aa01bca8275","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}