{"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/fairness/papers/ran/4","list_of":"/task/fairness","task":"Fairness","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":4,"pages_in_order":5,"rows_per_page":100,"rows":[301,400],"of":404,"counts":{"archive_papers_tagged":5676,"with_a_code_link":1714,"where_syntology_ran_a_sample":404,"not_listed_spam_title":0,"listed":5676,"listed_where_code_ran":404,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":329,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":329,"listed_every_run_a_failure_of_syntologys_instrument":75,"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/fairness/papers/ran/1","prev":"/task/fairness/papers/ran/3","next":"/task/fairness/papers/ran/5","papers":[{"url":"/paper/a-new-notion-of-individually-fair-clustering","slug":"a-new-notion-of-individually-fair-clustering","title":"A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center","date":"2021-06-09","arxiv_id":"2106.05423","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/a-new-notion-of-individually-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/2106.05423","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05423"}},"official":{"repos":["chakrabarti/equitable_clustering"],"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/preferencenet-encoding-human-preferences-in","slug":"preferencenet-encoding-human-preferences-in","title":"PreferenceNet: Encoding Human Preferences in Auction Design with Deep Learning","date":"2021-06-06","arxiv_id":"2106.03215","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/preferencenet-encoding-human-preferences-in#ran","syntology_url":"https://syntology.ai/paper/2106.03215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03215"}},"official":{"repos":["neeharperi/PreferenceNet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/node-gam-neural-generalized-additive-model","slug":"node-gam-neural-generalized-additive-model","title":"NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learning","date":"2021-06-03","arxiv_id":"2106.01613","repositories_listed":2,"syntology":{"n":15,"n_ran":9,"n_constructed":5,"n_ran_checked":8,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"9 ran (of which 5 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/node-gam-neural-generalized-additive-model#ran","syntology_url":"https://syntology.ai/paper/2106.01613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01613"}},"official":{"repos":["zzzace2000/nodegam"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/bifair-training-fair-models-with-bilevel","slug":"bifair-training-fair-models-with-bilevel","title":"Fair Machine Learning under Limited Demographically Labeled Data","date":"2021-06-03","arxiv_id":"2106.04757","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/bifair-training-fair-models-with-bilevel#ran","syntology_url":"https://syntology.ai/paper/2106.04757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04757"}},"official":{"repos":["TinfoilHat0/BiFair"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-preprocessing-towards-understanding","slug":"fair-preprocessing-towards-understanding","title":"Fair Preprocessing: Towards Understanding Compositional Fairness of Data Transformers in Machine Learning Pipeline","date":"2021-06-02","arxiv_id":"2106.06054","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-preprocessing-towards-understanding#ran","syntology_url":"https://syntology.ai/paper/2106.06054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06054"}},"official":{"repos":["sumonbis/FairPreprocessing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bias-in-machine-learning-software-why-how","slug":"bias-in-machine-learning-software-why-how","title":"Bias in Machine Learning Software: Why? How? What to do?","date":"2021-05-25","arxiv_id":"2105.12195","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":1,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bias-in-machine-learning-software-why-how#ran","syntology_url":"https://syntology.ai/paper/2105.12195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12195"}},"official":{"repos":["joymallyac/Fair-SMOTE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/causally-motivated-shortcut-removal-using","slug":"causally-motivated-shortcut-removal-using","title":"Causally motivated Shortcut Removal Using Auxiliary Labels","date":"2021-05-13","arxiv_id":"2105.06422","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/causally-motivated-shortcut-removal-using#ran","syntology_url":"https://syntology.ai/paper/2105.06422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.06422"}},"official":{"repos":["mymakar/causally_motivated_shortcut_removal"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/societal-biases-in-language-generation","slug":"societal-biases-in-language-generation","title":"Societal Biases in Language Generation: Progress and Challenges","date":"2021-05-10","arxiv_id":"2105.04054","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/societal-biases-in-language-generation#ran","syntology_url":"https://syntology.ai/paper/2105.04054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04054"}},"official":{"repos":["ewsheng/decoding-biases"],"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/pairwise-fairness-for-ordinal-regression","slug":"pairwise-fairness-for-ordinal-regression","title":"Pairwise Fairness for Ordinal Regression","date":"2021-05-07","arxiv_id":"2105.03153","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pairwise-fairness-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/2105.03153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03153"}},"official":{"repos":["amazon-research/fair-ordinal-regression"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/crosswalk-fairness-enhanced-node","slug":"crosswalk-fairness-enhanced-node","title":"CrossWalk: Fairness-enhanced Node Representation Learning","date":"2021-05-06","arxiv_id":"2105.02725","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/crosswalk-fairness-enhanced-node#ran","syntology_url":"https://syntology.ai/paper/2105.02725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02725"}},"official":{"repos":["ahmadkhajehnejad/CrossWalk"],"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/computationally-efficient-optimization-of-1","slug":"computationally-efficient-optimization-of-1","title":"Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness","date":"2021-05-03","arxiv_id":"2105.00855","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/computationally-efficient-optimization-of-1#ran","syntology_url":"https://syntology.ai/paper/2105.00855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.00855"}},"official":{"repos":["HarrieO/2021-SIGIR-plackett-luce"],"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/biased-edge-dropout-for-enhancing-fairness-in","slug":"biased-edge-dropout-for-enhancing-fairness-in","title":"FairDrop: Biased Edge Dropout for Enhancing Fairness in Graph Representation Learning","date":"2021-04-29","arxiv_id":"2104.14210","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/biased-edge-dropout-for-enhancing-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2104.14210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14210"}},"official":null}},{"url":"/paper/fair-representation-learning-for","slug":"fair-representation-learning-for","title":"Fair Representation Learning for Heterogeneous Information Networks","date":"2021-04-18","arxiv_id":"2104.08769","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/fair-representation-learning-for#ran","syntology_url":"https://syntology.ai/paper/2104.08769","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08769"}},"official":{"repos":["HKUST-KnowComp/Fair_HIN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-active-learning-preemptively-mitigate","slug":"can-active-learning-preemptively-mitigate","title":"Can Active Learning Preemptively Mitigate Fairness Issues?","date":"2021-04-14","arxiv_id":"2104.06879","repositories_listed":3,"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/can-active-learning-preemptively-mitigate#ran","syntology_url":"https://syntology.ai/paper/2104.06879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06879"}},"official":{"repos":["ElementAI/active-fairness"],"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/can-vision-transformers-learn-without-natural","slug":"can-vision-transformers-learn-without-natural","title":"Can Vision Transformers Learn without Natural Images?","date":"2021-03-24","arxiv_id":"2103.13023","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/can-vision-transformers-learn-without-natural#ran","syntology_url":"https://syntology.ai/paper/2103.13023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13023"}},"official":null}},{"url":"/paper/dynamic-slimmable-network","slug":"dynamic-slimmable-network","title":"Dynamic Slimmable Network","date":"2021-03-24","arxiv_id":"2103.13258","repositories_listed":1,"syntology":{"n":17,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":17,"phrase":"7 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; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/dynamic-slimmable-network#ran","syntology_url":"https://syntology.ai/paper/2103.13258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13258"}},"official":{"repos":["changlin31/DS-Net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/refining-neural-networks-with-compositional","slug":"refining-neural-networks-with-compositional","title":"Refining Language Models with Compositional Explanations","date":"2021-03-18","arxiv_id":"2103.10415","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/refining-neural-networks-with-compositional#ran","syntology_url":"https://syntology.ai/paper/2103.10415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10415"}},"official":{"repos":["INK-USC/expl-refinement"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pros-and-cons-of-gan-evaluation-measures-new","slug":"pros-and-cons-of-gan-evaluation-measures-new","title":"Pros and Cons of GAN Evaluation Measures: New Developments","date":"2021-03-17","arxiv_id":"2103.09396","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pros-and-cons-of-gan-evaluation-measures-new#ran","syntology_url":"https://syntology.ai/paper/2103.09396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.09396"}},"official":{"repos":["clovaai/generative-evaluation-prdc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/estimating-and-improving-fairness-with","slug":"estimating-and-improving-fairness-with","title":"Estimating and Improving Fairness with Adversarial Learning","date":"2021-03-07","arxiv_id":"2103.04243","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":3,"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/estimating-and-improving-fairness-with#ran","syntology_url":"https://syntology.ai/paper/2103.04243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.04243"}},"official":null}},{"url":"/paper/fjord-fair-and-accurate-federated-learning","slug":"fjord-fair-and-accurate-federated-learning","title":"FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropout","date":"2021-02-26","arxiv_id":"2102.13451","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/fjord-fair-and-accurate-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2102.13451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13451"}},"official":{"repos":["adap/flower"],"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/classification-with-abstention-but-without","slug":"classification-with-abstention-but-without","title":"Classification with abstention but without disparities","date":"2021-02-24","arxiv_id":"2102.12258","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/classification-with-abstention-but-without#ran","syntology_url":"https://syntology.ai/paper/2102.12258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12258"}},"official":{"repos":["evgchz/dpabst"],"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/fermi-fair-empirical-risk-minimization-via","slug":"fermi-fair-empirical-risk-minimization-via","title":"A Stochastic Optimization Framework for Fair Risk Minimization","date":"2021-02-24","arxiv_id":"2102.12586","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fermi-fair-empirical-risk-minimization-via#ran","syntology_url":"https://syntology.ai/paper/2102.12586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12586"}},"official":{"repos":["optimization-for-data-driven-science/FERMI"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/directional-bias-amplification","slug":"directional-bias-amplification","title":"Directional Bias Amplification","date":"2021-02-24","arxiv_id":"2102.12594","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/directional-bias-amplification#ran","syntology_url":"https://syntology.ai/paper/2102.12594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12594"}},"official":{"repos":["princetonvisualai/directional-bias-amp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/capc-learning-confidential-and-private-1","slug":"capc-learning-confidential-and-private-1","title":"CaPC Learning: Confidential and Private Collaborative Learning","date":"2021-02-09","arxiv_id":"2102.05188","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/capc-learning-confidential-and-private-1#ran","syntology_url":"https://syntology.ai/paper/2102.05188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.05188"}},"official":{"repos":["cleverhans-lab/capc-iclr"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/challenges-in-automated-debiasing-for-toxic","slug":"challenges-in-automated-debiasing-for-toxic","title":"Challenges in Automated Debiasing for Toxic Language Detection","date":"2021-01-29","arxiv_id":"2102.00086","repositories_listed":2,"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/challenges-in-automated-debiasing-for-toxic#ran","syntology_url":"https://syntology.ai/paper/2102.00086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.00086"}},"official":{"repos":["XuhuiZhou/Toxic_Debias"],"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/controllable-guarantees-for-fair-outcomes-via","slug":"controllable-guarantees-for-fair-outcomes-via","title":"Controllable Guarantees for Fair Outcomes via Contrastive Information Estimation","date":"2021-01-11","arxiv_id":"2101.04108","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":4,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 4 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/controllable-guarantees-for-fair-outcomes-via#ran","syntology_url":"https://syntology.ai/paper/2101.04108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.04108"}},"official":{"repos":["umgupta/fairness-via-contrastive-estimation"],"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/exacerbating-algorithmic-bias-through","slug":"exacerbating-algorithmic-bias-through","title":"Exacerbating Algorithmic Bias through Fairness Attacks","date":"2020-12-16","arxiv_id":"2012.08723","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/exacerbating-algorithmic-bias-through#ran","syntology_url":"https://syntology.ai/paper/2012.08723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.08723"}},"official":{"repos":["Ninarehm/attack"],"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/federated-multi-task-learning-for-competing","slug":"federated-multi-task-learning-for-competing","title":"Ditto: Fair and Robust Federated Learning Through Personalization","date":"2020-12-08","arxiv_id":"2012.04221","repositories_listed":4,"syntology":{"n":18,"n_ran":15,"n_constructed":5,"n_ran_checked":12,"n_instrument":3,"n_unverified":3,"n_honours":7,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 12 with no instrument failure: 7 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/federated-multi-task-learning-for-competing#ran","syntology_url":"https://syntology.ai/paper/2012.04221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04221"}},"official":{"repos":["litian96/ditto"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fairbatch-batch-selection-for-model-fairness-1","slug":"fairbatch-batch-selection-for-model-fairness-1","title":"FairBatch: Batch Selection for Model Fairness","date":"2020-12-03","arxiv_id":"2012.01696","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/fairbatch-batch-selection-for-model-fairness-1#ran","syntology_url":"https://syntology.ai/paper/2012.01696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01696"}},"official":{"repos":["yuji-roh/fairbatch"],"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/certified-monotonic-neural-networks-1","slug":"certified-monotonic-neural-networks-1","title":"Certified Monotonic Neural Networks","date":"2020-11-20","arxiv_id":"2011.10219","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/certified-monotonic-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2011.10219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.10219"}},"official":{"repos":["gnobitab/CertifiedMonotonicNetwork"],"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/fair-classification-with-group-dependent","slug":"fair-classification-with-group-dependent","title":"Fair Classification with Group-Dependent Label Noise","date":"2020-10-31","arxiv_id":"2011.00379","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":3,"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: 0 honoured, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-classification-with-group-dependent#ran","syntology_url":"https://syntology.ai/paper/2011.00379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.00379"}},"official":{"repos":["Faldict/fair-classification-with-noisy-labels"],"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/how-do-fair-decisions-fare-in-long-term","slug":"how-do-fair-decisions-fare-in-long-term","title":"How Do Fair Decisions Fare in Long-term Qualification?","date":"2020-10-21","arxiv_id":"2010.11300","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-do-fair-decisions-fare-in-long-term#ran","syntology_url":"https://syntology.ai/paper/2010.11300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11300"}},"official":{"repos":["TURuibo/long-term-impact-of-fairness-constraints"],"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/to-be-robust-or-to-be-fair-towards-fairness-1","slug":"to-be-robust-or-to-be-fair-towards-fairness-1","title":"To be Robust or to be Fair: Towards Fairness in Adversarial Training","date":"2020-10-13","arxiv_id":"2010.06121","repositories_listed":2,"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/to-be-robust-or-to-be-fair-towards-fairness-1#ran","syntology_url":"https://syntology.ai/paper/2010.06121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06121"}},"official":null}},{"url":"/paper/robust-fairness-under-covariate-shift","slug":"robust-fairness-under-covariate-shift","title":"Robust Fairness under Covariate Shift","date":"2020-10-11","arxiv_id":"2010.05166","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-fairness-under-covariate-shift#ran","syntology_url":"https://syntology.ai/paper/2010.05166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05166"}},"official":{"repos":["arezae4/fair_covariate_shift"],"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/learning-the-pareto-front-with-hypernetworks-1","slug":"learning-the-pareto-front-with-hypernetworks-1","title":"Learning the Pareto Front with Hypernetworks","date":"2020-10-08","arxiv_id":"2010.04104","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/learning-the-pareto-front-with-hypernetworks-1#ran","syntology_url":"https://syntology.ai/paper/2010.04104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04104"}},"official":{"repos":["AvivNavon/pareto-hypernetworks"],"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/exact-symbolic-inference-in-probabilistic","slug":"exact-symbolic-inference-in-probabilistic","title":"SPPL: Probabilistic Programming with Fast Exact Symbolic Inference","date":"2020-10-07","arxiv_id":"2010.03485","repositories_listed":1,"syntology":{"n":30,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":20,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/exact-symbolic-inference-in-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2010.03485","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03485"}},"official":{"repos":["probcomp/sppl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":20,"ran_from_kinds":["official"]}}},{"url":"/paper/differentially-private-representation-for-nlp","slug":"differentially-private-representation-for-nlp","title":"Differentially Private Representation for NLP: Formal Guarantee and An Empirical Study on Privacy and Fairness","date":"2020-10-03","arxiv_id":"2010.01285","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentially-private-representation-for-nlp#ran","syntology_url":"https://syntology.ai/paper/2010.01285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01285"}},"official":{"repos":["xlhex/dpnlp"],"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/neither-private-nor-fair-impact-of-data","slug":"neither-private-nor-fair-impact-of-data","title":"Neither Private Nor Fair: Impact of Data Imbalance on Utility and Fairness in Differential Privacy","date":"2020-09-10","arxiv_id":"2009.06389","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/neither-private-nor-fair-impact-of-data#ran","syntology_url":"https://syntology.ai/paper/2009.06389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.06389"}},"official":{"repos":["FarrandTom/deep-learning-fairness"],"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/an-empirical-characterization-of-fair-machine","slug":"an-empirical-characterization-of-fair-machine","title":"An Empirical Characterization of Fair Machine Learning For Clinical Risk Prediction","date":"2020-07-20","arxiv_id":"2007.10306","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-empirical-characterization-of-fair-machine#ran","syntology_url":"https://syntology.ai/paper/2007.10306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.10306"}},"official":{"repos":["som-shahlab/fairness_benchmark"],"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/attack-of-the-tails-yes-you-really-can","slug":"attack-of-the-tails-yes-you-really-can","title":"Attack of the Tails: Yes, You Really Can Backdoor Federated Learning","date":"2020-07-09","arxiv_id":"2007.05084","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/attack-of-the-tails-yes-you-really-can#ran","syntology_url":"https://syntology.ai/paper/2007.05084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05084"}},"official":{"repos":["ksreenivasan/OOD_Federated_Learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tilted-empirical-risk-minimization","slug":"tilted-empirical-risk-minimization","title":"Tilted Empirical Risk Minimization","date":"2020-07-02","arxiv_id":"2007.01162","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":4,"n_no_contract":0,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 4 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tilted-empirical-risk-minimization#ran","syntology_url":"https://syntology.ai/paper/2007.01162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.01162"}},"official":{"repos":["litian96/TERM"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/fairness-without-demographics-through","slug":"fairness-without-demographics-through","title":"Fairness without Demographics through Adversarially Reweighted Learning","date":"2020-06-23","arxiv_id":"2006.13114","repositories_listed":5,"syntology":{"n":8,"n_ran":6,"n_constructed":3,"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 3 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/fairness-without-demographics-through#ran","syntology_url":"https://syntology.ai/paper/2006.13114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13114"}},"official":{"repos":["google-research/google-research"],"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/improving-lime-robustness-with-smarter","slug":"improving-lime-robustness-with-smarter","title":"Improving LIME Robustness with Smarter Locality Sampling","date":"2020-06-22","arxiv_id":"2006.12302","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/improving-lime-robustness-with-smarter#ran","syntology_url":"https://syntology.ai/paper/2006.12302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12302"}},"official":{"repos":["seansaito/Faster-LIME"],"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/distributional-individual-fairness-in","slug":"distributional-individual-fairness-in","title":"Distributional Individual Fairness in Clustering","date":"2020-06-22","arxiv_id":"2006.12589","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/distributional-individual-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2006.12589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12589"}},"official":{"repos":["nihesh/distributional_individual_fairness_in_clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/post-hoc-methods-for-debiasing-neural","slug":"post-hoc-methods-for-debiasing-neural","title":"Intra-Processing Methods for Debiasing Neural Networks","date":"2020-06-15","arxiv_id":"2006.08564","repositories_listed":4,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/post-hoc-methods-for-debiasing-neural#ran","syntology_url":"https://syntology.ai/paper/2006.08564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08564"}},"official":{"repos":["abacusai/intraprocessing_debiasing","realityengines/post_hoc_debiasing"],"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/is-independence-all-you-need-on-the","slug":"is-independence-all-you-need-on-the","title":"On Disentangled Representations Learned From Correlated Data","date":"2020-06-14","arxiv_id":"2006.07886","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/is-independence-all-you-need-on-the#ran","syntology_url":"https://syntology.ai/paper/2006.07886","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07886"}},"official":{"repos":["ftraeuble/disentanglement_lib"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-variational-approach-to-privacy-and","slug":"a-variational-approach-to-privacy-and","title":"A Variational Approach to Privacy and Fairness","date":"2020-06-11","arxiv_id":"2006.06332","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/a-variational-approach-to-privacy-and#ran","syntology_url":"https://syntology.ai/paper/2006.06332","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06332"}},"official":{"repos":["burklight/VariationalPrivacyFairness"],"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/adaptive-sampling-to-reduce-disparate","slug":"adaptive-sampling-to-reduce-disparate","title":"Active Sampling for Min-Max Fairness","date":"2020-06-11","arxiv_id":"2006.06879","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/adaptive-sampling-to-reduce-disparate#ran","syntology_url":"https://syntology.ai/paper/2006.06879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06879"}},"official":{"repos":["amazon-research/active-sampling-for-minmax-fairness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/achieving-equalized-odds-by-resampling","slug":"achieving-equalized-odds-by-resampling","title":"Achieving Equalized Odds by Resampling Sensitive Attributes","date":"2020-06-08","arxiv_id":"2006.04292","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/achieving-equalized-odds-by-resampling#ran","syntology_url":"https://syntology.ai/paper/2006.04292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04292"}},"official":{"repos":["yromano/fair_dummies"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/do-the-machine-learning-models-on-a-crowd","slug":"do-the-machine-learning-models-on-a-crowd","title":"Do the Machine Learning Models on a Crowd Sourced Platform Exhibit Bias? An Empirical Study on Model Fairness","date":"2020-05-21","arxiv_id":"2005.12379","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/do-the-machine-learning-models-on-a-crowd#ran","syntology_url":"https://syntology.ai/paper/2005.12379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.12379"}},"official":{"repos":["sumonbis/ML-Fairness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/comparing-snns-and-rnns-on-neuromorphic","slug":"comparing-snns-and-rnns-on-neuromorphic","title":"Comparing SNNs and RNNs on Neuromorphic Vision Datasets: Similarities and Differences","date":"2020-05-02","arxiv_id":"2005.02183","repositories_listed":1,"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/comparing-snns-and-rnns-on-neuromorphic#ran","syntology_url":"https://syntology.ai/paper/2005.02183","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02183"}},"official":null}},{"url":"/paper/poisoning-attacks-on-algorithmic-fairness","slug":"poisoning-attacks-on-algorithmic-fairness","title":"Poisoning Attacks on Algorithmic Fairness","date":"2020-04-15","arxiv_id":"2004.07401","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/poisoning-attacks-on-algorithmic-fairness#ran","syntology_url":"https://syntology.ai/paper/2004.07401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.07401"}},"official":{"repos":["dsolanno/Poisoning-Attacks-on-Algorithmic-Fairness"],"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/model-agnostic-characterization-of-fairness","slug":"model-agnostic-characterization-of-fairness","title":"FACT: A Diagnostic for Group Fairness Trade-offs","date":"2020-04-07","arxiv_id":"2004.03424","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/model-agnostic-characterization-of-fairness#ran","syntology_url":"https://syntology.ai/paper/2004.03424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.03424"}},"official":{"repos":["wnstlr/FACT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-baseline-for-multi-object-tracking","slug":"a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","arxiv_id":"2004.01888","repositories_listed":33,"syntology":{"n":53,"n_ran":46,"n_constructed":0,"n_ran_checked":43,"n_instrument":3,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":41,"n_pointer_only":1,"phrase":"46 ran (of which 0 constructed an object rather than computing a result; 43 with no instrument failure: 2 honoured, 0 violated, 41 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-simple-baseline-for-multi-object-tracking#ran","syntology_url":"https://syntology.ai/paper/2004.01888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01888"}},"official":{"repos":["ifzhang/FairMOT"],"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/fairrec-two-sided-fairness-for-personalized","slug":"fairrec-two-sided-fairness-for-personalized","title":"FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms","date":"2020-02-25","arxiv_id":"2002.10764","repositories_listed":2,"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/fairrec-two-sided-fairness-for-personalized#ran","syntology_url":"https://syntology.ai/paper/2002.10764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10764"}},"official":{"repos":["gourabkumarpatro/FairRec_www_2020"],"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/fr-train-a-mutual-information-based-approach","slug":"fr-train-a-mutual-information-based-approach","title":"FR-Train: A Mutual Information-Based Approach to Fair and Robust Training","date":"2020-02-24","arxiv_id":"2002.10234","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/fr-train-a-mutual-information-based-approach#ran","syntology_url":"https://syntology.ai/paper/2002.10234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10234"}},"official":{"repos":["yuji-roh/fr-train"],"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/learning-certified-individually-fair","slug":"learning-certified-individually-fair","title":"Learning Certified Individually Fair Representations","date":"2020-02-24","arxiv_id":"2002.10312","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/learning-certified-individually-fair#ran","syntology_url":"https://syntology.ai/paper/2002.10312","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10312"}},"official":{"repos":["eth-sri/lcifr"],"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/multilingual-twitter-corpus-and-baselines-for","slug":"multilingual-twitter-corpus-and-baselines-for","title":"Multilingual Twitter Corpus and Baselines for Evaluating Demographic Bias in Hate Speech Recognition","date":"2020-02-24","arxiv_id":"2002.10361","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/multilingual-twitter-corpus-and-baselines-for#ran","syntology_url":"https://syntology.ai/paper/2002.10361","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10361"}},"official":{"repos":["xiaoleihuang/Multilingual_Fairness_LREC"],"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":["listed","official"]}}},{"url":"/paper/robust-optimization-for-fairness-with-noisy","slug":"robust-optimization-for-fairness-with-noisy","title":"Robust Optimization for Fairness with Noisy Protected Groups","date":"2020-02-21","arxiv_id":"2002.09343","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/robust-optimization-for-fairness-with-noisy#ran","syntology_url":"https://syntology.ai/paper/2002.09343","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09343"}},"official":{"repos":["wenshuoguo/robust-fairness-code"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/oblivious-data-for-fairness-with-kernels","slug":"oblivious-data-for-fairness-with-kernels","title":"Oblivious Data for Fairness with Kernels","date":"2020-02-07","arxiv_id":"2002.02901","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/oblivious-data-for-fairness-with-kernels#ran","syntology_url":"https://syntology.ai/paper/2002.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02901"}},"official":{"repos":["azalk/Oblivious"],"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/robbert-a-dutch-roberta-based-language-model","slug":"robbert-a-dutch-roberta-based-language-model","title":"RobBERT: a Dutch RoBERTa-based Language Model","date":"2020-01-17","arxiv_id":"2001.06286","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/robbert-a-dutch-roberta-based-language-model#ran","syntology_url":"https://syntology.ai/paper/2001.06286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06286"}},"official":{"repos":["iPieter/RobBERT"],"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/fairness-measures-for-regression-via","slug":"fairness-measures-for-regression-via","title":"Fairness Measures for Regression via Probabilistic Classification","date":"2020-01-16","arxiv_id":"2001.06089","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-measures-for-regression-via#ran","syntology_url":"https://syntology.ai/paper/2001.06089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06089"}},"official":null}},{"url":"/paper/towards-fairness-in-visual-recognition","slug":"towards-fairness-in-visual-recognition","title":"Towards Fairness in Visual Recognition: Effective Strategies for Bias Mitigation","date":"2019-11-26","arxiv_id":"1911.11834","repositories_listed":3,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-fairness-in-visual-recognition#ran","syntology_url":"https://syntology.ai/paper/1911.11834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11834"}},"official":{"repos":["princetonvisualai/DomainBiasMitigation"],"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/fair-adversarial-gradient-tree-boosting","slug":"fair-adversarial-gradient-tree-boosting","title":"Fair Adversarial Gradient Tree Boosting","date":"2019-11-13","arxiv_id":"1911.05369","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/fair-adversarial-gradient-tree-boosting#ran","syntology_url":"https://syntology.ai/paper/1911.05369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05369"}},"official":null}},{"url":"/paper/an-empirical-study-on-learning-fairness","slug":"an-empirical-study-on-learning-fairness","title":"An Empirical Study on Learning Fairness Metrics for COMPAS Data with Human Supervision","date":"2019-10-22","arxiv_id":"1910.10255","repositories_listed":1,"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":0,"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/an-empirical-study-on-learning-fairness#ran","syntology_url":"https://syntology.ai/paper/1910.10255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10255"}},"official":{"repos":["hansen7/LearnFairMetric_Empirical"],"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/on-tractable-computation-of-expected","slug":"on-tractable-computation-of-expected","title":"On Tractable Computation of Expected Predictions","date":"2019-10-05","arxiv_id":"1910.02182","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-tractable-computation-of-expected#ran","syntology_url":"https://syntology.ai/paper/1910.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02182"}},"official":{"repos":["UCLA-StarAI/mc2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/score-camimproved-visual-explanations-via","slug":"score-camimproved-visual-explanations-via","title":"Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networks","date":"2019-10-03","arxiv_id":"1910.01279","repositories_listed":9,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 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; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/score-camimproved-visual-explanations-via#ran","syntology_url":"https://syntology.ai/paper/1910.01279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01279"}},"official":{"repos":["haofanwang/Score-CAM"],"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":["listed","official"]}}},{"url":"/paper/fat-forensics-a-python-toolbox-for","slug":"fat-forensics-a-python-toolbox-for","title":"FAT Forensics: A Python Toolbox for Algorithmic Fairness, Accountability and Transparency","date":"2019-09-11","arxiv_id":"1909.05167","repositories_listed":3,"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/fat-forensics-a-python-toolbox-for#ran","syntology_url":"https://syntology.ai/paper/1909.05167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05167"}},"official":{"repos":["fat-forensics/fatf-dashboard","fat-forensics/resources","fat-forensics/fat-forensics"],"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/efficient-task-specific-data-valuation-for","slug":"efficient-task-specific-data-valuation-for","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","date":"2019-08-22","arxiv_id":"1908.08619","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/efficient-task-specific-data-valuation-for#ran","syntology_url":"https://syntology.ai/paper/1908.08619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08619"}},"official":{"repos":["AI-secure/KNN-PVLDB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/wasserstein-fair-classification","slug":"wasserstein-fair-classification","title":"Wasserstein Fair Classification","date":"2019-07-28","arxiv_id":"1907.12059","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/wasserstein-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1907.12059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12059"}},"official":{"repos":["deepmind/wasserstein_fairness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-what-if-tool-interactive-probing-of","slug":"the-what-if-tool-interactive-probing-of","title":"The What-If Tool: Interactive Probing of Machine Learning Models","date":"2019-07-09","arxiv_id":"1907.04135","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/the-what-if-tool-interactive-probing-of#ran","syntology_url":"https://syntology.ai/paper/1907.04135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04135"}},"official":{"repos":["pair-code/what-if-tool"],"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/learning-fair-predictors-with-sensitive","slug":"learning-fair-predictors-with-sensitive","title":"Training individually fair ML models with Sensitive Subspace Robustness","date":"2019-06-28","arxiv_id":"1907.00020","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-fair-predictors-with-sensitive#ran","syntology_url":"https://syntology.ai/paper/1907.00020","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00020"}},"official":{"repos":["IBM/sensitive-subspace-robustness"],"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/fliptest-fairness-auditing-via-optimal","slug":"fliptest-fairness-auditing-via-optimal","title":"FlipTest: Fairness Testing via Optimal Transport","date":"2019-06-21","arxiv_id":"1906.09218","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/fliptest-fairness-auditing-via-optimal#ran","syntology_url":"https://syntology.ai/paper/1906.09218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09218"}},"official":null}},{"url":"/paper/learning-fair-naive-bayes-classifiers-by","slug":"learning-fair-naive-bayes-classifiers-by","title":"Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination Patterns","date":"2019-06-10","arxiv_id":"1906.03843","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/learning-fair-naive-bayes-classifiers-by#ran","syntology_url":"https://syntology.ai/paper/1906.03843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03843"}},"official":{"repos":["UCLA-StarAI/LearnFairNB"],"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/effectiveness-of-equalized-odds-for-fair","slug":"effectiveness-of-equalized-odds-for-fair","title":"Equalized odds postprocessing under imperfect group information","date":"2019-06-07","arxiv_id":"1906.03284","repositories_listed":2,"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/effectiveness-of-equalized-odds-for-fair#ran","syntology_url":"https://syntology.ai/paper/1906.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03284"}},"official":{"repos":["matthklein/equalized_odds_under_perturbation"],"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/fair-near-neighbor-search-independent-range","slug":"fair-near-neighbor-search-independent-range","title":"Fair Near Neighbor Search: Independent Range Sampling in High Dimensions","date":"2019-06-05","arxiv_id":"1906.01859","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/fair-near-neighbor-search-independent-range#ran","syntology_url":"https://syntology.ai/paper/1906.01859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01859"}},"official":{"repos":["alfahaf/fair-near-neighbor-search"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/190600389","slug":"190600389","title":"Disparate Vulnerability to Membership Inference Attacks","date":"2019-06-02","arxiv_id":"1906.00389","repositories_listed":2,"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/190600389#ran","syntology_url":"https://syntology.ai/paper/1906.00389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00389"}},"official":{"repos":["spring-epfl/disparate-vulnerability"],"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/fair-regression-quantitative-definitions-and","slug":"fair-regression-quantitative-definitions-and","title":"Fair Regression: Quantitative Definitions and Reduction-based Algorithms","date":"2019-05-30","arxiv_id":"1905.12843","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":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/fair-regression-quantitative-definitions-and#ran","syntology_url":"https://syntology.ai/paper/1905.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12843"}},"official":null}},{"url":"/paper/190510497","slug":"190510497","title":"Fair Resource Allocation in Federated Learning","date":"2019-05-25","arxiv_id":"1905.10497","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190510497#ran","syntology_url":"https://syntology.ai/paper/1905.10497","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10497"}},"official":{"repos":["litian96/fair_flearn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/average-individual-fairness-algorithms","slug":"average-individual-fairness-algorithms","title":"Average Individual Fairness: Algorithms, Generalization and Experiments","date":"2019-05-25","arxiv_id":"1905.10607","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/average-individual-fairness-algorithms#ran","syntology_url":"https://syntology.ai/paper/1905.10607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10607"}},"official":{"repos":["SaeedSharifiMa/AIF"],"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/compositional-fairness-constraints-for-graph","slug":"compositional-fairness-constraints-for-graph","title":"Compositional Fairness Constraints for Graph Embeddings","date":"2019-05-25","arxiv_id":"1905.10674","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-fairness-constraints-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10674"}},"official":{"repos":["joeybose/Flexible-Fairness-Constraints"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/policy-learning-for-fairness-in-ranking","slug":"policy-learning-for-fairness-in-ranking","title":"Policy Learning for Fairness in Ranking","date":"2019-02-11","arxiv_id":"1902.04056","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/policy-learning-for-fairness-in-ranking#ran","syntology_url":"https://syntology.ai/paper/1902.04056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04056"}},"official":{"repos":["ashudeep/Fair-PGRank"],"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/scalable-fair-clustering","slug":"scalable-fair-clustering","title":"Scalable Fair Clustering","date":"2019-02-10","arxiv_id":"1902.03519","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/scalable-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/1902.03519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03519"}},"official":{"repos":["talwagner/fair_clustering"],"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/agnostic-federated-learning","slug":"agnostic-federated-learning","title":"Agnostic Federated Learning","date":"2019-02-01","arxiv_id":"1902.00146","repositories_listed":7,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/agnostic-federated-learning#ran","syntology_url":"https://syntology.ai/paper/1902.00146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00146"}},"official":null}},{"url":"/paper/noise-tolerant-fair-classification","slug":"noise-tolerant-fair-classification","title":"Noise-tolerant fair classification","date":"2019-01-30","arxiv_id":"1901.10837","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/noise-tolerant-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1901.10837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10837"}},"official":{"repos":["AIasd/noise_fairlearn"],"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/fairness-with-dynamics","slug":"fairness-with-dynamics","title":"Algorithms for Fairness in Sequential Decision Making","date":"2019-01-24","arxiv_id":"1901.08568","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/fairness-with-dynamics#ran","syntology_url":"https://syntology.ai/paper/1901.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08568"}},"official":{"repos":["wmgithub/fairness"],"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/fighting-fire-with-fire-using-antidote-data","slug":"fighting-fire-with-fire-using-antidote-data","title":"Fighting Fire with Fire: Using Antidote Data to Improve Polarization and Fairness of Recommender Systems","date":"2018-12-02","arxiv_id":"1812.01504","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/fighting-fire-with-fire-using-antidote-data#ran","syntology_url":"https://syntology.ai/paper/1812.01504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01504"}},"official":null}},{"url":"/paper/verifying-fairness-properties-via","slug":"verifying-fairness-properties-via","title":"Probabilistic Verification of Fairness Properties via Concentration","date":"2018-12-02","arxiv_id":"1812.02573","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/verifying-fairness-properties-via#ran","syntology_url":"https://syntology.ai/paper/1812.02573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.02573"}},"official":{"repos":["obastani/verifair"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-effect-of-heterogeneous-data-for","slug":"the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","arxiv_id":"1811.12254","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/the-effect-of-heterogeneous-data-for#ran","syntology_url":"https://syntology.ai/paper/1811.12254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12254"}},"official":null}},{"url":"/paper/scalable-robust-kidney-exchange","slug":"scalable-robust-kidney-exchange","title":"Scalable Robust Kidney Exchange","date":"2018-11-08","arxiv_id":"1811.03532","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":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) · 3 unverified","sample_list":"/paper/scalable-robust-kidney-exchange#ran","syntology_url":"https://syntology.ai/paper/1811.03532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03532"}},"official":{"repos":["duncanmcelfresh/RobustKidneyExchange"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-fairness-360-an-extensible-toolkit-for","slug":"ai-fairness-360-an-extensible-toolkit-for","title":"AI Fairness 360: An Extensible Toolkit for Detecting, Understanding, and Mitigating Unwanted Algorithmic Bias","date":"2018-10-03","arxiv_id":"1810.01943","repositories_listed":13,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai-fairness-360-an-extensible-toolkit-for#ran","syntology_url":"https://syntology.ai/paper/1810.01943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01943"}},"official":{"repos":["IBM/AIF360"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-empirical-study-of-rich-subgroup-fairness","slug":"an-empirical-study-of-rich-subgroup-fairness","title":"An Empirical Study of Rich Subgroup Fairness for Machine Learning","date":"2018-08-24","arxiv_id":"1808.08166","repositories_listed":5,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"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) · 8 unverified","sample_list":"/paper/an-empirical-study-of-rich-subgroup-fairness#ran","syntology_url":"https://syntology.ai/paper/1808.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.08166"}},"official":null}},{"url":"/paper/an-intersectional-definition-of-fairness","slug":"an-intersectional-definition-of-fairness","title":"An Intersectional Definition of Fairness","date":"2018-07-22","arxiv_id":"1807.08362","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":0,"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/an-intersectional-definition-of-fairness#ran","syntology_url":"https://syntology.ai/paper/1807.08362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.08362"}},"official":null}},{"url":"/paper/blind-justice-fairness-with-encrypted","slug":"blind-justice-fairness-with-encrypted","title":"Blind Justice: Fairness with Encrypted Sensitive Attributes","date":"2018-06-08","arxiv_id":"1806.03281","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/blind-justice-fairness-with-encrypted#ran","syntology_url":"https://syntology.ai/paper/1806.03281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03281"}},"official":{"repos":["nikikilbertus/blind-justice"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/pots-protective-optimization-technologies","slug":"pots-protective-optimization-technologies","title":"POTs: Protective Optimization Technologies","date":"2018-06-07","arxiv_id":"1806.02711","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/pots-protective-optimization-technologies#ran","syntology_url":"https://syntology.ai/paper/1806.02711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02711"}},"official":{"repos":["spring-epfl/pots"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multiaccuracy-black-box-post-processing-for","slug":"multiaccuracy-black-box-post-processing-for","title":"Multiaccuracy: Black-Box Post-Processing for Fairness in Classification","date":"2018-05-31","arxiv_id":"1805.12317","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multiaccuracy-black-box-post-processing-for#ran","syntology_url":"https://syntology.ai/paper/1805.12317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.12317"}},"official":null}},{"url":"/paper/a-reductions-approach-to-fair-classification","slug":"a-reductions-approach-to-fair-classification","title":"A Reductions Approach to Fair Classification","date":"2018-03-06","arxiv_id":"1803.02453","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/a-reductions-approach-to-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1803.02453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02453"}},"official":null}},{"url":"/paper/learning-adversarially-fair-and-transferable","slug":"learning-adversarially-fair-and-transferable","title":"Learning Adversarially Fair and Transferable Representations","date":"2018-02-17","arxiv_id":"1802.06309","repositories_listed":7,"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/learning-adversarially-fair-and-transferable#ran","syntology_url":"https://syntology.ai/paper/1802.06309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06309"}},"official":{"repos":["VectorInstitute/laftr"],"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/a-comparative-study-of-fairness-enhancing","slug":"a-comparative-study-of-fairness-enhancing","title":"A comparative study of fairness-enhancing interventions in machine learning","date":"2018-02-13","arxiv_id":"1802.04422","repositories_listed":4,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":1,"n_instrument":9,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"10 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; 9 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-comparative-study-of-fairness-enhancing#ran","syntology_url":"https://syntology.ai/paper/1802.04422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04422"}},"official":{"repos":["algofairness/fairness-comparison"],"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":["listed","official"]}}},{"url":"/paper/convex-formulations-for-fair-principal","slug":"convex-formulations-for-fair-principal","title":"Convex Formulations for Fair Principal Component Analysis","date":"2018-02-11","arxiv_id":"1802.03765","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/convex-formulations-for-fair-principal#ran","syntology_url":"https://syntology.ai/paper/1802.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03765"}},"official":{"repos":["molfat66/FairML"],"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"]}}}],"record_sha256":"6ec3ecfdbc693ffe8c3bb2b42b3b4dcd6748edf69c204958ca6b3247c77f06ab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}