{"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","name":"Fairness","slug":"fairness","description_markdown":null,"categories":[{"name":"Adversarial","url":"/area/adversarial"},{"name":"Computer Vision","url":"/area/computer-vision"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":5676,"papers_with_code":1714,"benchmarks":9,"benchmark_tables_in_archive":9,"benchmark_tables_shown":9,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":23,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/fairness-on-baf-base","slug":"fairness-on-baf-base","dataset":"BAF – Base","dataset_url":"/dataset/baf","rows_in_archive":2,"metrics":["Predictive Equality (age)"],"first_row_in_archive_order":{"model":"1D-CSNN","paper_title":"Improving Fraud Detection with 1D-Convolutional Spiking Neural Networks Through Bayesian Optimization","paper_url":"/paper/improving-fraud-detection-with-1d","paper_date":"2024-11-16","arxiv_id":null,"code_links":[{"title":"DylanPerdigao/Bayesian-Optimization-1D-CSNN","url":"https://github.com/DylanPerdigao/Bayesian-Optimization-1D-CSNN"}],"syntology":null}},{"leaderboard":"/sota/fairness-on-baf-variant-i","slug":"fairness-on-baf-variant-i","dataset":"BAF – Variant I","dataset_url":"/dataset/baf","rows_in_archive":1,"metrics":["Predictive Equality (age)"],"first_row_in_archive_order":{"model":"1D-CSNN","paper_title":"Exploring Neural Joint Activity in Spiking Neural Networks for Fraud Detection","paper_url":"/paper/exploring-neural-joint-activity-in-spiking","paper_date":"2024-11-17","arxiv_id":null,"code_links":[{"title":"DylanPerdigao/Neural-Joint-Activity-in-SNNs","url":"https://github.com/DylanPerdigao/Neural-Joint-Activity-in-SNNs"}],"syntology":null}},{"leaderboard":"/sota/fairness-on-baf-variant-ii","slug":"fairness-on-baf-variant-ii","dataset":"BAF – Variant II","dataset_url":"/dataset/baf","rows_in_archive":1,"metrics":["Predictive Equality (age)"],"first_row_in_archive_order":{"model":"1D-CSNN","paper_title":"Exploring Neural Joint Activity in Spiking Neural Networks for Fraud Detection","paper_url":"/paper/exploring-neural-joint-activity-in-spiking","paper_date":"2024-11-17","arxiv_id":null,"code_links":[{"title":"DylanPerdigao/Neural-Joint-Activity-in-SNNs","url":"https://github.com/DylanPerdigao/Neural-Joint-Activity-in-SNNs"}],"syntology":null}},{"leaderboard":"/sota/fairness-on-baf-variant-iii","slug":"fairness-on-baf-variant-iii","dataset":"BAF – Variant III","dataset_url":"/dataset/baf","rows_in_archive":1,"metrics":["Predictive Equality (age)"],"first_row_in_archive_order":{"model":"1D-CSNN","paper_title":"Exploring Neural Joint Activity in Spiking Neural Networks for Fraud Detection","paper_url":"/paper/exploring-neural-joint-activity-in-spiking","paper_date":"2024-11-17","arxiv_id":null,"code_links":[{"title":"DylanPerdigao/Neural-Joint-Activity-in-SNNs","url":"https://github.com/DylanPerdigao/Neural-Joint-Activity-in-SNNs"}],"syntology":null}},{"leaderboard":"/sota/fairness-on-baf-variant-iv","slug":"fairness-on-baf-variant-iv","dataset":"BAF – Variant IV","dataset_url":"/dataset/baf","rows_in_archive":1,"metrics":["Predictive Equality (age)"],"first_row_in_archive_order":{"model":"1D-CSNN","paper_title":"Exploring Neural Joint Activity in Spiking Neural Networks for Fraud Detection","paper_url":"/paper/exploring-neural-joint-activity-in-spiking","paper_date":"2024-11-17","arxiv_id":null,"code_links":[{"title":"DylanPerdigao/Neural-Joint-Activity-in-SNNs","url":"https://github.com/DylanPerdigao/Neural-Joint-Activity-in-SNNs"}],"syntology":null}},{"leaderboard":"/sota/fairness-on-baf-variant-v","slug":"fairness-on-baf-variant-v","dataset":"BAF – Variant V","dataset_url":"/dataset/baf","rows_in_archive":1,"metrics":["Predictive Equality (age)"],"first_row_in_archive_order":{"model":"1D-CSNN","paper_title":"Exploring Neural Joint Activity in Spiking Neural Networks for Fraud Detection","paper_url":"/paper/exploring-neural-joint-activity-in-spiking","paper_date":"2024-11-17","arxiv_id":null,"code_links":[{"title":"DylanPerdigao/Neural-Joint-Activity-in-SNNs","url":"https://github.com/DylanPerdigao/Neural-Joint-Activity-in-SNNs"}],"syntology":null}},{"leaderboard":"/sota/fairness-on-diveface","slug":"fairness-on-diveface","dataset":"DiveFace","dataset_url":"/dataset/diveface","rows_in_archive":1,"metrics":["Degree of Bias (DoB)"],"first_row_in_archive_order":{"model":"Neighbour Learning","paper_title":"Deep Generative Views to Mitigate Gender Classification Bias Across Gender-Race Groups","paper_url":"/paper/deep-generative-views-to-mitigate-gender","paper_date":"2022-08-17","arxiv_id":"2208.08382","code_links":[],"syntology":null}},{"leaderboard":"/sota/fairness-on-morph","slug":"fairness-on-morph","dataset":"MORPH","dataset_url":"/dataset/morph","rows_in_archive":1,"metrics":["Degree of Bias (DoB)"],"first_row_in_archive_order":{"model":"Neighbour Learning","paper_title":"Deep Generative Views to Mitigate Gender Classification Bias Across Gender-Race Groups","paper_url":"/paper/deep-generative-views-to-mitigate-gender","paper_date":"2022-08-17","arxiv_id":"2208.08382","code_links":[],"syntology":null}},{"leaderboard":"/sota/fairness-on-utkface","slug":"fairness-on-utkface","dataset":"UTKFace","dataset_url":"/dataset/utkface","rows_in_archive":1,"metrics":["Degree of Bias (DoB)"],"first_row_in_archive_order":{"model":"Neighbour Learning","paper_title":"Deep Generative Views to Mitigate Gender Classification Bias Across Gender-Race Groups","paper_url":"/paper/deep-generative-views-to-mitigate-gender","paper_date":"2022-08-17","arxiv_id":"2208.08382","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/netflix-prize","name":"Netflix Prize","full_name":"Netflix Prize","num_papers_in_archive":370},{"url":"/dataset/utkface","name":"UTKFace","full_name":"","num_papers_in_archive":243},{"url":"/dataset/fairface","name":"FairFace","full_name":"","num_papers_in_archive":208},{"url":"/dataset/morph","name":"MORPH","full_name":"","num_papers_in_archive":180},{"url":"/dataset/winobias","name":"WinoBias","full_name":"WinoBias","num_papers_in_archive":134},{"url":"/dataset/rfw","name":"RFW","full_name":"Racial Faces in-the-Wild","num_papers_in_archive":73},{"url":"/dataset/gvgai","name":"GVGAI","full_name":"General Video Game AI","num_papers_in_archive":36},{"url":"/dataset/help","name":"HELP","full_name":"","num_papers_in_archive":30},{"url":"/dataset/miap","name":"MIAP","full_name":"More Inclusive Annotations for People","num_papers_in_archive":15},{"url":"/dataset/acs-pums","name":"ACS PUMS","full_name":"","num_papers_in_archive":11},{"url":"/dataset/diveface","name":"DiveFace","full_name":"","num_papers_in_archive":11},{"url":"/dataset/baf","name":"BAF","full_name":"Bank Account Fraud","num_papers_in_archive":10},{"url":"/dataset/speech-coco","name":"SPEECH-COCO","full_name":"","num_papers_in_archive":9},{"url":"/dataset/ci-mnist","name":"CI-MNIST","full_name":"Correlated and Imbalanced MNIST","num_papers_in_archive":4},{"url":"/dataset/default-of-credit-card-clients-data-set","name":"default of credit card clients Data Set","full_name":"","num_papers_in_archive":3},{"url":"/dataset/dialoguefairness","name":"DialogueFairness","full_name":null,"num_papers_in_archive":2},{"url":"/dataset/imdrug","name":"ImDrug","full_name":"","num_papers_in_archive":2},{"url":"/dataset/kanface","name":"KANFace","full_name":"KANFace Dataset","num_papers_in_archive":2},{"url":"/dataset/twinviews-13k","name":"TwinViews-13k","full_name":"","num_papers_in_archive":2},{"url":"/dataset/ec-darkpattern","name":"ec-darkpattern","full_name":"","num_papers_in_archive":1},{"url":"/dataset/fairfd","name":"FairFD","full_name":"","num_papers_in_archive":1},{"url":"/dataset/iclr-database","name":"ICLR Database","full_name":"ICLR Database (with Textual Covariates)","num_papers_in_archive":1},{"url":"/dataset/fnirs2mw","name":"fNIRS2MW","full_name":"The Tufts fNIRS to Mental Workload Dataset","num_papers_in_archive":0}],"subtasks":[{"url":"/task/exposure-fairness","name":"Exposure Fairness"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":57,"rows_per_page":100,"shown":100,"of":5676,"of_with_code":1714,"tagged_in_all":5676,"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":317,"every_run_a_failure_of_syntologys_instrument":87,"listed_with_a_run_with_no_instrument_failure":317,"listed_every_run_a_failure_of_syntologys_instrument":87,"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"},"items":[{"url":"/paper/a-simple-baseline-for-multi-object-tracking","slug":"a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","arxiv_id":"2004.01888","repositories_listed":33,"syntology":{"n":53,"n_ran":46,"n_constructed":0,"n_ran_checked":41,"n_instrument":5,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":39,"n_pointer_only":1,"phrase":"46 ran (of which 0 constructed an object rather than computing a result; 41 with no instrument failure: 2 honoured, 0 violated, 39 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-simple-baseline-for-multi-object-tracking#ran","syntology_url":"https://syntology.ai/paper/2004.01888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01888"}},"official":{"repos":["ifzhang/FairMOT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/ai-fairness-360-an-extensible-toolkit-for","slug":"ai-fairness-360-an-extensible-toolkit-for","title":"AI Fairness 360: An Extensible Toolkit for Detecting, Understanding, and Mitigating Unwanted Algorithmic Bias","date":"2018-10-03","arxiv_id":"1810.01943","repositories_listed":13,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ai-fairness-360-an-extensible-toolkit-for#ran","syntology_url":"https://syntology.ai/paper/1810.01943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01943"}},"official":{"repos":["IBM/AIF360"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/a-critic-evaluation-of-methods-for-covid-19","slug":"a-critic-evaluation-of-methods-for-covid-19","title":"A Critic Evaluation of Methods for COVID-19 Automatic Detection from X-Ray Images","date":"2020-04-27","arxiv_id":"2004.12823","repositories_listed":9,"syntology":null},{"url":"/paper/score-camimproved-visual-explanations-via","slug":"score-camimproved-visual-explanations-via","title":"Score-CAM: Score-Weighted Visual Explanations for Convolutional Neural Networks","date":"2019-10-03","arxiv_id":"1910.01279","repositories_listed":9,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/score-camimproved-visual-explanations-via#ran","syntology_url":"https://syntology.ai/paper/1910.01279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01279"}},"official":{"repos":["haofanwang/Score-CAM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/agnostic-federated-learning","slug":"agnostic-federated-learning","title":"Agnostic Federated Learning","date":"2019-02-01","arxiv_id":"1902.00146","repositories_listed":7,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/agnostic-federated-learning#ran","syntology_url":"https://syntology.ai/paper/1902.00146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00146"}},"official":null}},{"url":"/paper/learning-adversarially-fair-and-transferable","slug":"learning-adversarially-fair-and-transferable","title":"Learning Adversarially Fair and Transferable Representations","date":"2018-02-17","arxiv_id":"1802.06309","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-adversarially-fair-and-transferable#ran","syntology_url":"https://syntology.ai/paper/1802.06309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06309"}},"official":{"repos":["VectorInstitute/laftr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-analysis-of-ai-biases-in","slug":"a-comprehensive-analysis-of-ai-biases-in","title":"Analyzing Fairness in Deepfake Detection With Massively Annotated Databases","date":"2022-08-11","arxiv_id":"2208.05845","repositories_listed":6,"syntology":null},{"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/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/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/fairness-without-demographics-through","slug":"fairness-without-demographics-through","title":"Fairness without Demographics through Adversarially Reweighted Learning","date":"2020-06-23","arxiv_id":"2006.13114","repositories_listed":5,"syntology":{"n":8,"n_ran":6,"n_constructed":3,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fairness-without-demographics-through#ran","syntology_url":"https://syntology.ai/paper/2006.13114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13114"}},"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/nuanced-metrics-for-measuring-unintended-bias","slug":"nuanced-metrics-for-measuring-unintended-bias","title":"Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classification","date":"2019-03-11","arxiv_id":"1903.04561","repositories_listed":5,"syntology":null},{"url":"/paper/an-empirical-study-of-rich-subgroup-fairness","slug":"an-empirical-study-of-rich-subgroup-fairness","title":"An Empirical Study of Rich Subgroup Fairness for Machine Learning","date":"2018-08-24","arxiv_id":"1808.08166","repositories_listed":5,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/an-empirical-study-of-rich-subgroup-fairness#ran","syntology_url":"https://syntology.ai/paper/1808.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.08166"}},"official":null}},{"url":"/paper/preventing-fairness-gerrymandering-auditing","slug":"preventing-fairness-gerrymandering-auditing","title":"Preventing Fairness Gerrymandering: Auditing and Learning for Subgroup Fairness","date":"2017-11-14","arxiv_id":"1711.05144","repositories_listed":5,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/preventing-fairness-gerrymandering-auditing#ran","syntology_url":"https://syntology.ai/paper/1711.05144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.05144"}},"official":{"repos":["algowatchpenn/GerryFair"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-pivot-with-adversarial-networks","slug":"learning-to-pivot-with-adversarial-networks","title":"Learning to Pivot with Adversarial Networks","date":"2016-11-03","arxiv_id":"1611.01046","repositories_listed":5,"syntology":null},{"url":"/paper/gpfl-simultaneously-learning-global-and","slug":"gpfl-simultaneously-learning-global-and","title":"GPFL: Simultaneously Learning Global and Personalized Feature Information for Personalized Federated Learning","date":"2023-08-20","arxiv_id":"2308.10279","repositories_listed":4,"syntology":{"n":17,"n_ran":9,"n_constructed":1,"n_ran_checked":3,"n_instrument":6,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"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) · 8 unverified","sample_list":"/paper/gpfl-simultaneously-learning-global-and#ran","syntology_url":"https://syntology.ai/paper/2308.10279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10279"}},"official":{"repos":["TsingZ0/GPFL"],"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":["listed","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/federated-multi-task-learning-for-competing","slug":"federated-multi-task-learning-for-competing","title":"Ditto: Fair and Robust Federated Learning Through Personalization","date":"2020-12-08","arxiv_id":"2012.04221","repositories_listed":4,"syntology":{"n":18,"n_ran":15,"n_constructed":5,"n_ran_checked":12,"n_instrument":3,"n_unverified":3,"n_honours":7,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 12 with no instrument failure: 7 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/federated-multi-task-learning-for-competing#ran","syntology_url":"https://syntology.ai/paper/2012.04221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04221"}},"official":{"repos":["litian96/ditto"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-continuously-optimize-wireless","slug":"learning-to-continuously-optimize-wireless","title":"Learning to Continuously Optimize Wireless Resource In Episodically Dynamic Environment","date":"2020-11-16","arxiv_id":"2011.07782","repositories_listed":4,"syntology":null},{"url":"/paper/post-hoc-methods-for-debiasing-neural","slug":"post-hoc-methods-for-debiasing-neural","title":"Intra-Processing Methods for Debiasing Neural Networks","date":"2020-06-15","arxiv_id":"2006.08564","repositories_listed":4,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/post-hoc-methods-for-debiasing-neural#ran","syntology_url":"https://syntology.ai/paper/2006.08564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08564"}},"official":{"repos":["abacusai/intraprocessing_debiasing","realityengines/post_hoc_debiasing"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/genetic-programming-approaches-to-learning","slug":"genetic-programming-approaches-to-learning","title":"Genetic programming approaches to learning fair classifiers","date":"2020-04-28","arxiv_id":"2004.13282","repositories_listed":4,"syntology":null},{"url":"/paper/fair-regression-quantitative-definitions-and","slug":"fair-regression-quantitative-definitions-and","title":"Fair Regression: Quantitative Definitions and Reduction-based Algorithms","date":"2019-05-30","arxiv_id":"1905.12843","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-regression-quantitative-definitions-and#ran","syntology_url":"https://syntology.ai/paper/1905.12843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12843"}},"official":null}},{"url":"/paper/classification-with-fairness-constraints-a","slug":"classification-with-fairness-constraints-a","title":"Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees","date":"2018-06-15","arxiv_id":"1806.06055","repositories_listed":4,"syntology":null},{"url":"/paper/a-comparative-study-of-fairness-enhancing","slug":"a-comparative-study-of-fairness-enhancing","title":"A comparative study of fairness-enhancing interventions in machine learning","date":"2018-02-13","arxiv_id":"1802.04422","repositories_listed":4,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":1,"n_instrument":9,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 9 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-comparative-study-of-fairness-enhancing#ran","syntology_url":"https://syntology.ai/paper/1802.04422","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04422"}},"official":{"repos":["algofairness/fairness-comparison"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mitigating-unwanted-biases-with-adversarial","slug":"mitigating-unwanted-biases-with-adversarial","title":"Mitigating Unwanted Biases with Adversarial Learning","date":"2018-01-22","arxiv_id":"1801.07593","repositories_listed":4,"syntology":null},{"url":"/paper/fair-a-fair-top-k-ranking-algorithm","slug":"fair-a-fair-top-k-ranking-algorithm","title":"FA*IR: A Fair Top-k Ranking Algorithm","date":"2017-06-20","arxiv_id":"1706.06368","repositories_listed":4,"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/fair-a-fair-top-k-ranking-algorithm#ran","syntology_url":"https://syntology.ai/paper/1706.06368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.06368"}},"official":{"repos":["MilkaLichtblau/FA-IR_Ranking"],"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/benchmark-evaluations-applications-and","slug":"benchmark-evaluations-applications-and","title":"A Survey of State of the Art Large Vision Language Models: Alignment, Benchmark, Evaluations and Challenges","date":"2025-01-04","arxiv_id":"2501.02189","repositories_listed":3,"syntology":null},{"url":"/paper/fairer-analysis-and-demographically-balanced","slug":"fairer-analysis-and-demographically-balanced","title":"Fairer Analysis and Demographically Balanced Face Generation for Fairer Face Verification","date":"2024-12-04","arxiv_id":"2412.03349","repositories_listed":3,"syntology":null},{"url":"/paper/when-is-multicalibration-post-processing","slug":"when-is-multicalibration-post-processing","title":"When is Multicalibration Post-Processing Necessary?","date":"2024-06-10","arxiv_id":"2406.06487","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/when-is-multicalibration-post-processing#ran","syntology_url":"https://syntology.ai/paper/2406.06487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06487"}},"official":{"repos":["dutchhansen/multicalibration","dutchhansen/empirical-multicalibration","sid-devic/multicalibration"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-closer-look-at-auroc-and-auprc-under-class","slug":"a-closer-look-at-auroc-and-auprc-under-class","title":"A Closer Look at AUROC and AUPRC under Class Imbalance","date":"2024-01-11","arxiv_id":"2401.06091","repositories_listed":3,"syntology":{"n":34,"n_ran":25,"n_constructed":0,"n_ran_checked":15,"n_instrument":10,"n_unverified":9,"n_honours":1,"n_violates":1,"n_no_contract":13,"n_pointer_only":21,"phrase":"25 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 1 violated, 13 with no contract checked; 10 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-closer-look-at-auroc-and-auprc-under-class#ran","syntology_url":"https://syntology.ai/paper/2401.06091","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06091"}},"official":{"repos":["lassehhansen/arxiv-search","hzhang0/auc_bias","mmcdermott/auc_is_all_you_need"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/mvbench-a-comprehensive-multi-modal-video","slug":"mvbench-a-comprehensive-multi-modal-video","title":"MVBench: A Comprehensive Multi-modal Video Understanding Benchmark","date":"2023-11-28","arxiv_id":"2311.17005","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":2,"phrase":"7 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mvbench-a-comprehensive-multi-modal-video#ran","syntology_url":"https://syntology.ai/paper/2311.17005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.17005"}},"official":{"repos":["opengvlab/ask-anything"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/patch-n-pack-navit-a-vision-transformer-for","slug":"patch-n-pack-navit-a-vision-transformer-for","title":"Patch n' Pack: NaViT, a Vision Transformer for any Aspect Ratio and Resolution","date":"2023-07-12","arxiv_id":"2307.06304","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/patch-n-pack-navit-a-vision-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2307.06304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.06304"}},"official":null}},{"url":"/paper/holistic-evaluation-of-language-models","slug":"holistic-evaluation-of-language-models","title":"Holistic Evaluation of Language Models","date":"2022-11-16","arxiv_id":"2211.09110","repositories_listed":3,"syntology":null},{"url":"/paper/pareto-optimality-for-fairness-constrained","slug":"pareto-optimality-for-fairness-constrained","title":"Pareto Optimality for Fairness-constrained Collaborative Filtering","date":"2021-09-17","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/can-active-learning-preemptively-mitigate","slug":"can-active-learning-preemptively-mitigate","title":"Can Active Learning Preemptively Mitigate Fairness Issues?","date":"2021-04-14","arxiv_id":"2104.06879","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/can-active-learning-preemptively-mitigate#ran","syntology_url":"https://syntology.ai/paper/2104.06879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06879"}},"official":{"repos":["ElementAI/active-fairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-unified-framework-for-fair-and","slug":"towards-a-unified-framework-for-fair-and","title":"Towards a Unified Framework for Fair and Stable Graph Representation Learning","date":"2021-02-25","arxiv_id":"2102.13186","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/towards-a-unified-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2102.13186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13186"}},"official":{"repos":["chirag126/nifty"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/learning-fair-policies-in-decentralized","slug":"learning-fair-policies-in-decentralized","title":"Learning Fair Policies in Decentralized Cooperative Multi-Agent Reinforcement Learning","date":"2020-12-17","arxiv_id":"2012.09421","repositories_listed":3,"syntology":null},{"url":"/paper/weakly-supervised-disentanglement-without","slug":"weakly-supervised-disentanglement-without","title":"Weakly-Supervised Disentanglement Without Compromises","date":"2020-02-07","arxiv_id":"2002.02886","repositories_listed":3,"syntology":null},{"url":"/paper/fairness-measures-for-regression-via","slug":"fairness-measures-for-regression-via","title":"Fairness Measures for Regression via Probabilistic Classification","date":"2020-01-16","arxiv_id":"2001.06089","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-measures-for-regression-via#ran","syntology_url":"https://syntology.ai/paper/2001.06089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06089"}},"official":null}},{"url":"/paper/towards-fairness-in-visual-recognition","slug":"towards-fairness-in-visual-recognition","title":"Towards Fairness in Visual Recognition: Effective Strategies for Bias Mitigation","date":"2019-11-26","arxiv_id":"1911.11834","repositories_listed":3,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/towards-fairness-in-visual-recognition#ran","syntology_url":"https://syntology.ai/paper/1911.11834","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11834"}},"official":{"repos":["princetonvisualai/DomainBiasMitigation"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learning-to-deceive-with-attention-based","slug":"learning-to-deceive-with-attention-based","title":"Learning to Deceive with Attention-Based Explanations","date":"2019-09-17","arxiv_id":"1909.07913","repositories_listed":3,"syntology":null},{"url":"/paper/fat-forensics-a-python-toolbox-for","slug":"fat-forensics-a-python-toolbox-for","title":"FAT Forensics: A Python Toolbox for Algorithmic Fairness, Accountability and Transparency","date":"2019-09-11","arxiv_id":"1909.05167","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fat-forensics-a-python-toolbox-for#ran","syntology_url":"https://syntology.ai/paper/1909.05167","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05167"}},"official":{"repos":["fat-forensics/fatf-dashboard","fat-forensics/resources","fat-forensics/fat-forensics"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-task-specific-data-valuation-for","slug":"efficient-task-specific-data-valuation-for","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","date":"2019-08-22","arxiv_id":"1908.08619","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-task-specific-data-valuation-for#ran","syntology_url":"https://syntology.ai/paper/1908.08619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08619"}},"official":{"repos":["AI-secure/KNN-PVLDB"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-realistic-individual-recourse-and","slug":"towards-realistic-individual-recourse-and","title":"Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systems","date":"2019-07-22","arxiv_id":"1907.09615","repositories_listed":3,"syntology":null},{"url":"/paper/190510497","slug":"190510497","title":"Fair Resource Allocation in Federated Learning","date":"2019-05-25","arxiv_id":"1905.10497","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/190510497#ran","syntology_url":"https://syntology.ai/paper/1905.10497","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10497"}},"official":{"repos":["litian96/fair_flearn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-controllable-fair-representations","slug":"learning-controllable-fair-representations","title":"Learning Controllable Fair Representations","date":"2018-12-11","arxiv_id":"1812.04218","repositories_listed":3,"syntology":null},{"url":"/paper/predicting-race-and-ethnicity-from-the","slug":"predicting-race-and-ethnicity-from-the","title":"Predicting Race and Ethnicity From the Sequence of Characters in a Name","date":"2018-05-05","arxiv_id":"1805.02109","repositories_listed":3,"syntology":null},{"url":"/paper/delayed-impact-of-fair-machine-learning","slug":"delayed-impact-of-fair-machine-learning","title":"Delayed Impact of Fair Machine Learning","date":"2018-03-12","arxiv_id":"1803.04383","repositories_listed":3,"syntology":null},{"url":"/paper/a-reductions-approach-to-fair-classification","slug":"a-reductions-approach-to-fair-classification","title":"A Reductions Approach to Fair Classification","date":"2018-03-06","arxiv_id":"1803.02453","repositories_listed":3,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-reductions-approach-to-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1803.02453","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02453"}},"official":null}},{"url":"/paper/counterfactual-fairness","slug":"counterfactual-fairness","title":"Counterfactual Fairness","date":"2017-03-20","arxiv_id":"1703.06856","repositories_listed":3,"syntology":null},{"url":"/paper/fairness-beyond-disparate-treatment-disparate","slug":"fairness-beyond-disparate-treatment-disparate","title":"Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatment","date":"2016-10-26","arxiv_id":"1610.08452","repositories_listed":3,"syntology":null},{"url":"/paper/towards-holistic-evaluation-of-large-audio","slug":"towards-holistic-evaluation-of-large-audio","title":"Towards Holistic Evaluation of Large Audio-Language Models: A Comprehensive Survey","date":"2025-05-21","arxiv_id":"2505.15957","repositories_listed":2,"syntology":null},{"url":"/paper/sakura-on-the-multi-hop-reasoning-of-large","slug":"sakura-on-the-multi-hop-reasoning-of-large","title":"SAKURA: On the Multi-hop Reasoning of Large Audio-Language Models Based on Speech and Audio Information","date":"2025-05-19","arxiv_id":"2505.13237","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sakura-on-the-multi-hop-reasoning-of-large#ran","syntology_url":"https://syntology.ai/paper/2505.13237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.13237"}},"official":{"repos":["b08202033/SAKURA","ckyang1124/sakura"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/litelmguard-seamless-and-lightweight-on","slug":"litelmguard-seamless-and-lightweight-on","title":"LiteLMGuard: Seamless and Lightweight On-Device Prompt Filtering for Safeguarding Small Language Models against Quantization-induced Risks and Vulnerabilities","date":"2025-05-08","arxiv_id":"2505.05619","repositories_listed":2,"syntology":null},{"url":"/paper/tabularargn-a-flexible-and-efficient-auto-1","slug":"tabularargn-a-flexible-and-efficient-auto-1","title":"TabularARGN: A Flexible and Efficient Auto-Regressive Framework for Generating High-Fidelity Synthetic Data","date":"2025-01-21","arxiv_id":"2501.12012","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/tabularargn-a-flexible-and-efficient-auto-1#ran","syntology_url":"https://syntology.ai/paper/2501.12012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.12012"}},"official":{"repos":["mostly-ai/mostlyai-engine"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/faircode-evaluating-social-bias-of-llms-in","slug":"faircode-evaluating-social-bias-of-llms-in","title":"FairCoder: Evaluating Social Bias of LLMs in Code Generation","date":"2025-01-09","arxiv_id":"2501.05396","repositories_listed":2,"syntology":null},{"url":"/paper/fairsort-learning-to-fair-rank-for","slug":"fairsort-learning-to-fair-rank-for","title":"FairSort: Learning to Fair Rank for Personalized Recommendations in Two-Sided Platforms","date":"2024-11-30","arxiv_id":"2412.00424","repositories_listed":2,"syntology":null},{"url":"/paper/fair-bilevel-neural-network-fairbinn-on","slug":"fair-bilevel-neural-network-fairbinn-on","title":"Fair Bilevel Neural Network (FairBiNN): On Balancing fairness and accuracy via Stackelberg Equilibrium","date":"2024-10-21","arxiv_id":"2410.16432","repositories_listed":2,"syntology":{"n":20,"n_ran":16,"n_constructed":3,"n_ran_checked":11,"n_instrument":5,"n_unverified":4,"n_honours":3,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"16 ran (of which 3 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fair-bilevel-neural-network-fairbinn-on#ran","syntology_url":"https://syntology.ai/paper/2410.16432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16432"}},"official":{"repos":["yazdanimehdi/fairbinn"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":1,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/an-introduction-to-deep-survival-analysis","slug":"an-introduction-to-deep-survival-analysis","title":"An Introduction to Deep Survival Analysis Models for Predicting Time-to-Event Outcomes","date":"2024-10-01","arxiv_id":"2410.01086","repositories_listed":2,"syntology":{"n":24,"n_ran":20,"n_constructed":0,"n_ran_checked":15,"n_instrument":5,"n_unverified":4,"n_honours":5,"n_violates":0,"n_no_contract":10,"n_pointer_only":24,"phrase":"20 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 5 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/an-introduction-to-deep-survival-analysis#ran","syntology_url":"https://syntology.ai/paper/2410.01086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.01086"}},"official":{"repos":["georgehc/survival-intro","georgehc/survival-kernets"],"state":"official (archive's flag): 20 ran","n_ran":20,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/padetbench-towards-benchmarking-physical","slug":"padetbench-towards-benchmarking-physical","title":"PADetBench: Towards Benchmarking Physical Attacks against Object Detection","date":"2024-08-17","arxiv_id":"2408.09181","repositories_listed":2,"syntology":null},{"url":"/paper/embracing-fairness-in-consumer-electricity","slug":"embracing-fairness-in-consumer-electricity","title":"Embracing Fairness in Consumer Electricity Markets using an Automatic Market Maker","date":"2024-07-30","arxiv_id":"2407.20814","repositories_listed":2,"syntology":null},{"url":"/paper/merit-based-fair-combinatorial-semi-bandit","slug":"merit-based-fair-combinatorial-semi-bandit","title":"Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays","date":"2024-07-22","arxiv_id":"2407.15439","repositories_listed":2,"syntology":null},{"url":"/paper/multilingual-trolley-problems-for-language","slug":"multilingual-trolley-problems-for-language","title":"Language Model Alignment in Multilingual Trolley Problems","date":"2024-07-02","arxiv_id":"2407.02273","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/multilingual-trolley-problems-for-language#ran","syntology_url":"https://syntology.ai/paper/2407.02273","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02273"}},"official":{"repos":["causalNLP/moralmachine","causalnlp/multitp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/torchspatial-a-location-encoding-framework","slug":"torchspatial-a-location-encoding-framework","title":"TorchSpatial: A Location Encoding Framework and Benchmark for Spatial Representation Learning","date":"2024-06-21","arxiv_id":"2406.15658","repositories_listed":2,"syntology":{"n":22,"n_ran":21,"n_constructed":0,"n_ran_checked":11,"n_instrument":10,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":8,"n_pointer_only":4,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 1 violated, 8 with no contract checked; 10 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/torchspatial-a-location-encoding-framework#ran","syntology_url":"https://syntology.ai/paper/2406.15658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15658"}},"official":{"repos":["seai-lab/torchspatial","seai-lab/pygbs"],"state":"official (archive's flag): 21 ran","n_ran":21,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairer-preferences-elicit-improved-human","slug":"fairer-preferences-elicit-improved-human","title":"Fairer Preferences Elicit Improved Human-Aligned Large Language Model Judgments","date":"2024-06-17","arxiv_id":"2406.11370","repositories_listed":2,"syntology":{"n":29,"n_ran":20,"n_constructed":4,"n_ran_checked":10,"n_instrument":10,"n_unverified":9,"n_honours":3,"n_violates":2,"n_no_contract":5,"n_pointer_only":2,"phrase":"20 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 3 honoured, 2 violated, 5 with no contract checked; 10 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/fairer-preferences-elicit-improved-human#ran","syntology_url":"https://syntology.ai/paper/2406.11370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11370"}},"official":{"repos":["cambridgeltl/zepo"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/are-your-models-still-fair-fairness-attacks","slug":"are-your-models-still-fair-fairness-attacks","title":"Are Your Models Still Fair? Fairness Attacks on Graph Neural Networks via Node Injections","date":"2024-06-05","arxiv_id":"2406.03052","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/are-your-models-still-fair-fairness-attacks#ran","syntology_url":"https://syntology.ai/paper/2406.03052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03052"}},"official":{"repos":["cgcl-codes/nifa","LuoZhhh/NIFA"],"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/optimal-group-fair-classifiers-from-linear","slug":"optimal-group-fair-classifiers-from-linear","title":"A Unified Post-Processing Framework for Group Fairness in Classification","date":"2024-05-07","arxiv_id":"2405.04025","repositories_listed":2,"syntology":null},{"url":"/paper/global-concept-explanations-for-graphs-by","slug":"global-concept-explanations-for-graphs-by","title":"Global Concept Explanations for Graphs by Contrastive Learning","date":"2024-04-25","arxiv_id":"2404.16532","repositories_listed":2,"syntology":null},{"url":"/paper/fairclip-harnessing-fairness-in-vision","slug":"fairclip-harnessing-fairness-in-vision","title":"FairCLIP: Harnessing Fairness in Vision-Language Learning","date":"2024-03-29","arxiv_id":"2403.19949","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 1 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/fairclip-harnessing-fairness-in-vision#ran","syntology_url":"https://syntology.ai/paper/2403.19949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.19949"}},"official":{"repos":["Harvard-Ophthalmology-AI-Lab/FairCLIP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/theoretically-achieving-continuous","slug":"theoretically-achieving-continuous","title":"Theoretically Achieving Continuous Representation of Oriented Bounding Boxes","date":"2024-02-29","arxiv_id":"2402.18975","repositories_listed":2,"syntology":null},{"url":"/paper/tunetables-context-optimization-for-scalable","slug":"tunetables-context-optimization-for-scalable","title":"TuneTables: Context Optimization for Scalable Prior-Data Fitted Networks","date":"2024-02-17","arxiv_id":"2402.11137","repositories_listed":2,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":5,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/tunetables-context-optimization-for-scalable#ran","syntology_url":"https://syntology.ai/paper/2402.11137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11137"}},"official":{"repos":["penfever/tabpfn-pt","penfever/tunetables"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/reinforcement-learning-as-a-catalyst-for","slug":"reinforcement-learning-as-a-catalyst-for","title":"FedAA: A Reinforcement Learning Perspective on Adaptive Aggregation for Fair and Robust Federated Learning","date":"2024-02-08","arxiv_id":"2402.05541","repositories_listed":2,"syntology":null},{"url":"/paper/continual-learning-with-pre-trained-models-a","slug":"continual-learning-with-pre-trained-models-a","title":"Continual Learning with Pre-Trained Models: A Survey","date":"2024-01-29","arxiv_id":"2401.16386","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/continual-learning-with-pre-trained-models-a#ran","syntology_url":"https://syntology.ai/paper/2401.16386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16386"}},"official":{"repos":["sun-hailong/lamda-pilot"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-condensation-a-survey","slug":"graph-condensation-a-survey","title":"Graph Condensation: A Survey","date":"2024-01-22","arxiv_id":"2401.11720","repositories_listed":2,"syntology":null},{"url":"/paper/trustllm-trustworthiness-in-large-language","slug":"trustllm-trustworthiness-in-large-language","title":"TrustLLM: Trustworthiness in Large Language Models","date":"2024-01-10","arxiv_id":"2401.05561","repositories_listed":2,"syntology":null},{"url":"/paper/fairness-in-serving-large-language-models","slug":"fairness-in-serving-large-language-models","title":"Fairness in Serving Large Language Models","date":"2023-12-31","arxiv_id":"2401.00588","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"9 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; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fairness-in-serving-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2401.00588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00588"}},"official":{"repos":["ying1123/vtc-artifact"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/exploring-the-impact-of-lay-user-feedback-for","slug":"exploring-the-impact-of-lay-user-feedback-for","title":"Human-in-the-loop Fairness: Integrating Stakeholder Feedback to Incorporate Fairness Perspectives in Responsible AI","date":"2023-12-13","arxiv_id":"2312.08064","repositories_listed":2,"syntology":null},{"url":"/paper/delphi-data-for-evaluating-llms-performance","slug":"delphi-data-for-evaluating-llms-performance","title":"DELPHI: Data for Evaluating LLMs' Performance in Handling Controversial Issues","date":"2023-10-27","arxiv_id":"2310.18130","repositories_listed":2,"syntology":null},{"url":"/paper/enhancing-group-fairness-in-online-settings","slug":"enhancing-group-fairness-in-online-settings","title":"Enhancing Group Fairness in Online Settings Using Oblique Decision Forests","date":"2023-10-17","arxiv_id":"2310.11401","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-group-fairness-in-online-settings#ran","syntology_url":"https://syntology.ai/paper/2310.11401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11401"}},"official":{"repos":["brcsomnath/aranyani"],"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/grid-aware-on-route-fast-charging","slug":"grid-aware-on-route-fast-charging","title":"Grid-Aware On-Route Fast-Charging Infrastructure Planning for Battery Electric Bus with Equity Considerations: A Case Study in South King County","date":"2023-09-14","arxiv_id":"2309.07422","repositories_listed":2,"syntology":null},{"url":"/paper/equal-long-term-benefit-rate-adapting-static","slug":"equal-long-term-benefit-rate-adapting-static","title":"Adapting Static Fairness to Sequential Decision-Making: Bias Mitigation Strategies towards Equal Long-term Benefit Rate","date":"2023-09-07","arxiv_id":"2309.03426","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/equal-long-term-benefit-rate-adapting-static#ran","syntology_url":"https://syntology.ai/paper/2309.03426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.03426"}},"official":{"repos":["umd-huang-lab/elbert","yuancheng-xu/elbert"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fair-ranking-under-disparate-uncertainty","slug":"fair-ranking-under-disparate-uncertainty","title":"Fairness in Ranking under Disparate Uncertainty","date":"2023-09-04","arxiv_id":"2309.01610","repositories_listed":2,"syntology":null},{"url":"/paper/unlocking-accuracy-and-fairness-in","slug":"unlocking-accuracy-and-fairness-in","title":"Unlocking Accuracy and Fairness in Differentially Private Image Classification","date":"2023-08-21","arxiv_id":"2308.10888","repositories_listed":2,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/unlocking-accuracy-and-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2308.10888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10888"}},"official":{"repos":["deepmind/jax_privacy"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/dark-skin-individuals-are-at-more-risk-on-the","slug":"dark-skin-individuals-are-at-more-risk-on-the","title":"Bias Behind the Wheel: Fairness Testing of Autonomous Driving Systems","date":"2023-08-05","arxiv_id":"2308.02935","repositories_listed":2,"syntology":null},{"url":"/paper/fix-fairness-don-t-ruin-accuracy-performance","slug":"fix-fairness-don-t-ruin-accuracy-performance","title":"Fix Fairness, Don't Ruin Accuracy: Performance Aware Fairness Repair using AutoML","date":"2023-06-15","arxiv_id":"2306.09297","repositories_listed":2,"syntology":null},{"url":"/paper/h2ogpt-democratizing-large-language-models","slug":"h2ogpt-democratizing-large-language-models","title":"h2oGPT: Democratizing Large Language Models","date":"2023-06-13","arxiv_id":"2306.08161","repositories_listed":2,"syntology":null},{"url":"/paper/leace-perfect-linear-concept-erasure-in","slug":"leace-perfect-linear-concept-erasure-in","title":"LEACE: Perfect linear concept erasure in closed form","date":"2023-06-06","arxiv_id":"2306.03819","repositories_listed":2,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/leace-perfect-linear-concept-erasure-in#ran","syntology_url":"https://syntology.ai/paper/2306.03819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03819"}},"official":{"repos":["eleutherai/concept-erasure"],"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":["listed","official"]}}},{"url":"/paper/should-we-attend-more-or-less-modulating","slug":"should-we-attend-more-or-less-modulating","title":"Should We Attend More or Less? Modulating Attention for Fairness","date":"2023-05-22","arxiv_id":"2305.13088","repositories_listed":2,"syntology":null},{"url":"/paper/measuring-implicit-bias-using-shap-feature","slug":"measuring-implicit-bias-using-shap-feature","title":"Measuring Implicit Bias Using SHAP Feature Importance and Fuzzy Cognitive Maps","date":"2023-05-16","arxiv_id":"2305.09399","repositories_listed":2,"syntology":null},{"url":"/paper/from-pretraining-data-to-language-models-to","slug":"from-pretraining-data-to-language-models-to","title":"From Pretraining Data to Language Models to Downstream Tasks: Tracking the Trails of Political Biases Leading to Unfair NLP Models","date":"2023-05-15","arxiv_id":"2305.08283","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/from-pretraining-data-to-language-models-to#ran","syntology_url":"https://syntology.ai/paper/2305.08283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08283"}},"official":{"repos":["bunsenfeng/polilean"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/last-layer-fairness-fine-tuning-is-simple-and","slug":"last-layer-fairness-fine-tuning-is-simple-and","title":"Last-Layer Fairness Fine-tuning is Simple and Effective for Neural Networks","date":"2023-04-08","arxiv_id":"2304.03935","repositories_listed":2,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/last-layer-fairness-fine-tuning-is-simple-and#ran","syntology_url":"https://syntology.ai/paper/2304.03935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.03935"}},"official":{"repos":["yuzhenmao/fairness-finetuning"],"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/gpt-detectors-are-biased-against-non-native","slug":"gpt-detectors-are-biased-against-non-native","title":"GPT detectors are biased against non-native English writers","date":"2023-04-06","arxiv_id":"2304.02819","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/gpt-detectors-are-biased-against-non-native#ran","syntology_url":"https://syntology.ai/paper/2304.02819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02819"}},"official":{"repos":["weixin-liang/chatgpt-detector-bias"],"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/incremental-verification-of-neural-networks","slug":"incremental-verification-of-neural-networks","title":"Incremental Verification of Neural Networks","date":"2023-04-04","arxiv_id":"2304.01874","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/incremental-verification-of-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2304.01874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.01874"}},"official":{"repos":["uiuc-focal-lab/IVAN"],"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/curvature-balanced-feature-manifold-learning","slug":"curvature-balanced-feature-manifold-learning","title":"Predicting and Enhancing the Fairness of DNNs with the Curvature of Perceptual Manifolds","date":"2023-03-22","arxiv_id":"2303.12307","repositories_listed":2,"syntology":null},{"url":"/paper/robustness-implies-fairness-in-casual","slug":"robustness-implies-fairness-in-casual","title":"Robustness Implies Fairness in Causal Algorithmic Recourse","date":"2023-02-07","arxiv_id":"2302.03465","repositories_listed":2,"syntology":null},{"url":"/paper/private-fair-and-accurate-training-large","slug":"private-fair-and-accurate-training-large","title":"Private, fair and accurate: Training large-scale, privacy-preserving AI models in medical imaging","date":"2023-02-03","arxiv_id":"2302.01622","repositories_listed":2,"syntology":null},{"url":"/paper/synthcity-facilitating-innovative-use-cases","slug":"synthcity-facilitating-innovative-use-cases","title":"Synthcity: facilitating innovative use cases of synthetic data in different data modalities","date":"2023-01-18","arxiv_id":"2301.07573","repositories_listed":2,"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/synthcity-facilitating-innovative-use-cases#ran","syntology_url":"https://syntology.ai/paper/2301.07573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07573"}},"official":{"repos":["vanderschaarlab/synthcity"],"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/why-is-the-state-of-neural-network-pruning-so","slug":"why-is-the-state-of-neural-network-pruning-so","title":"Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruning","date":"2023-01-12","arxiv_id":"2301.05219","repositories_listed":2,"syntology":null},{"url":"/paper/on-fairness-of-medical-image-classification","slug":"on-fairness-of-medical-image-classification","title":"On Fairness of Medical Image Classification with Multiple Sensitive Attributes via Learning Orthogonal Representations","date":"2023-01-04","arxiv_id":"2301.01481","repositories_listed":2,"syntology":null}],"syntology_records":52,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":404,"papers_where_code_ran_first_page":"/task/fairness/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":57,"url":"/task/fairness/papers/2","json":"/task/fairness/papers/2.json","rows":100},{"order":"archive","page":3,"of":57,"url":"/task/fairness/papers/3","json":"/task/fairness/papers/3.json","rows":100},{"order":"archive","page":4,"of":57,"url":"/task/fairness/papers/4","json":"/task/fairness/papers/4.json","rows":100},{"order":"archive","page":5,"of":57,"url":"/task/fairness/papers/5","json":"/task/fairness/papers/5.json","rows":100},{"order":"archive","page":6,"of":57,"url":"/task/fairness/papers/6","json":"/task/fairness/papers/6.json","rows":100},{"order":"archive","page":7,"of":57,"url":"/task/fairness/papers/7","json":"/task/fairness/papers/7.json","rows":100},{"order":"archive","page":8,"of":57,"url":"/task/fairness/papers/8","json":"/task/fairness/papers/8.json","rows":100},{"order":"archive","page":9,"of":57,"url":"/task/fairness/papers/9","json":"/task/fairness/papers/9.json","rows":100},{"order":"archive","page":10,"of":57,"url":"/task/fairness/papers/10","json":"/task/fairness/papers/10.json","rows":100},{"order":"archive","page":11,"of":57,"url":"/task/fairness/papers/11","json":"/task/fairness/papers/11.json","rows":100},{"order":"archive","page":12,"of":57,"url":"/task/fairness/papers/12","json":"/task/fairness/papers/12.json","rows":100},{"order":"archive","page":13,"of":57,"url":"/task/fairness/papers/13","json":"/task/fairness/papers/13.json","rows":100},{"order":"archive","page":14,"of":57,"url":"/task/fairness/papers/14","json":"/task/fairness/papers/14.json","rows":100},{"order":"archive","page":15,"of":57,"url":"/task/fairness/papers/15","json":"/task/fairness/papers/15.json","rows":100},{"order":"archive","page":16,"of":57,"url":"/task/fairness/papers/16","json":"/task/fairness/papers/16.json","rows":100},{"order":"archive","page":17,"of":57,"url":"/task/fairness/papers/17","json":"/task/fairness/papers/17.json","rows":100},{"order":"archive","page":18,"of":57,"url":"/task/fairness/papers/18","json":"/task/fairness/papers/18.json","rows":100},{"order":"archive","page":19,"of":57,"url":"/task/fairness/papers/19","json":"/task/fairness/papers/19.json","rows":100},{"order":"archive","page":20,"of":57,"url":"/task/fairness/papers/20","json":"/task/fairness/papers/20.json","rows":100},{"order":"archive","page":21,"of":57,"url":"/task/fairness/papers/21","json":"/task/fairness/papers/21.json","rows":100},{"order":"archive","page":22,"of":57,"url":"/task/fairness/papers/22","json":"/task/fairness/papers/22.json","rows":100},{"order":"archive","page":23,"of":57,"url":"/task/fairness/papers/23","json":"/task/fairness/papers/23.json","rows":100},{"order":"archive","page":24,"of":57,"url":"/task/fairness/papers/24","json":"/task/fairness/papers/24.json","rows":100},{"order":"archive","page":25,"of":57,"url":"/task/fairness/papers/25","json":"/task/fairness/papers/25.json","rows":100},{"order":"archive","page":26,"of":57,"url":"/task/fairness/papers/26","json":"/task/fairness/papers/26.json","rows":100},{"order":"archive","page":27,"of":57,"url":"/task/fairness/papers/27","json":"/task/fairness/papers/27.json","rows":100},{"order":"archive","page":28,"of":57,"url":"/task/fairness/papers/28","json":"/task/fairness/papers/28.json","rows":100},{"order":"archive","page":29,"of":57,"url":"/task/fairness/papers/29","json":"/task/fairness/papers/29.json","rows":100},{"order":"archive","page":30,"of":57,"url":"/task/fairness/papers/30","json":"/task/fairness/papers/30.json","rows":100},{"order":"archive","page":31,"of":57,"url":"/task/fairness/papers/31","json":"/task/fairness/papers/31.json","rows":100},{"order":"archive","page":32,"of":57,"url":"/task/fairness/papers/32","json":"/task/fairness/papers/32.json","rows":100},{"order":"archive","page":33,"of":57,"url":"/task/fairness/papers/33","json":"/task/fairness/papers/33.json","rows":100},{"order":"archive","page":34,"of":57,"url":"/task/fairness/papers/34","json":"/task/fairness/papers/34.json","rows":100},{"order":"archive","page":35,"of":57,"url":"/task/fairness/papers/35","json":"/task/fairness/papers/35.json","rows":100},{"order":"archive","page":36,"of":57,"url":"/task/fairness/papers/36","json":"/task/fairness/papers/36.json","rows":100},{"order":"archive","page":37,"of":57,"url":"/task/fairness/papers/37","json":"/task/fairness/papers/37.json","rows":100},{"order":"archive","page":38,"of":57,"url":"/task/fairness/papers/38","json":"/task/fairness/papers/38.json","rows":100},{"order":"archive","page":39,"of":57,"url":"/task/fairness/papers/39","json":"/task/fairness/papers/39.json","rows":100},{"order":"archive","page":40,"of":57,"url":"/task/fairness/papers/40","json":"/task/fairness/papers/40.json","rows":100},{"order":"archive","page":41,"of":57,"url":"/task/fairness/papers/41","json":"/task/fairness/papers/41.json","rows":100},{"order":"archive","page":42,"of":57,"url":"/task/fairness/papers/42","json":"/task/fairness/papers/42.json","rows":100},{"order":"archive","page":43,"of":57,"url":"/task/fairness/papers/43","json":"/task/fairness/papers/43.json","rows":100},{"order":"archive","page":44,"of":57,"url":"/task/fairness/papers/44","json":"/task/fairness/papers/44.json","rows":100},{"order":"archive","page":45,"of":57,"url":"/task/fairness/papers/45","json":"/task/fairness/papers/45.json","rows":100},{"order":"archive","page":46,"of":57,"url":"/task/fairness/papers/46","json":"/task/fairness/papers/46.json","rows":100},{"order":"archive","page":47,"of":57,"url":"/task/fairness/papers/47","json":"/task/fairness/papers/47.json","rows":100},{"order":"archive","page":48,"of":57,"url":"/task/fairness/papers/48","json":"/task/fairness/papers/48.json","rows":100},{"order":"archive","page":49,"of":57,"url":"/task/fairness/papers/49","json":"/task/fairness/papers/49.json","rows":100},{"order":"archive","page":50,"of":57,"url":"/task/fairness/papers/50","json":"/task/fairness/papers/50.json","rows":100},{"order":"archive","page":51,"of":57,"url":"/task/fairness/papers/51","json":"/task/fairness/papers/51.json","rows":100},{"order":"archive","page":52,"of":57,"url":"/task/fairness/papers/52","json":"/task/fairness/papers/52.json","rows":100},{"order":"archive","page":53,"of":57,"url":"/task/fairness/papers/53","json":"/task/fairness/papers/53.json","rows":100},{"order":"archive","page":54,"of":57,"url":"/task/fairness/papers/54","json":"/task/fairness/papers/54.json","rows":100},{"order":"archive","page":55,"of":57,"url":"/task/fairness/papers/55","json":"/task/fairness/papers/55.json","rows":100},{"order":"archive","page":56,"of":57,"url":"/task/fairness/papers/56","json":"/task/fairness/papers/56.json","rows":100},{"order":"archive","page":57,"of":57,"url":"/task/fairness/papers/57","json":"/task/fairness/papers/57.json","rows":76},{"order":"ran","page":1,"of":5,"url":"/task/fairness/papers/ran/1","json":"/task/fairness/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":5,"url":"/task/fairness/papers/ran/2","json":"/task/fairness/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":5,"url":"/task/fairness/papers/ran/3","json":"/task/fairness/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":5,"url":"/task/fairness/papers/ran/4","json":"/task/fairness/papers/ran/4.json","rows":100},{"order":"ran","page":5,"of":5,"url":"/task/fairness/papers/ran/5","json":"/task/fairness/papers/ran/5.json","rows":4}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"8abbb40f6ce773392120bb930bf1923bba8e84d2ca3249db32f05ba5ac756405","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}