{"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/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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":18,"rows_per_page":100,"rows":[101,200],"of":1746,"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","prev":"/task/adversarial-robustness","next":"/task/adversarial-robustness/papers/3","papers":[{"url":"/paper/what-it-thinks-is-important-is-important","slug":"what-it-thinks-is-important-is-important","title":"What it Thinks is Important is Important: Robustness Transfers through Input Gradients","date":"2019-12-11","arxiv_id":"1912.05699","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":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/what-it-thinks-is-important-is-important#ran","syntology_url":"https://syntology.ai/paper/1912.05699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05699"}},"official":{"repos":["alvinchangw/IGAM_CVPR2020"],"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/error-correcting-output-codes-improve","slug":"error-correcting-output-codes-improve","title":"Error Correcting Output Codes Improve Probability Estimation and Adversarial Robustness of Deep Neural Networks","date":"2019-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/mnist-c-a-robustness-benchmark-for-computer","slug":"mnist-c-a-robustness-benchmark-for-computer","title":"MNIST-C: A Robustness Benchmark for Computer Vision","date":"2019-06-05","arxiv_id":"1906.02337","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mnist-c-a-robustness-benchmark-for-computer#ran","syntology_url":"https://syntology.ai/paper/1906.02337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02337"}},"official":{"repos":["google-research/mnist-c"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rethinking-softmax-cross-entropy-loss-for","slug":"rethinking-softmax-cross-entropy-loss-for","title":"Rethinking Softmax Cross-Entropy Loss for Adversarial Robustness","date":"2019-05-25","arxiv_id":"1905.10626","repositories_listed":2,"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":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rethinking-softmax-cross-entropy-loss-for#ran","syntology_url":"https://syntology.ai/paper/1905.10626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10626"}},"official":{"repos":["P2333/Max-Mahalanobis-Training"],"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/190509747","slug":"190509747","title":"Adversarially Robust Distillation","date":"2019-05-23","arxiv_id":"1905.09747","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"6 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190509747#ran","syntology_url":"https://syntology.ai/paper/1905.09747","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09747"}},"official":{"repos":["goldblum/AdversariallyRobustDistillation"],"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"]}}},{"url":"/paper/improving-adversarial-robustness-via-guided","slug":"improving-adversarial-robustness-via-guided","title":"Improving Adversarial Robustness via Guided Complement Entropy","date":"2019-03-23","arxiv_id":"1903.09799","repositories_listed":2,"syntology":null},{"url":"/paper/wasserstein-adversarial-examples-via","slug":"wasserstein-adversarial-examples-via","title":"Wasserstein Adversarial Examples via Projected Sinkhorn Iterations","date":"2019-02-21","arxiv_id":"1902.07906","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wasserstein-adversarial-examples-via#ran","syntology_url":"https://syntology.ai/paper/1902.07906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07906"}},"official":{"repos":["locuslab/projected_sinkhorn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-trained-model-compression-when","slug":"adversarially-trained-model-compression-when","title":"Model Compression with Adversarial Robustness: A Unified Optimization Framework","date":"2019-02-10","arxiv_id":"1902.03538","repositories_listed":2,"syntology":null},{"url":"/paper/feature-denoising-for-improving-adversarial","slug":"feature-denoising-for-improving-adversarial","title":"Feature Denoising for Improving Adversarial Robustness","date":"2018-12-09","arxiv_id":"1812.03411","repositories_listed":2,"syntology":null},{"url":"/paper/disentangling-adversarial-robustness-and","slug":"disentangling-adversarial-robustness-and","title":"Disentangling Adversarial Robustness and Generalization","date":"2018-12-03","arxiv_id":"1812.00740","repositories_listed":2,"syntology":null},{"url":"/paper/robustness-via-curvature-regularization-and","slug":"robustness-via-curvature-regularization-and","title":"Robustness via curvature regularization, and vice versa","date":"2018-11-23","arxiv_id":"1811.09716","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/robustness-via-curvature-regularization-and#ran","syntology_url":"https://syntology.ai/paper/1811.09716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.09716"}},"official":null}},{"url":"/paper/evading-classifiers-in-discrete-domains-with","slug":"evading-classifiers-in-discrete-domains-with","title":"Evading classifiers in discrete domains with provable optimality guarantees","date":"2018-10-25","arxiv_id":"1810.10939","repositories_listed":2,"syntology":null},{"url":"/paper/a-rotation-and-a-translation-suffice-fooling","slug":"a-rotation-and-a-translation-suffice-fooling","title":"Exploring the Landscape of Spatial Robustness","date":"2017-12-07","arxiv_id":"1712.02779","repositories_listed":2,"syntology":null},{"url":"/paper/a-closer-look-at-memorization-in-deep","slug":"a-closer-look-at-memorization-in-deep","title":"A Closer Look at Memorization in Deep Networks","date":"2017-06-16","arxiv_id":"1706.05394","repositories_listed":2,"syntology":null},{"url":"/paper/bridging-robustness-and-generalization","slug":"bridging-robustness-and-generalization","title":"Bridging Robustness and Generalization Against Word Substitution Attacks in NLP via the Growth Bound Matrix Approach","date":"2025-07-14","arxiv_id":"2507.10330","repositories_listed":1,"syntology":null},{"url":"/paper/nic-robustbench-a-comprehensive-open-source","slug":"nic-robustbench-a-comprehensive-open-source","title":"NIC-RobustBench: A Comprehensive Open-Source Toolkit for Neural Image Compression and Robustness Analysis","date":"2025-06-23","arxiv_id":"2506.19051","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08455","slug":"2506-08455","title":"The interplay of robustness and generalization in quantum machine learning","date":"2025-06-10","arxiv_id":"2506.08455","repositories_listed":1,"syntology":null},{"url":"/paper/towards-class-wise-fair-adversarial-training","slug":"towards-class-wise-fair-adversarial-training","title":"Towards Class-wise Fair Adversarial Training via Anti-Bias Soft Label Distillation","date":"2025-06-10","arxiv_id":"2506.08611","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-adversarial-robustness-with","slug":"enhancing-adversarial-robustness-with","title":"Enhancing Adversarial Robustness with Conformal Prediction: A Framework for Guaranteed Model Reliability","date":"2025-06-09","arxiv_id":"2506.07804","repositories_listed":1,"syntology":null},{"url":"/paper/proard-progressive-adversarial-robustness","slug":"proard-progressive-adversarial-robustness","title":"ProARD: progressive adversarial robustness distillation: provide wide range of robust students","date":"2025-06-09","arxiv_id":"2506.07666","repositories_listed":1,"syntology":null},{"url":"/paper/raid-a-dataset-for-testing-the-adversarial","slug":"raid-a-dataset-for-testing-the-adversarial","title":"RAID: A Dataset for Testing the Adversarial Robustness of AI-Generated Image Detectors","date":"2025-06-04","arxiv_id":"2506.03988","repositories_listed":1,"syntology":null},{"url":"/paper/lore-lagrangian-optimized-robust-embeddings","slug":"lore-lagrangian-optimized-robust-embeddings","title":"LORE: Lagrangian-Optimized Robust Embeddings for Visual Encoders","date":"2025-05-24","arxiv_id":"2505.18884","repositories_listed":1,"syntology":null},{"url":"/paper/flowpure-continuous-normalizing-flows-for","slug":"flowpure-continuous-normalizing-flows-for","title":"FlowPure: Continuous Normalizing Flows for Adversarial Purification","date":"2025-05-19","arxiv_id":"2505.13280","repositories_listed":1,"syntology":null},{"url":"/paper/2505-10983","slug":"2505-10983","title":"GenoArmory: A Unified Evaluation Framework for Adversarial Attacks on Genomic Foundation Models","date":"2025-05-16","arxiv_id":"2505.10983","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-the-robustness-of-adversarial","slug":"evaluating-the-robustness-of-adversarial","title":"Evaluating the Robustness of Adversarial Defenses in Malware Detection Systems","date":"2025-05-14","arxiv_id":"2505.09342","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-analysis-of-vision","slug":"adversarial-robustness-analysis-of-vision","title":"Adversarial Robustness Analysis of Vision-Language Models in Medical Image Segmentation","date":"2025-05-05","arxiv_id":"2505.02971","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-of-deep-learning-1","slug":"adversarial-robustness-of-deep-learning-1","title":"Adversarial Robustness of Deep Learning Models for Inland Water Body Segmentation from SAR Images","date":"2025-05-03","arxiv_id":"2505.01884","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-low-cost-genomic-foundation-models","slug":"fast-and-low-cost-genomic-foundation-models","title":"Fast and Low-Cost Genomic Foundation Models via Outlier Removal","date":"2025-05-01","arxiv_id":"2505.00598","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"9 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-and-low-cost-genomic-foundation-models#ran","syntology_url":"https://syntology.ai/paper/2505.00598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.00598"}},"official":{"repos":["MAGICS-LAB/GERM"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/oet-optimization-based-prompt-injection","slug":"oet-optimization-based-prompt-injection","title":"OET: Optimization-based prompt injection Evaluation Toolkit","date":"2025-05-01","arxiv_id":"2505.00843","repositories_listed":1,"syntology":null},{"url":"/paper/towards-robust-llms-an-adversarial-robustness-1","slug":"towards-robust-llms-an-adversarial-robustness-1","title":"Towards Robust LLMs: an Adversarial Robustness Measurement Framework","date":"2025-04-24","arxiv_id":"2504.17723","repositories_listed":1,"syntology":null},{"url":"/paper/r-tpt-improving-adversarial-robustness-of","slug":"r-tpt-improving-adversarial-robustness-of","title":"R-TPT: Improving Adversarial Robustness of Vision-Language Models through Test-Time Prompt Tuning","date":"2025-04-15","arxiv_id":"2504.11195","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/r-tpt-improving-adversarial-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2504.11195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11195"}},"official":{"repos":["tomsheng21/r-tpt"],"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/benchmarking-adversarial-robustness-to-bias","slug":"benchmarking-adversarial-robustness-to-bias","title":"Benchmarking Adversarial Robustness to Bias Elicitation in Large Language Models: Scalable Automated Assessment with LLM-as-a-Judge","date":"2025-04-10","arxiv_id":"2504.07887","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-theoretical-gap-in-randomized","slug":"bridging-the-theoretical-gap-in-randomized","title":"Bridging the Theoretical Gap in Randomized Smoothing","date":"2025-04-03","arxiv_id":"2504.02412","repositories_listed":1,"syntology":null},{"url":"/paper/feature-statistics-with-uncertainty-help","slug":"feature-statistics-with-uncertainty-help","title":"Feature Statistics with Uncertainty Help Adversarial Robustness","date":"2025-03-26","arxiv_id":"2503.20583","repositories_listed":1,"syntology":null},{"url":"/paper/robustness-tokens-towards-adversarial","slug":"robustness-tokens-towards-adversarial","title":"Robustness Tokens: Towards Adversarial Robustness of Transformers","date":"2025-03-13","arxiv_id":"2503.10191","repositories_listed":1,"syntology":null},{"url":"/paper/fairdeface-evaluating-the-fairness-and","slug":"fairdeface-evaluating-the-fairness-and","title":"FairDeFace: Evaluating the Fairness and Adversarial Robustness of Face Obfuscation Methods","date":"2025-03-11","arxiv_id":"2503.08731","repositories_listed":1,"syntology":null},{"url":"/paper/clip-is-strong-enough-to-fight-back-test-time","slug":"clip-is-strong-enough-to-fight-back-test-time","title":"CLIP is Strong Enough to Fight Back: Test-time Counterattacks towards Zero-shot Adversarial Robustness of CLIP","date":"2025-03-05","arxiv_id":"2503.03613","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":4,"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/clip-is-strong-enough-to-fight-back-test-time#ran","syntology_url":"https://syntology.ai/paper/2503.03613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03613"}},"official":{"repos":["Sxing2/CLIP-Test-time-Counterattacks"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/taet-two-stage-adversarial-equalization","slug":"taet-two-stage-adversarial-equalization","title":"TAET: Two-Stage Adversarial Equalization Training on Long-Tailed Distributions","date":"2025-03-02","arxiv_id":"2503.01924","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/taet-two-stage-adversarial-equalization#ran","syntology_url":"https://syntology.ai/paper/2503.01924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01924"}},"official":{"repos":["buhuiok/taet-two-stage-adversarial-equalization-training-on-long-tailed-distributions"],"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/transformer-meets-twicing-harnessing","slug":"transformer-meets-twicing-harnessing","title":"Transformer Meets Twicing: Harnessing Unattended Residual Information","date":"2025-03-02","arxiv_id":"2503.00687","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/transformer-meets-twicing-harnessing#ran","syntology_url":"https://syntology.ai/paper/2503.00687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.00687"}},"official":{"repos":["lazizcodes/twicing_attention"],"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/evaluation-of-hate-speech-detection-using","slug":"evaluation-of-hate-speech-detection-using","title":"Evaluation of Hate Speech Detection Using Large Language Models and Geographical Contextualization","date":"2025-02-26","arxiv_id":"2502.19612","repositories_listed":1,"syntology":null},{"url":"/paper/improved-diffusion-based-generative-model","slug":"improved-diffusion-based-generative-model","title":"Improved Diffusion-based Generative Model with Better Adversarial Robustness","date":"2025-02-24","arxiv_id":"2502.17099","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":9,"n_instrument":5,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 4 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improved-diffusion-based-generative-model#ran","syntology_url":"https://syntology.ai/paper/2502.17099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17099"}},"official":{"repos":["kugwzk/at_diff"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mixup-model-merge-enhancing-model-merging","slug":"mixup-model-merge-enhancing-model-merging","title":"Mixup Model Merge: Enhancing Model Merging Performance through Randomized Linear Interpolation","date":"2025-02-21","arxiv_id":"2502.15434","repositories_listed":1,"syntology":null},{"url":"/paper/confidence-elicitation-a-new-attack-vector","slug":"confidence-elicitation-a-new-attack-vector","title":"Confidence Elicitation: A New Attack Vector for Large Language Models","date":"2025-02-07","arxiv_id":"2502.04643","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-reasoning-at-jailbreaking-time","slug":"adversarial-reasoning-at-jailbreaking-time","title":"Adversarial Reasoning at Jailbreaking Time","date":"2025-02-03","arxiv_id":"2502.01633","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adversarial-reasoning-at-jailbreaking-time#ran","syntology_url":"https://syntology.ai/paper/2502.01633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.01633"}},"official":{"repos":["helloworld10011/adversarial-reasoning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-llava-on-the-effectiveness-of-large","slug":"robust-llava-on-the-effectiveness-of-large","title":"Robust-LLaVA: On the Effectiveness of Large-Scale Robust Image Encoders for Multi-modal Large Language Models","date":"2025-02-03","arxiv_id":"2502.01576","repositories_listed":1,"syntology":null},{"url":"/paper/camp-in-the-odyssey-provably-robust","slug":"camp-in-the-odyssey-provably-robust","title":"CAMP in the Odyssey: Provably Robust Reinforcement Learning with Certified Radius Maximization","date":"2025-01-29","arxiv_id":"2501.17667","repositories_listed":1,"syntology":null},{"url":"/paper/videopure-diffusion-based-adversarial","slug":"videopure-diffusion-based-adversarial","title":"VideoPure: Diffusion-based Adversarial Purification for Video Recognition","date":"2025-01-25","arxiv_id":"2501.14999","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-study-of-accuracy-robustness","slug":"an-empirical-study-of-accuracy-robustness","title":"An Empirical Study of Accuracy-Robustness Tradeoff and Training Efficiency in Self-Supervised Learning","date":"2025-01-07","arxiv_id":"2501.03507","repositories_listed":1,"syntology":null},{"url":"/paper/tougher-text-smarter-models-raising-the-bar","slug":"tougher-text-smarter-models-raising-the-bar","title":"Tougher Text, Smarter Models: Raising the Bar for Adversarial Defence Benchmarks","date":"2025-01-05","arxiv_id":"2501.02654","repositories_listed":1,"syntology":null},{"url":"/paper/advancing-adversarial-robustness-in-gnerfs","slug":"advancing-adversarial-robustness-in-gnerfs","title":"Advancing Adversarial Robustness in GNeRFs: The IL2-NeRF Attack","date":"2025-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-contrastive-explanations-on-demand","slug":"efficient-contrastive-explanations-on-demand","title":"Efficient Contrastive Explanations on Demand","date":"2024-12-24","arxiv_id":"2412.18262","repositories_listed":1,"syntology":null},{"url":"/paper/human-in-the-loop-generation-of-adversarial","slug":"human-in-the-loop-generation-of-adversarial","title":"Human-in-the-Loop Generation of Adversarial Texts: A Case Study on Tibetan Script","date":"2024-12-17","arxiv_id":"2412.12478","repositories_listed":1,"syntology":null},{"url":"/paper/targeted-view-invariant-adversarial","slug":"targeted-view-invariant-adversarial","title":"Targeted View-Invariant Adversarial Perturbations for 3D Object Recognition","date":"2024-12-17","arxiv_id":"2412.13376","repositories_listed":1,"syntology":null},{"url":"/paper/towards-adversarial-robustness-of-model-level","slug":"towards-adversarial-robustness-of-model-level","title":"Towards Adversarial Robustness of Model-Level Mixture-of-Experts Architectures for Semantic Segmentation","date":"2024-12-16","arxiv_id":"2412.11608","repositories_listed":1,"syntology":null},{"url":"/paper/learning-robust-and-privacy-preserving","slug":"learning-robust-and-privacy-preserving","title":"Learning Robust and Privacy-Preserving Representations via Information Theory","date":"2024-12-15","arxiv_id":"2412.11066","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-of-bottleneck-injected","slug":"adversarial-robustness-of-bottleneck-injected","title":"Adversarial Robustness of Bottleneck Injected Deep Neural Networks for Task-Oriented Communication","date":"2024-12-13","arxiv_id":"2412.10265","repositories_listed":1,"syntology":null},{"url":"/paper/on-adversarial-robustness-and-out-of","slug":"on-adversarial-robustness-and-out-of","title":"On Adversarial Robustness and Out-of-Distribution Robustness of Large Language Models","date":"2024-12-13","arxiv_id":"2412.10535","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":13,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-adversarial-robustness-and-out-of#ran","syntology_url":"https://syntology.ai/paper/2412.10535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.10535"}},"official":{"repos":["jordantab/llm-robustness-experiment"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/demem-privacy-enhanced-robust-adversarial","slug":"demem-privacy-enhanced-robust-adversarial","title":"DeMem: Privacy-Enhanced Robust Adversarial Learning via De-Memorization","date":"2024-12-08","arxiv_id":"2412.05767","repositories_listed":1,"syntology":null},{"url":"/paper/tscheater-generating-high-quality-tibetan","slug":"tscheater-generating-high-quality-tibetan","title":"TSCheater: Generating High-Quality Tibetan Adversarial Texts via Visual Similarity","date":"2024-12-03","arxiv_id":"2412.02371","repositories_listed":1,"syntology":null},{"url":"/paper/iqa-adapter-exploring-knowledge-transfer-from","slug":"iqa-adapter-exploring-knowledge-transfer-from","title":"IQA-Adapter: Exploring Knowledge Transfer from Image Quality Assessment to Diffusion-based Generative Models","date":"2024-12-02","arxiv_id":"2412.01794","repositories_listed":1,"syntology":null},{"url":"/paper/warlearn-weather-adaptive-representation","slug":"warlearn-weather-adaptive-representation","title":"WARLearn: Weather-Adaptive Representation Learning","date":"2024-11-21","arxiv_id":"2411.14095","repositories_listed":1,"syntology":null},{"url":"/paper/towards-million-scale-adversarial-robustness","slug":"towards-million-scale-adversarial-robustness","title":"Towards Million-Scale Adversarial Robustness Evaluation With Stronger Individual Attacks","date":"2024-11-20","arxiv_id":"2411.15210","repositories_listed":1,"syntology":null},{"url":"/paper/beard-benchmarking-the-adversarial-robustness","slug":"beard-benchmarking-the-adversarial-robustness","title":"BEARD: Benchmarking the Adversarial Robustness for Dataset Distillation","date":"2024-11-14","arxiv_id":"2411.09265","repositories_listed":1,"syntology":null},{"url":"/paper/confidence-aware-denoised-fine-tuning-of-off","slug":"confidence-aware-denoised-fine-tuning-of-off","title":"Confidence-aware Denoised Fine-tuning of Off-the-shelf Models for Certified Robustness","date":"2024-11-13","arxiv_id":"2411.08933","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-meta-learning-for-robust-deepfake","slug":"adaptive-meta-learning-for-robust-deepfake","title":"Adaptive Meta-Learning for Robust Deepfake Detection: A Multi-Agent Framework to Data Drift and Model Generalization","date":"2024-11-12","arxiv_id":"2411.08148","repositories_listed":1,"syntology":null},{"url":"/paper/neural-fingerprints-for-adversarial-attack","slug":"neural-fingerprints-for-adversarial-attack","title":"Neural Fingerprints for Adversarial Attack Detection","date":"2024-11-07","arxiv_id":"2411.04533","repositories_listed":1,"syntology":null},{"url":"/paper/diffpad-denoising-diffusion-based-adversarial","slug":"diffpad-denoising-diffusion-based-adversarial","title":"DiffPAD: Denoising Diffusion-based Adversarial Patch Decontamination","date":"2024-10-31","arxiv_id":"2410.24006","repositories_listed":1,"syntology":null},{"url":"/paper/causadv-a-causal-based-framework-for","slug":"causadv-a-causal-based-framework-for","title":"CausAdv: A Causal-based Framework for Detecting Adversarial Examples","date":"2024-10-29","arxiv_id":"2411.00839","repositories_listed":1,"syntology":null},{"url":"/paper/text-guided-attention-is-all-you-need-for","slug":"text-guided-attention-is-all-you-need-for","title":"Text-Guided Attention is All You Need for Zero-Shot Robustness in Vision-Language Models","date":"2024-10-29","arxiv_id":"2410.21802","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/text-guided-attention-is-all-you-need-for#ran","syntology_url":"https://syntology.ai/paper/2410.21802","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.21802"}},"official":{"repos":["zhyblue424/tga-zsr"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/toward-robust-ralms-revealing-the-impact-of","slug":"toward-robust-ralms-revealing-the-impact-of","title":"Toward Robust RALMs: Revealing the Impact of Imperfect Retrieval on Retrieval-Augmented Language Models","date":"2024-10-19","arxiv_id":"2410.15107","repositories_listed":1,"syntology":null},{"url":"/paper/artificial-kuramoto-oscillatory-neurons","slug":"artificial-kuramoto-oscillatory-neurons","title":"Artificial Kuramoto Oscillatory Neurons","date":"2024-10-17","arxiv_id":"2410.13821","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/artificial-kuramoto-oscillatory-neurons#ran","syntology_url":"https://syntology.ai/paper/2410.13821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13821"}},"official":{"repos":["autonomousvision/akorn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/dat-improving-adversarial-robustness-via","slug":"dat-improving-adversarial-robustness-via","title":"DAT: Improving Adversarial Robustness via Generative Amplitude Mix-up in Frequency Domain","date":"2024-10-16","arxiv_id":"2410.12307","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/dat-improving-adversarial-robustness-via#ran","syntology_url":"https://syntology.ai/paper/2410.12307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12307"}},"official":{"repos":["Feng-peng-Li/DAT"],"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/new-paradigm-of-adversarial-training-breaking","slug":"new-paradigm-of-adversarial-training-breaking","title":"New Paradigm of Adversarial Training: Breaking Inherent Trade-Off between Accuracy and Robustness via Dummy Classes","date":"2024-10-16","arxiv_id":"2410.12671","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"8 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/new-paradigm-of-adversarial-training-breaking#ran","syntology_url":"https://syntology.ai/paper/2410.12671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12671"}},"official":{"repos":["FlaAI/DUCAT"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/out-of-bounding-box-triggers-a-stealthy","slug":"out-of-bounding-box-triggers-a-stealthy","title":"Out-of-Bounding-Box Triggers: A Stealthy Approach to Cheat Object Detectors","date":"2024-10-14","arxiv_id":"2410.10091","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/out-of-bounding-box-triggers-a-stealthy#ran","syntology_url":"https://syntology.ai/paper/2410.10091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10091"}},"official":{"repos":["lintotao/out-of-bbox-attack"],"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/give-me-a-hint-can-llms-take-a-hint-to-solve","slug":"give-me-a-hint-can-llms-take-a-hint-to-solve","title":"Give me a hint: Can LLMs take a hint to solve math problems?","date":"2024-10-08","arxiv_id":"2410.05915","repositories_listed":1,"syntology":null},{"url":"/paper/mibench-a-comprehensive-benchmark-for-model","slug":"mibench-a-comprehensive-benchmark-for-model","title":"MIBench: A Comprehensive Framework for Benchmarking Model Inversion Attack and Defense","date":"2024-10-07","arxiv_id":"2410.05159","repositories_listed":1,"syntology":null},{"url":"/paper/a-brain-inspired-regularizer-for-adversarial","slug":"a-brain-inspired-regularizer-for-adversarial","title":"A Brain-Inspired Regularizer for Adversarial Robustness","date":"2024-10-04","arxiv_id":"2410.03952","repositories_listed":1,"syntology":null},{"url":"/paper/fake-it-until-you-break-it-on-the-adversarial","slug":"fake-it-until-you-break-it-on-the-adversarial","title":"Fake It Until You Break It: On the Adversarial Robustness of AI-generated Image Detectors","date":"2024-10-02","arxiv_id":"2410.01574","repositories_listed":1,"syntology":null},{"url":"/paper/morel-enhancing-adversarial-robustness","slug":"morel-enhancing-adversarial-robustness","title":"MOREL: Enhancing Adversarial Robustness through Multi-Objective Representation Learning","date":"2024-10-02","arxiv_id":"2410.01697","repositories_listed":1,"syntology":null},{"url":"/paper/nonideality-aware-training-makes-memristive","slug":"nonideality-aware-training-makes-memristive","title":"Nonideality-aware training makes memristive networks more robust to adversarial attacks","date":"2024-09-29","arxiv_id":"2409.19671","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-adversarial-robustness-in-natural","slug":"enhancing-adversarial-robustness-in-natural","title":"Enhancing adversarial robustness in Natural Language Inference using explanations","date":"2024-09-11","arxiv_id":"2409.07423","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attacks-on-data-attribution","slug":"adversarial-attacks-on-data-attribution","title":"Adversarial Attacks on Data Attribution","date":"2024-09-09","arxiv_id":"2409.05657","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-attacks-on-data-attribution#ran","syntology_url":"https://syntology.ai/paper/2409.05657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.05657"}},"official":{"repos":["trais-lab/adversarial-attack-data-attribution"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-practical-approach-to-evaluating-the","slug":"a-practical-approach-to-evaluating-the","title":"A practical approach to evaluating the adversarial distance for machine learning classifiers","date":"2024-09-05","arxiv_id":"2409.03598","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-pruning-a-survey-and-benchmark-of","slug":"adversarial-pruning-a-survey-and-benchmark-of","title":"Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustness","date":"2024-09-02","arxiv_id":"2409.01249","repositories_listed":1,"syntology":null},{"url":"/paper/lightpure-realtime-adversarial-image","slug":"lightpure-realtime-adversarial-image","title":"LightPure: Realtime Adversarial Image Purification for Mobile Devices Using Diffusion Models","date":"2024-08-31","arxiv_id":"2409.00340","repositories_listed":1,"syntology":null},{"url":"/paper/improving-adversarial-robustness-in-android","slug":"improving-adversarial-robustness-in-android","title":"Improving Adversarial Robustness in Android Malware Detection by Reducing the Impact of Spurious Correlations","date":"2024-08-27","arxiv_id":"2408.16025","repositories_listed":1,"syntology":null},{"url":"/paper/segment-anything-models-achieve-zero-shot","slug":"segment-anything-models-achieve-zero-shot","title":"Segment-Anything Models Achieve Zero-shot Robustness in Autonomous Driving","date":"2024-08-19","arxiv_id":"2408.09839","repositories_listed":1,"syntology":null},{"url":"/paper/can-large-language-models-improve-the","slug":"can-large-language-models-improve-the","title":"Can Large Language Models Improve the Adversarial Robustness of Graph Neural Networks?","date":"2024-08-16","arxiv_id":"2408.08685","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-image-to-image-diffusion-classifier","slug":"efficient-image-to-image-diffusion-classifier","title":"Efficient Image-to-Image Diffusion Classifier for Adversarial Robustness","date":"2024-08-16","arxiv_id":"2408.08502","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":7,"n_instrument":9,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":5,"n_pointer_only":18,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 9 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-image-to-image-diffusion-classifier#ran","syntology_url":"https://syntology.ai/paper/2408.08502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.08502"}},"official":{"repos":["hfmei/idc"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/kolmogorov-arnold-networks-kan-for-time","slug":"kolmogorov-arnold-networks-kan-for-time","title":"Kolmogorov-Arnold Networks (KAN) for Time Series Classification and Robust Analysis","date":"2024-08-14","arxiv_id":"2408.07314","repositories_listed":1,"syntology":null},{"url":"/paper/tabularbench-benchmarking-adversarial","slug":"tabularbench-benchmarking-adversarial","title":"TabularBench: Benchmarking Adversarial Robustness for Tabular Deep Learning in Real-world Use-cases","date":"2024-08-14","arxiv_id":"2408.07579","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/tabularbench-benchmarking-adversarial#ran","syntology_url":"https://syntology.ai/paper/2408.07579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07579"}},"official":{"repos":["serval-uni-lu/tabularbench"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-01541","slug":"2408-01541","title":"Guardians of Image Quality: Benchmarking Defenses Against Adversarial Attacks on Image Quality Metrics","date":"2024-08-02","arxiv_id":"2408.01541","repositories_listed":1,"syntology":null},{"url":"/paper/rsc-snn-exploring-the-trade-off-between","slug":"rsc-snn-exploring-the-trade-off-between","title":"RSC-SNN: Exploring the Trade-off Between Adversarial Robustness and Accuracy in Spiking Neural Networks via Randomized Smoothing Coding","date":"2024-07-29","arxiv_id":"2407.20099","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustification-via-text-to-image","slug":"adversarial-robustification-via-text-to-image","title":"Adversarial Robustification via Text-to-Image Diffusion Models","date":"2024-07-26","arxiv_id":"2407.18658","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adversarial-robustification-via-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2407.18658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18658"}},"official":{"repos":["choidae1/robustify-t2i"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-robust-decision-transformer","slug":"adversarial-robust-decision-transformer","title":"Adversarially Robust Decision Transformer","date":"2024-07-25","arxiv_id":"2407.18414","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/adversarial-robust-decision-transformer#ran","syntology_url":"https://syntology.ai/paper/2407.18414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18414"}},"official":{"repos":["xiaohangt/ardt"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/exploring-scaling-trends-in-llm-robustness","slug":"exploring-scaling-trends-in-llm-robustness","title":"Scaling Trends in Language Model Robustness","date":"2024-07-25","arxiv_id":"2407.18213","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/exploring-scaling-trends-in-llm-robustness#ran","syntology_url":"https://syntology.ai/paper/2407.18213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.18213"}},"official":{"repos":["AlignmentResearch/scaling-llm-robustness-paper"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-robust-self-supervised-learning","slug":"benchmarking-robust-self-supervised-learning","title":"Benchmarking Robust Self-Supervised Learning Across Diverse Downstream Tasks","date":"2024-07-17","arxiv_id":"2407.12588","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/benchmarking-robust-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2407.12588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12588"}},"official":{"repos":["layer6ai-labs/ssl-robustness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/segstrong-c-segmenting-surgical-tools","slug":"segstrong-c-segmenting-surgical-tools","title":"SegSTRONG-C: Segmenting Surgical Tools Robustly On Non-adversarial Generated Corruptions -- An EndoVis'24 Challenge","date":"2024-07-16","arxiv_id":"2407.11906","repositories_listed":1,"syntology":null},{"url":"/paper/partimagenet-dataset-scaling-up-part-based","slug":"partimagenet-dataset-scaling-up-part-based","title":"PartImageNet++ Dataset: Scaling up Part-based Models for Robust Recognition","date":"2024-07-15","arxiv_id":"2407.10918","repositories_listed":1,"syntology":{"n":19,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/partimagenet-dataset-scaling-up-part-based#ran","syntology_url":"https://syntology.ai/paper/2407.10918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10918"}},"official":{"repos":["LixiaoTHU/PartImageNetPP"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-the-adversarial-robustness-of-2","slug":"evaluating-the-adversarial-robustness-of-2","title":"Evaluating the Adversarial Robustness of Semantic Segmentation: Trying Harder Pays Off","date":"2024-07-12","arxiv_id":"2407.09150","repositories_listed":1,"syntology":null}],"record_sha256":"6736df1e9ff3858dfa507fd5248915eba684f7b4a54f02ad2753020d7441c3cb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}