{"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/3","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":3,"pages_in_order":5,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/fairness/papers/ran/4","papers":[{"url":"/paper/a-fair-loss-function-for-network-pruning","slug":"a-fair-loss-function-for-network-pruning","title":"A Fair Loss Function for Network Pruning","date":"2022-11-18","arxiv_id":"2211.10285","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-fair-loss-function-for-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2211.10285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10285"}},"official":{"repos":["robbiemeyer/pw_loss_pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/fairmile-a-multi-level-framework-for-fair-and","slug":"fairmile-a-multi-level-framework-for-fair-and","title":"FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning","date":"2022-11-17","arxiv_id":"2211.09925","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":3,"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/fairmile-a-multi-level-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2211.09925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09925"}},"official":{"repos":["heyuntian/fairmile"],"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/rise-robust-individualized-decision-learning","slug":"rise-robust-individualized-decision-learning","title":"RISE: Robust Individualized Decision Learning with Sensitive Variables","date":"2022-11-12","arxiv_id":"2211.06569","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"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) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/rise-robust-individualized-decision-learning#ran","syntology_url":"https://syntology.ai/paper/2211.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06569"}},"official":{"repos":["ellenxtan/rise"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-certificates-for-differentially","slug":"fairness-certificates-for-differentially","title":"Differential Privacy has Bounded Impact on Fairness in Classification","date":"2022-10-28","arxiv_id":"2210.16242","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/fairness-certificates-for-differentially#ran","syntology_url":"https://syntology.ai/paper/2210.16242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16242"}},"official":{"repos":["pmangold/fairness-privacy"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/mabel-attenuating-gender-bias-using-textual","slug":"mabel-attenuating-gender-bias-using-textual","title":"MABEL: Attenuating Gender Bias using Textual Entailment Data","date":"2022-10-26","arxiv_id":"2210.14975","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/mabel-attenuating-gender-bias-using-textual#ran","syntology_url":"https://syntology.ai/paper/2210.14975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.14975"}},"official":{"repos":["princeton-nlp/mabel"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/i-prefer-not-to-say-operationalizing-fair-and","slug":"i-prefer-not-to-say-operationalizing-fair-and","title":"I Prefer not to Say: Protecting User Consent in Models with Optional Personal Data","date":"2022-10-25","arxiv_id":"2210.13954","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/i-prefer-not-to-say-operationalizing-fair-and#ran","syntology_url":"https://syntology.ai/paper/2210.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13954"}},"official":{"repos":["tleemann/protectedconsent"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mitigating-gender-bias-in-face-recognition","slug":"mitigating-gender-bias-in-face-recognition","title":"Mitigating Gender Bias in Face Recognition Using the von Mises-Fisher Mixture Model","date":"2022-10-24","arxiv_id":"2210.13664","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mitigating-gender-bias-in-face-recognition#ran","syntology_url":"https://syntology.ai/paper/2210.13664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13664"}},"official":{"repos":["JRConti/EthicalModule_vMF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mitigating-gradient-bias-in-multi-objective","slug":"mitigating-gradient-bias-in-multi-objective","title":"Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach","date":"2022-10-23","arxiv_id":"2210.12624","repositories_listed":4,"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/mitigating-gradient-bias-in-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2210.12624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12624"}},"official":null}},{"url":"/paper/on-demand-sampling-learning-optimally-from","slug":"on-demand-sampling-learning-optimally-from","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","date":"2022-10-22","arxiv_id":"2210.12529","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/on-demand-sampling-learning-optimally-from#ran","syntology_url":"https://syntology.ai/paper/2210.12529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12529"}},"official":{"repos":["ericzhao28/multidistributionlearning"],"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/policy-optimization-with-advantage","slug":"policy-optimization-with-advantage","title":"Policy Optimization with Advantage Regularization for Long-Term Fairness in Decision Systems","date":"2022-10-22","arxiv_id":"2210.12546","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/policy-optimization-with-advantage#ran","syntology_url":"https://syntology.ai/paper/2210.12546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12546"}},"official":{"repos":["ericyangyu/pocar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-learning-fairness-and-accuracy-on-multiple","slug":"on-learning-fairness-and-accuracy-on-multiple","title":"On Learning Fairness and Accuracy on Multiple Subgroups","date":"2022-10-19","arxiv_id":"2210.10837","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":3,"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; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-learning-fairness-and-accuracy-on-multiple#ran","syntology_url":"https://syntology.ai/paper/2210.10837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10837"}},"official":{"repos":["xugezheng/fams"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-bias-mitigation-fairer","slug":"rethinking-bias-mitigation-fairer","title":"Rethinking Bias Mitigation: Fairer Architectures Make for Fairer Face Recognition","date":"2022-10-18","arxiv_id":"2210.09943","repositories_listed":2,"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/rethinking-bias-mitigation-fairer#ran","syntology_url":"https://syntology.ai/paper/2210.09943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09943"}},"official":{"repos":["dooleys/fr-nas"],"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/bertscore-is-unfair-on-social-bias-in","slug":"bertscore-is-unfair-on-social-bias-in","title":"BERTScore is Unfair: On Social Bias in Language Model-Based Metrics for Text Generation","date":"2022-10-14","arxiv_id":"2210.07626","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":1,"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/bertscore-is-unfair-on-social-bias-in#ran","syntology_url":"https://syntology.ai/paper/2210.07626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07626"}},"official":{"repos":["txsun1997/metric-fairness"],"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/equal-improvability-a-new-fairness-notion","slug":"equal-improvability-a-new-fairness-notion","title":"Equal Improvability: A New Fairness Notion Considering the Long-term Impact","date":"2022-10-13","arxiv_id":"2210.06732","repositories_listed":1,"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/equal-improvability-a-new-fairness-notion#ran","syntology_url":"https://syntology.ai/paper/2210.06732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06732"}},"official":{"repos":["guldoganozgur/ei_fairness"],"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/fare-provably-fair-representation-learning","slug":"fare-provably-fair-representation-learning","title":"FARE: Provably Fair Representation Learning with Practical Certificates","date":"2022-10-13","arxiv_id":"2210.07213","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fare-provably-fair-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2210.07213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07213"}},"official":{"repos":["eth-sri/fare"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/efficiently-computing-local-lipschitz","slug":"efficiently-computing-local-lipschitz","title":"Efficiently Computing Local Lipschitz Constants of Neural Networks via Bound Propagation","date":"2022-10-13","arxiv_id":"2210.07394","repositories_listed":2,"syntology":{"n":25,"n_ran":14,"n_constructed":0,"n_ran_checked":8,"n_instrument":6,"n_unverified":11,"n_honours":2,"n_violates":2,"n_no_contract":4,"n_pointer_only":14,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 2 honoured, 2 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/efficiently-computing-local-lipschitz#ran","syntology_url":"https://syntology.ai/paper/2210.07394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07394"}},"official":{"repos":["shizhouxing/local-lipschitz-constants","verified-intelligence/auto_lirpa"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":11,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/sampling-in-constrained-domains-with","slug":"sampling-in-constrained-domains-with","title":"Sampling in Constrained Domains with Orthogonal-Space Variational Gradient Descent","date":"2022-10-12","arxiv_id":"2210.06447","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sampling-in-constrained-domains-with#ran","syntology_url":"https://syntology.ai/paper/2210.06447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06447"}},"official":{"repos":["ruqizhang/o-gradient"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/uncovering-the-structural-fairness-in-graph","slug":"uncovering-the-structural-fairness-in-graph","title":"Uncovering the Structural Fairness in Graph Contrastive Learning","date":"2022-10-06","arxiv_id":"2210.03011","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/uncovering-the-structural-fairness-in-graph#ran","syntology_url":"https://syntology.ai/paper/2210.03011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03011"}},"official":null}},{"url":"/paper/deep-fair-clustering-via-maximizing-and","slug":"deep-fair-clustering-via-maximizing-and","title":"Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metric","date":"2022-09-26","arxiv_id":"2209.12396","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":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/deep-fair-clustering-via-maximizing-and#ran","syntology_url":"https://syntology.ai/paper/2209.12396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12396"}},"official":{"repos":["PengxinZeng/2023-CVPR-FCMI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/circle-color-invariant-representation","slug":"circle-color-invariant-representation","title":"CIRCLe: Color Invariant Representation Learning for Unbiased Classification of Skin Lesions","date":"2022-08-29","arxiv_id":"2208.13528","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/circle-color-invariant-representation#ran","syntology_url":"https://syntology.ai/paper/2208.13528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.13528"}},"official":{"repos":["arezou-pakzad/circle"],"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/minimax-auc-fairness-efficient-algorithm-with","slug":"minimax-auc-fairness-efficient-algorithm-with","title":"Minimax AUC Fairness: Efficient Algorithm with Provable Convergence","date":"2022-08-22","arxiv_id":"2208.10451","repositories_listed":2,"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/minimax-auc-fairness-efficient-algorithm-with#ran","syntology_url":"https://syntology.ai/paper/2208.10451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10451"}},"official":{"repos":["zhenhuan-yang/minimaxfairauc"],"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/imputation-strategies-under-clinical-presence","slug":"imputation-strategies-under-clinical-presence","title":"Imputation Strategies Under Clinical Presence: Impact on Algorithmic Fairness","date":"2022-08-13","arxiv_id":"2208.06648","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/imputation-strategies-under-clinical-presence#ran","syntology_url":"https://syntology.ai/paper/2208.06648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06648"}},"official":{"repos":["jeanselme/clinicalpresencefairness"],"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/fairgrape-fairness-aware-gradient-pruning","slug":"fairgrape-fairness-aware-gradient-pruning","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","date":"2022-07-22","arxiv_id":"2207.10888","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/fairgrape-fairness-aware-gradient-pruning#ran","syntology_url":"https://syntology.ai/paper/2207.10888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10888"}},"official":{"repos":["bernardo1998/fairgrape"],"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/bottlenecks-club-unifying-information","slug":"bottlenecks-club-unifying-information","title":"Bottlenecks CLUB: Unifying Information-Theoretic Trade-offs Among Complexity, Leakage, and Utility","date":"2022-07-11","arxiv_id":"2207.04895","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/bottlenecks-club-unifying-information#ran","syntology_url":"https://syntology.ai/paper/2207.04895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04895"}},"official":{"repos":["BehroozRazeghi/CLUB"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/individual-preference-stability-for","slug":"individual-preference-stability-for","title":"Individual Preference Stability for Clustering","date":"2022-07-07","arxiv_id":"2207.03600","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/individual-preference-stability-for#ran","syntology_url":"https://syntology.ai/paper/2207.03600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03600"}},"official":{"repos":["amazon-research/ip-stability-for-clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-instance-level-impact-of","slug":"understanding-instance-level-impact-of","title":"Understanding Instance-Level Impact of Fairness Constraints","date":"2022-06-30","arxiv_id":"2206.15437","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-instance-level-impact-of#ran","syntology_url":"https://syntology.ai/paper/2206.15437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.15437"}},"official":{"repos":["ucsc-real/fairinfl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transferring-fairness-under-distribution","slug":"transferring-fairness-under-distribution","title":"Transferring Fairness under Distribution Shifts via Fair Consistency Regularization","date":"2022-06-26","arxiv_id":"2206.12796","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/transferring-fairness-under-distribution#ran","syntology_url":"https://syntology.ai/paper/2206.12796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12796"}},"official":{"repos":["umd-huang-lab/transfer-fairness"],"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/openxai-towards-a-transparent-evaluation-of","slug":"openxai-towards-a-transparent-evaluation-of","title":"OpenXAI: Towards a Transparent Evaluation of Model Explanations","date":"2022-06-22","arxiv_id":"2206.11104","repositories_listed":2,"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/openxai-towards-a-transparent-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2206.11104","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11104"}},"official":{"repos":["ai4life-group/openxai"],"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/fair-generalized-linear-models-with-a-convex","slug":"fair-generalized-linear-models-with-a-convex","title":"Fair Generalized Linear Models with a Convex Penalty","date":"2022-06-18","arxiv_id":"2206.09076","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-generalized-linear-models-with-a-convex#ran","syntology_url":"https://syntology.ai/paper/2206.09076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09076"}},"official":{"repos":["hyungrok-do/fair-glm-cvx"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/disparate-impact-in-differential-privacy-from","slug":"disparate-impact-in-differential-privacy-from","title":"Disparate Impact in Differential Privacy from Gradient Misalignment","date":"2022-06-15","arxiv_id":"2206.07737","repositories_listed":1,"syntology":{"n":20,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/disparate-impact-in-differential-privacy-from#ran","syntology_url":"https://syntology.ai/paper/2206.07737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07737"}},"official":{"repos":["layer6ai-labs/fair-dp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/anchor-changing-regularized-natural-policy","slug":"anchor-changing-regularized-natural-policy","title":"Anchor-Changing Regularized Natural Policy Gradient for Multi-Objective Reinforcement Learning","date":"2022-06-10","arxiv_id":"2206.05357","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/anchor-changing-regularized-natural-policy#ran","syntology_url":"https://syntology.ai/paper/2206.05357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05357"}},"official":{"repos":["tliu1997/arnpg-morl"],"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/comprehensive-fair-meta-learned-recommender","slug":"comprehensive-fair-meta-learned-recommender","title":"Comprehensive Fair Meta-learned Recommender System","date":"2022-06-09","arxiv_id":"2206.04789","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/comprehensive-fair-meta-learned-recommender#ran","syntology_url":"https://syntology.ai/paper/2206.04789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04789"}},"official":{"repos":["weitianxin/CLOVER"],"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/improved-approximation-for-fair-correlation","slug":"improved-approximation-for-fair-correlation","title":"Improved Approximation for Fair Correlation Clustering","date":"2022-06-09","arxiv_id":"2206.05050","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improved-approximation-for-fair-correlation#ran","syntology_url":"https://syntology.ai/paper/2206.05050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05050"}},"official":{"repos":["moonin12/improved_fair_correlation_clustering"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pfl-bench-a-comprehensive-benchmark-for","slug":"pfl-bench-a-comprehensive-benchmark-for","title":"pFL-Bench: A Comprehensive Benchmark for Personalized Federated Learning","date":"2022-06-08","arxiv_id":"2206.03655","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pfl-bench-a-comprehensive-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2206.03655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03655"}},"official":{"repos":["alibaba/federatedscope"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/group-meritocratic-fairness-in-linear","slug":"group-meritocratic-fairness-in-linear","title":"Group Meritocratic Fairness in Linear Contextual Bandits","date":"2022-06-07","arxiv_id":"2206.03150","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/group-meritocratic-fairness-in-linear#ran","syntology_url":"https://syntology.ai/paper/2206.03150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03150"}},"official":{"repos":["csml-iit-ucl/gmfbandits"],"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/fairvfl-a-fair-vertical-federated-learning","slug":"fairvfl-a-fair-vertical-federated-learning","title":"FairVFL: A Fair Vertical Federated Learning Framework with Contrastive Adversarial Learning","date":"2022-06-07","arxiv_id":"2206.03200","repositories_listed":1,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/fairvfl-a-fair-vertical-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2206.03200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03200"}},"official":{"repos":["taoqi98/fairvfl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/inferring-unfairness-and-error-from","slug":"inferring-unfairness-and-error-from","title":"Fairness and Unfairness in Binary and Multiclass Classification: Quantifying, Calculating, and Bounding","date":"2022-06-07","arxiv_id":"2206.03234","repositories_listed":1,"syntology":{"n":31,"n_ran":24,"n_constructed":0,"n_ran_checked":7,"n_instrument":17,"n_unverified":7,"n_honours":5,"n_violates":2,"n_no_contract":0,"n_pointer_only":31,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 5 honoured, 2 violated, 0 with no contract checked; 17 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/inferring-unfairness-and-error-from#ran","syntology_url":"https://syntology.ai/paper/2206.03234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03234"}},"official":{"repos":["sivansabato/unfairness"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/learning-distributed-and-fair-policies-for","slug":"learning-distributed-and-fair-policies-for","title":"Learning Distributed and Fair Policies for Network Load Balancing as Markov Potential Game","date":"2022-06-03","arxiv_id":"2206.01451","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-distributed-and-fair-policies-for#ran","syntology_url":"https://syntology.ai/paper/2206.01451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01451"}},"official":{"repos":["zhiyuanyaoj/marllb"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/certifying-some-distributional-fairness-with","slug":"certifying-some-distributional-fairness-with","title":"Certifying Some Distributional Fairness with Subpopulation Decomposition","date":"2022-05-31","arxiv_id":"2205.15494","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/certifying-some-distributional-fairness-with#ran","syntology_url":"https://syntology.ai/paper/2205.15494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15494"}},"official":{"repos":["ai-secure/certified-fairness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/social-bias-meets-data-bias-the-impacts-of","slug":"social-bias-meets-data-bias-the-impacts-of","title":"Social Bias Meets Data Bias: The Impacts of Labeling and Measurement Errors on Fairness Criteria","date":"2022-05-31","arxiv_id":"2206.00137","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/social-bias-meets-data-bias-the-impacts-of#ran","syntology_url":"https://syntology.ai/paper/2206.00137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00137"}},"official":{"repos":["yl489/social-bias-meets-data-bias"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-in-the-first-stage-of-two-stage","slug":"fairness-in-the-first-stage-of-two-stage","title":"Uncertainty Quantification for Fairness in Two-Stage Recommender Systems","date":"2022-05-30","arxiv_id":"2205.15436","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-in-the-first-stage-of-two-stage#ran","syntology_url":"https://syntology.ai/paper/2205.15436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15436"}},"official":{"repos":["lequnwang/fair-two-stage-recommender"],"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/freematch-self-adaptive-thresholding-for-semi","slug":"freematch-self-adaptive-thresholding-for-semi","title":"FreeMatch: Self-adaptive Thresholding for Semi-supervised Learning","date":"2022-05-15","arxiv_id":"2205.07246","repositories_listed":6,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":5,"n_honours":1,"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; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/freematch-self-adaptive-thresholding-for-semi#ran","syntology_url":"https://syntology.ai/paper/2205.07246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07246"}},"official":{"repos":["microsoft/semi-supervised-learning","torchssl/torchssl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/individual-fairness-guarantees-for-neural","slug":"individual-fairness-guarantees-for-neural","title":"Individual Fairness Guarantees for Neural Networks","date":"2022-05-11","arxiv_id":"2205.05763","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/individual-fairness-guarantees-for-neural#ran","syntology_url":"https://syntology.ai/paper/2205.05763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05763"}},"official":{"repos":["eliasbenussi/nn-cert-individual-fairness"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/don-t-throw-it-away-the-utility-of-unlabeled","slug":"don-t-throw-it-away-the-utility-of-unlabeled","title":"Don't Throw it Away! The Utility of Unlabeled Data in Fair Decision Making","date":"2022-05-10","arxiv_id":"2205.04790","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/don-t-throw-it-away-the-utility-of-unlabeled#ran","syntology_url":"https://syntology.ai/paper/2205.04790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.04790"}},"official":{"repos":["ayanmaj92/fairall"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairlib-a-unified-framework-for-assessing-and","slug":"fairlib-a-unified-framework-for-assessing-and","title":"fairlib: A Unified Framework for Assessing and Improving Classification Fairness","date":"2022-05-04","arxiv_id":"2205.01876","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fairlib-a-unified-framework-for-assessing-and#ran","syntology_url":"https://syntology.ai/paper/2205.01876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01876"}},"official":{"repos":["HanXudong/fairlib","hanxudong/fair_nlp_classification"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-multisided-exposure-fairness-for","slug":"joint-multisided-exposure-fairness-for","title":"Joint Multisided Exposure Fairness for Recommendation","date":"2022-04-29","arxiv_id":"2205.00048","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-multisided-exposure-fairness-for#ran","syntology_url":"https://syntology.ai/paper/2205.00048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.00048"}},"official":{"repos":["haolun-wu/jmefairness"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/data-debugging-with-shapley-importance-over","slug":"data-debugging-with-shapley-importance-over","title":"Data Debugging with Shapley Importance over End-to-End Machine Learning Pipelines","date":"2022-04-23","arxiv_id":"2204.11131","repositories_listed":1,"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/data-debugging-with-shapley-importance-over#ran","syntology_url":"https://syntology.ai/paper/2204.11131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11131"}},"official":{"repos":["easeml/datascope"],"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/fairness-in-graph-mining-a-survey","slug":"fairness-in-graph-mining-a-survey","title":"Fairness in Graph Mining: A Survey","date":"2022-04-21","arxiv_id":"2204.09888","repositories_listed":2,"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":0,"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/fairness-in-graph-mining-a-survey#ran","syntology_url":"https://syntology.ai/paper/2204.09888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.09888"}},"official":{"repos":["yushundong/graph-mining-fairness-data","yushundong/pygdebias"],"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/elevater-a-benchmark-and-toolkit-for","slug":"elevater-a-benchmark-and-toolkit-for","title":"ELEVATER: A Benchmark and Toolkit for Evaluating Language-Augmented Visual Models","date":"2022-04-19","arxiv_id":"2204.08790","repositories_listed":9,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"12 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; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/elevater-a-benchmark-and-toolkit-for#ran","syntology_url":"https://syntology.ai/paper/2204.08790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.08790"}},"official":{"repos":["Computer-Vision-in-the-Wild/Elevater_Toolkit_IC","computer-vision-in-the-wild/cvinw_readings"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/are-two-heads-the-same-as-one-identifying","slug":"are-two-heads-the-same-as-one-identifying","title":"Are Two Heads the Same as One? Identifying Disparate Treatment in Fair Neural Networks","date":"2022-04-09","arxiv_id":"2204.04440","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/are-two-heads-the-same-as-one-identifying#ran","syntology_url":"https://syntology.ai/paper/2204.04440","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04440"}},"official":{"repos":["mlohaus/disparatetreatment"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/achieving-long-term-fairness-in-sequential","slug":"achieving-long-term-fairness-in-sequential","title":"Achieving Long-Term Fairness in Sequential Decision Making","date":"2022-04-04","arxiv_id":"2204.01819","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/achieving-long-term-fairness-in-sequential#ran","syntology_url":"https://syntology.ai/paper/2204.01819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.01819"}},"official":{"repos":["yaoweihu/achieving-long-term-fairness"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stylet2i-toward-compositional-and-high","slug":"stylet2i-toward-compositional-and-high","title":"StyleT2I: Toward Compositional and High-Fidelity Text-to-Image Synthesis","date":"2022-03-29","arxiv_id":"2203.15799","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stylet2i-toward-compositional-and-high#ran","syntology_url":"https://syntology.ai/paper/2203.15799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15799"}},"official":{"repos":["zhihengli-UR/StyleT2I"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/socially-fair-mitigation-of-misinformation-on","slug":"socially-fair-mitigation-of-misinformation-on","title":"Socially Fair Mitigation of Misinformation on Social Networks via Constraint Stochastic Optimization","date":"2022-03-23","arxiv_id":"2203.12537","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/socially-fair-mitigation-of-misinformation-on#ran","syntology_url":"https://syntology.ai/paper/2203.12537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12537"}},"official":{"repos":["ahmed-abouzeid/mmss"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/coco-fl-communication-and-computation-aware","slug":"coco-fl-communication-and-computation-aware","title":"CoCoFL: Communication- and Computation-Aware Federated Learning via Partial NN Freezing and Quantization","date":"2022-03-10","arxiv_id":"2203.05468","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/coco-fl-communication-and-computation-aware#ran","syntology_url":"https://syntology.ai/paper/2203.05468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.05468"}},"official":{"repos":["k1l1/cocofl"],"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/leveling-down-in-computer-vision-pareto","slug":"leveling-down-in-computer-vision-pareto","title":"Leveling Down in Computer Vision: Pareto Inefficiencies in Fair Deep Classifiers","date":"2022-03-09","arxiv_id":"2203.04913","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":1,"n_ran_checked":3,"n_instrument":6,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/leveling-down-in-computer-vision-pareto#ran","syntology_url":"https://syntology.ai/paper/2203.04913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04913"}},"official":null}},{"url":"/paper/kubric-a-scalable-dataset-generator","slug":"kubric-a-scalable-dataset-generator","title":"Kubric: A scalable dataset generator","date":"2022-03-07","arxiv_id":"2203.03570","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/kubric-a-scalable-dataset-generator#ran","syntology_url":"https://syntology.ai/paper/2203.03570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.03570"}},"official":{"repos":["google-research/kubric"],"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/mind-the-gap-understanding-the-modality-gap","slug":"mind-the-gap-understanding-the-modality-gap","title":"Mind the Gap: Understanding the Modality Gap in Multi-modal Contrastive Representation Learning","date":"2022-03-03","arxiv_id":"2203.02053","repositories_listed":2,"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/mind-the-gap-understanding-the-modality-gap#ran","syntology_url":"https://syntology.ai/paper/2203.02053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.02053"}},"official":{"repos":["weixin-liang/modality-gap"],"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/improving-fairness-in-speaker-verification","slug":"improving-fairness-in-speaker-verification","title":"Improving fairness in speaker verification via Group-adapted Fusion Network","date":"2022-02-23","arxiv_id":"2202.11323","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/improving-fairness-in-speaker-verification#ran","syntology_url":"https://syntology.ai/paper/2202.11323","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11323"}},"official":{"repos":["huashen218/voxceleb-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/a-complete-criterion-for-value-of-information","slug":"a-complete-criterion-for-value-of-information","title":"A Complete Criterion for Value of Information in Soluble Influence Diagrams","date":"2022-02-23","arxiv_id":"2202.11629","repositories_listed":0,"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/a-complete-criterion-for-value-of-information#ran","syntology_url":"https://syntology.ai/paper/2202.11629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11629"}},"official":null}},{"url":"/paper/fairness-indicators-for-systematic","slug":"fairness-indicators-for-systematic","title":"Fairness Indicators for Systematic Assessments of Visual Feature Extractors","date":"2022-02-15","arxiv_id":"2202.07603","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":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/fairness-indicators-for-systematic#ran","syntology_url":"https://syntology.ai/paper/2202.07603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07603"}},"official":null}},{"url":"/paper/quantifying-memorization-across-neural","slug":"quantifying-memorization-across-neural","title":"Quantifying Memorization Across Neural Language Models","date":"2022-02-15","arxiv_id":"2202.07646","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":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/quantifying-memorization-across-neural#ran","syntology_url":"https://syntology.ai/paper/2202.07646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07646"}},"official":null}},{"url":"/paper/learning-fair-representation-with-a","slug":"learning-fair-representation-with-a","title":"Learning fair representation with a parametric integral probability metric","date":"2022-02-07","arxiv_id":"2202.02943","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/learning-fair-representation-with-a#ran","syntology_url":"https://syntology.ai/paper/2202.02943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02943"}},"official":{"repos":["kwkimonline/sipm-lfr"],"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/net-benefit-calibration-threshold-selection","slug":"net-benefit-calibration-threshold-selection","title":"Net benefit, calibration, threshold selection, and training objectives for algorithmic fairness in healthcare","date":"2022-02-03","arxiv_id":"2202.01906","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/net-benefit-calibration-threshold-selection#ran","syntology_url":"https://syntology.ai/paper/2202.01906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.01906"}},"official":{"repos":["som-shahlab/net_benefit_ascvd"],"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/learning-fair-representations-via-rate","slug":"learning-fair-representations-via-rate","title":"Learning Fair Representations via Rate-Distortion Maximization","date":"2022-01-31","arxiv_id":"2202.00035","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-fair-representations-via-rate#ran","syntology_url":"https://syntology.ai/paper/2202.00035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.00035"}},"official":{"repos":["brcsomnath/farm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/controlling-directions-orthogonal-to-a-1","slug":"controlling-directions-orthogonal-to-a-1","title":"Controlling Directions Orthogonal to a Classifier","date":"2022-01-27","arxiv_id":"2201.11259","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/controlling-directions-orthogonal-to-a-1#ran","syntology_url":"https://syntology.ai/paper/2201.11259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11259"}},"official":{"repos":["newbeeer/orthogonal_classifier"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/augmentedpca-a-python-package-of-supervised","slug":"augmentedpca-a-python-package-of-supervised","title":"AugmentedPCA: A Python Package of Supervised and Adversarial Linear Factor Models","date":"2022-01-07","arxiv_id":"2201.02547","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/augmentedpca-a-python-package-of-supervised#ran","syntology_url":"https://syntology.ai/paper/2201.02547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.02547"}},"official":{"repos":["wecarsoniv/augmented-pca"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autobalance-optimized-loss-functions-for-1","slug":"autobalance-optimized-loss-functions-for-1","title":"AutoBalance: Optimized Loss Functions for Imbalanced Data","date":"2022-01-04","arxiv_id":"2201.01212","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/autobalance-optimized-loss-functions-for-1#ran","syntology_url":"https://syntology.ai/paper/2201.01212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.01212"}},"official":{"repos":["ucr-optml/autobalance"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-fair-recommendation-in-two-sided","slug":"towards-fair-recommendation-in-two-sided","title":"Towards Fair Recommendation in Two-Sided Platforms","date":"2021-12-26","arxiv_id":"2201.01180","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-fair-recommendation-in-two-sided#ran","syntology_url":"https://syntology.ai/paper/2201.01180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.01180"}},"official":null}},{"url":"/paper/incentivizing-collaboration-in-machine","slug":"incentivizing-collaboration-in-machine","title":"Incentivizing Collaboration in Machine Learning via Synthetic Data Rewards","date":"2021-12-17","arxiv_id":"2112.09327","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/incentivizing-collaboration-in-machine#ran","syntology_url":"https://syntology.ai/paper/2112.09327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.09327"}},"official":{"repos":["XinyiYS/CML-RewardDistribution"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-causally-disentangled-representations","slug":"on-causally-disentangled-representations","title":"On Causally Disentangled Representations","date":"2021-12-10","arxiv_id":"2112.05746","repositories_listed":1,"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/on-causally-disentangled-representations#ran","syntology_url":"https://syntology.ai/paper/2112.05746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.05746"}},"official":{"repos":["causal-disentanglement/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/robust-and-provably-monotonic-networks","slug":"robust-and-provably-monotonic-networks","title":"Robust and Provably Monotonic Networks","date":"2021-11-30","arxiv_id":"2112.00038","repositories_listed":0,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/robust-and-provably-monotonic-networks#ran","syntology_url":"https://syntology.ai/paper/2112.00038","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00038"}},"official":null}},{"url":"/paper/deformable-protopnet-an-interpretable-image","slug":"deformable-protopnet-an-interpretable-image","title":"Deformable ProtoPNet: An Interpretable Image Classifier Using Deformable Prototypes","date":"2021-11-29","arxiv_id":"2111.15000","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/deformable-protopnet-an-interpretable-image#ran","syntology_url":"https://syntology.ai/paper/2111.15000","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.15000"}},"official":{"repos":["jdonnelly36/Deformable-ProtoPNet"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-space-smoothing-for-individually-fair-1","slug":"latent-space-smoothing-for-individually-fair-1","title":"Latent Space Smoothing for Individually Fair Representations","date":"2021-11-26","arxiv_id":"2111.13650","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":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/latent-space-smoothing-for-individually-fair-1#ran","syntology_url":"https://syntology.ai/paper/2111.13650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13650"}},"official":{"repos":["eth-sri/lassi"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-information-flows-suggest-targets-for","slug":"can-information-flows-suggest-targets-for","title":"Can Information Flows Suggest Targets for Interventions in Neural Circuits?","date":"2021-11-09","arxiv_id":"2111.05299","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/can-information-flows-suggest-targets-for#ran","syntology_url":"https://syntology.ai/paper/2111.05299","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.05299"}},"official":{"repos":["praveenv253/ann-info-flow"],"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/vaca-design-of-variational-graph-autoencoders","slug":"vaca-design-of-variational-graph-autoencoders","title":"VACA: Design of Variational Graph Autoencoders for Interventional and Counterfactual Queries","date":"2021-10-27","arxiv_id":"2110.14690","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":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/vaca-design-of-variational-graph-autoencoders#ran","syntology_url":"https://syntology.ai/paper/2110.14690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14690"}},"official":{"repos":["psanch21/VACA"],"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/post-processing-for-individual-fairness","slug":"post-processing-for-individual-fairness","title":"Post-processing for Individual Fairness","date":"2021-10-26","arxiv_id":"2110.13796","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/post-processing-for-individual-fairness#ran","syntology_url":"https://syntology.ai/paper/2110.13796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13796"}},"official":{"repos":["felix-petersen/fairness-post-processing"],"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/boosted-cvar-classification","slug":"boosted-cvar-classification","title":"Boosted CVaR Classification","date":"2021-10-26","arxiv_id":"2110.13948","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/boosted-cvar-classification#ran","syntology_url":"https://syntology.ai/paper/2110.13948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13948"}},"official":{"repos":["runtianz/boosted_cvar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/decaf-generating-fair-synthetic-data-using","slug":"decaf-generating-fair-synthetic-data-using","title":"DECAF: Generating Fair Synthetic Data Using Causally-Aware Generative Networks","date":"2021-10-25","arxiv_id":"2110.12884","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decaf-generating-fair-synthetic-data-using#ran","syntology_url":"https://syntology.ai/paper/2110.12884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.12884"}},"official":{"repos":["vanderschaarlab/decaf"],"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/fair-enough-searching-for-sufficient-measures","slug":"fair-enough-searching-for-sufficient-measures","title":"Fair Enough: Searching for Sufficient Measures of Fairness","date":"2021-10-25","arxiv_id":"2110.13029","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/fair-enough-searching-for-sufficient-measures#ran","syntology_url":"https://syntology.ai/paper/2110.13029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13029"}},"official":{"repos":["repoanonymous/fairness_metrics"],"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/distinguishing-rule-and-exemplar-based-1","slug":"distinguishing-rule-and-exemplar-based-1","title":"Distinguishing rule- and exemplar-based generalization in learning systems","date":"2021-10-08","arxiv_id":"2110.04328","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distinguishing-rule-and-exemplar-based-1#ran","syntology_url":"https://syntology.ai/paper/2110.04328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04328"}},"official":{"repos":["eringrant/icml-2022-rules-vs-exemplars"],"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/sd-qa-spoken-dialectal-question-answering-for","slug":"sd-qa-spoken-dialectal-question-answering-for","title":"SD-QA: Spoken Dialectal Question Answering for the Real World","date":"2021-09-24","arxiv_id":"2109.12072","repositories_listed":1,"syntology":{"n":22,"n_ran":20,"n_constructed":0,"n_ran_checked":20,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":20,"n_pointer_only":0,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 0 honoured, 0 violated, 20 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sd-qa-spoken-dialectal-question-answering-for#ran","syntology_url":"https://syntology.ai/paper/2109.12072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.12072"}},"official":{"repos":["ffaisal93/sd-qa"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":0,"n_ran_no_instrument_failure":20,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-efficient-mmd-based-fair-pca-via","slug":"fast-and-efficient-mmd-based-fair-pca-via","title":"Fast and Efficient MMD-based Fair PCA via Optimization over Stiefel Manifold","date":"2021-09-23","arxiv_id":"2109.11196","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/fast-and-efficient-mmd-based-fair-pca-via#ran","syntology_url":"https://syntology.ai/paper/2109.11196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.11196"}},"official":{"repos":["nick-jhlee/fair-manifold-pca"],"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/amazon-sagemaker-clarify-machine-learning","slug":"amazon-sagemaker-clarify-machine-learning","title":"Amazon SageMaker Clarify: Machine Learning Bias Detection and Explainability in the Cloud","date":"2021-09-07","arxiv_id":"2109.03285","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":0,"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/amazon-sagemaker-clarify-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2109.03285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.03285"}},"official":{"repos":["aws/amazon-sagemaker-clarify"],"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/tabfairgan-fair-tabular-data-generation-with","slug":"tabfairgan-fair-tabular-data-generation-with","title":"TabFairGAN: Fair Tabular Data Generation with Generative Adversarial Networks","date":"2021-09-02","arxiv_id":"2109.00666","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tabfairgan-fair-tabular-data-generation-with#ran","syntology_url":"https://syntology.ai/paper/2109.00666","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00666"}},"official":{"repos":["amirarsalan90/TabFairGAN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-multi-task-learning-under-a-mixture","slug":"federated-multi-task-learning-under-a-mixture","title":"Federated Multi-Task Learning under a Mixture of Distributions","date":"2021-08-23","arxiv_id":"2108.10252","repositories_listed":5,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/federated-multi-task-learning-under-a-mixture#ran","syntology_url":"https://syntology.ai/paper/2108.10252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.10252"}},"official":{"repos":["omarfoq/fedem"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/fair-and-consistent-federated-learning","slug":"fair-and-consistent-federated-learning","title":"Addressing Algorithmic Disparity and Performance Inconsistency in Federated Learning","date":"2021-08-19","arxiv_id":"2108.08435","repositories_listed":1,"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/fair-and-consistent-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2108.08435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.08435"}},"official":{"repos":["cuis15/FCFL"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/retiring-adult-new-datasets-for-fair-machine","slug":"retiring-adult-new-datasets-for-fair-machine","title":"Retiring Adult: New Datasets for Fair Machine Learning","date":"2021-08-10","arxiv_id":"2108.04884","repositories_listed":5,"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/retiring-adult-new-datasets-for-fair-machine#ran","syntology_url":"https://syntology.ai/paper/2108.04884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.04884"}},"official":{"repos":["zykls/folktables"],"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/measuring-fairness-in-generative-models","slug":"measuring-fairness-in-generative-models","title":"Measuring Fairness in Generative Models","date":"2021-07-16","arxiv_id":"2107.07754","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/measuring-fairness-in-generative-models#ran","syntology_url":"https://syntology.ai/paper/2107.07754","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07754"}},"official":{"repos":["Bearwithchris/Fairness_Metric"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-in-ranking-under-uncertainty","slug":"fairness-in-ranking-under-uncertainty","title":"Fairness in Ranking under Uncertainty","date":"2021-07-14","arxiv_id":"2107.06720","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"10 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; 8 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fairness-in-ranking-under-uncertainty#ran","syntology_url":"https://syntology.ai/paper/2107.06720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.06720"}},"official":{"repos":["ashudeep/ranking-fairness-uncertainty"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/can-less-be-more-when-increasing-to-balancing","slug":"can-less-be-more-when-increasing-to-balancing","title":"Can Less be More? When Increasing-to-Balancing Label Noise Rates Considered Beneficial","date":"2021-07-13","arxiv_id":"2107.05913","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-less-be-more-when-increasing-to-balancing#ran","syntology_url":"https://syntology.ai/paper/2107.05913","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.05913"}},"official":{"repos":["ucsc-real/canlessbemore"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/subgroup-generalization-and-fairness-of-graph","slug":"subgroup-generalization-and-fairness-of-graph","title":"Subgroup Generalization and Fairness of Graph Neural Networks","date":"2021-06-29","arxiv_id":"2106.15535","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/subgroup-generalization-and-fairness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2106.15535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.15535"}},"official":{"repos":["theaperdeng/gnn-generalization-fairness"],"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/quantifying-social-biases-in-nlp-a","slug":"quantifying-social-biases-in-nlp-a","title":"Quantifying Social Biases in NLP: A Generalization and Empirical Comparison of Extrinsic Fairness Metrics","date":"2021-06-28","arxiv_id":"2106.14574","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/quantifying-social-biases-in-nlp-a#ran","syntology_url":"https://syntology.ai/paper/2106.14574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14574"}},"official":null}},{"url":"/paper/towards-understanding-and-mitigating-social","slug":"towards-understanding-and-mitigating-social","title":"Towards Understanding and Mitigating Social Biases in Language Models","date":"2021-06-24","arxiv_id":"2106.13219","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-understanding-and-mitigating-social#ran","syntology_url":"https://syntology.ai/paper/2106.13219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13219"}},"official":{"repos":["pliang279/LM_bias"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-for-image-generation-with-uncertain","slug":"fairness-for-image-generation-with-uncertain","title":"Fairness for Image Generation with Uncertain Sensitive Attributes","date":"2021-06-23","arxiv_id":"2106.12182","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fairness-for-image-generation-with-uncertain#ran","syntology_url":"https://syntology.ai/paper/2106.12182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12182"}},"official":{"repos":["ajiljalal/code-cs-fairness"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/simon-says-evaluating-and-mitigating-bias-in","slug":"simon-says-evaluating-and-mitigating-bias-in","title":"Simon Says: Evaluating and Mitigating Bias in Pruned Neural Networks with Knowledge Distillation","date":"2021-06-15","arxiv_id":"2106.07849","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/simon-says-evaluating-and-mitigating-bias-in#ran","syntology_url":"https://syntology.ai/paper/2106.07849","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07849"}},"official":{"repos":["codestar12/pruning-distilation-bias"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-mixture-of-posteriors-for","slug":"contrastive-mixture-of-posteriors-for","title":"Contrastive Mixture of Posteriors for Counterfactual Inference, Data Integration and Fairness","date":"2021-06-15","arxiv_id":"2106.08161","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":1,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/contrastive-mixture-of-posteriors-for#ran","syntology_url":"https://syntology.ai/paper/2106.08161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08161"}},"official":{"repos":["benevolentai/comp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/characterizing-the-risk-of-fairwashing","slug":"characterizing-the-risk-of-fairwashing","title":"Characterizing the risk of fairwashing","date":"2021-06-14","arxiv_id":"2106.07504","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/characterizing-the-risk-of-fairwashing#ran","syntology_url":"https://syntology.ai/paper/2106.07504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07504"}},"official":{"repos":["aivodji/characterizing_fairwashing"],"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/planning-to-fairly-allocate-probabilistic","slug":"planning-to-fairly-allocate-probabilistic","title":"Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting","date":"2021-06-14","arxiv_id":"2106.07677","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/planning-to-fairly-allocate-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2106.07677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07677"}},"official":{"repos":["crherlihy/prob_fair_rmab"],"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/consistent-instance-false-positive-improves","slug":"consistent-instance-false-positive-improves","title":"Consistent Instance False Positive Improves Fairness in Face Recognition","date":"2021-06-10","arxiv_id":"2106.05519","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/consistent-instance-false-positive-improves#ran","syntology_url":"https://syntology.ai/paper/2106.05519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05519"}},"official":{"repos":["Tencent/TFace"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-clustering-based-fair-outlier-detection","slug":"deep-clustering-based-fair-outlier-detection","title":"Deep Clustering based Fair Outlier Detection","date":"2021-06-09","arxiv_id":"2106.05127","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/deep-clustering-based-fair-outlier-detection#ran","syntology_url":"https://syntology.ai/paper/2106.05127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05127"}},"official":{"repos":["brandeis-machine-learning/FairOutlierDetection"],"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"]}}}],"record_sha256":"914826276ba8999a3b8ada2d6b4e045d352676e6c70f0c98fa00bc484ba32978","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}