{"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/13","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":13,"pages_in_order":57,"rows_per_page":100,"rows":[1201,1300],"of":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":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","prev":"/task/fairness/papers/12","next":"/task/fairness/papers/14","papers":[{"url":"/paper/stereokg-data-driven-knowledge-graph","slug":"stereokg-data-driven-knowledge-graph","title":"StereoKG: Data-Driven Knowledge Graph Construction for Cultural Knowledge and Stereotypes","date":"2022-05-27","arxiv_id":"2205.14036","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-group-fairness-metrics-for-survival","slug":"flexible-group-fairness-metrics-for-survival","title":"Flexible Group Fairness Metrics for Survival Analysis","date":"2022-05-26","arxiv_id":"2206.03256","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-of-exposure-in-light-of-incomplete","slug":"fairness-of-exposure-in-light-of-incomplete","title":"Fairness of Exposure in Light of Incomplete Exposure Estimation","date":"2022-05-25","arxiv_id":"2205.12901","repositories_listed":1,"syntology":null},{"url":"/paper/perturbation-augmentation-for-fairer-nlp","slug":"perturbation-augmentation-for-fairer-nlp","title":"Perturbation Augmentation for Fairer NLP","date":"2022-05-25","arxiv_id":"2205.12586","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/perturbation-augmentation-for-fairer-nlp#ran","syntology_url":"https://syntology.ai/paper/2205.12586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12586"}},"official":{"repos":["facebookresearch/responsiblenlp"],"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/a-survey-of-research-on-fair-recommender","slug":"a-survey-of-research-on-fair-recommender","title":"Fairness in Recommender Systems: Research Landscape and Future Directions","date":"2022-05-23","arxiv_id":"2205.11127","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-supervised-contrastive-learning","slug":"conditional-supervised-contrastive-learning","title":"Conditional Supervised Contrastive Learning for Fair Text Classification","date":"2022-05-23","arxiv_id":"2205.11485","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-demographic-bias-transfer-from","slug":"assessing-demographic-bias-transfer-from","title":"Assessing Demographic Bias Transfer from Dataset to Model: A Case Study in Facial Expression Recognition","date":"2022-05-20","arxiv_id":"2205.10049","repositories_listed":1,"syntology":null},{"url":"/paper/what-s-the-harm-sharp-bounds-on-the-fraction","slug":"what-s-the-harm-sharp-bounds-on-the-fraction","title":"What's the Harm? Sharp Bounds on the Fraction Negatively Affected by Treatment","date":"2022-05-20","arxiv_id":"2205.10327","repositories_listed":1,"syntology":null},{"url":"/paper/dper-dynamic-programming-for-exist-random","slug":"dper-dynamic-programming-for-exist-random","title":"DPER: Dynamic Programming for Exist-Random Stochastic SAT","date":"2022-05-19","arxiv_id":"2205.09826","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-fairness-improving-individual","slug":"accurate-fairness-improving-individual","title":"Accurate Fairness: Improving Individual Fairness without Trading Accuracy","date":"2022-05-18","arxiv_id":"2205.08704","repositories_listed":1,"syntology":null},{"url":"/paper/experiments-on-generalizability-of-user","slug":"experiments-on-generalizability-of-user","title":"Experiments on Generalizability of User-Oriented Fairness in Recommender Systems","date":"2022-05-17","arxiv_id":"2205.08289","repositories_listed":1,"syntology":null},{"url":"/paper/explanation-guided-fairness-testing-through","slug":"explanation-guided-fairness-testing-through","title":"Explanation-Guided Fairness Testing through Genetic Algorithm","date":"2022-05-16","arxiv_id":"2205.08335","repositories_listed":1,"syntology":null},{"url":"/paper/fair-nlp-models-with-differentially-private-1","slug":"fair-nlp-models-with-differentially-private-1","title":"Fair NLP Models with Differentially Private Text Encoders","date":"2022-05-12","arxiv_id":"2205.06135","repositories_listed":1,"syntology":null},{"url":"/paper/de-biasing-bias-measurement","slug":"de-biasing-bias-measurement","title":"De-biasing \"bias\" measurement","date":"2022-05-11","arxiv_id":"2205.05770","repositories_listed":1,"syntology":null},{"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/selective-fairness-in-recommendation-via","slug":"selective-fairness-in-recommendation-via","title":"Selective Fairness in Recommendation via Prompts","date":"2022-05-10","arxiv_id":"2205.04682","repositories_listed":1,"syntology":null},{"url":"/paper/towards-intersectionality-in-machine-learning","slug":"towards-intersectionality-in-machine-learning","title":"Towards Intersectionality in Machine Learning: Including More Identities, Handling Underrepresentation, and Performing Evaluation","date":"2022-05-10","arxiv_id":"2205.04610","repositories_listed":1,"syntology":null},{"url":"/paper/optimising-equal-opportunity-fairness-in","slug":"optimising-equal-opportunity-fairness-in","title":"Optimising Equal Opportunity Fairness in Model Training","date":"2022-05-05","arxiv_id":"2205.02393","repositories_listed":1,"syntology":null},{"url":"/paper/maxmin-participatory-budgeting","slug":"maxmin-participatory-budgeting","title":"Maxmin Participatory Budgeting","date":"2022-04-29","arxiv_id":"2204.13923","repositories_listed":1,"syntology":null},{"url":"/paper/user-controllable-recommendation-against","slug":"user-controllable-recommendation-against","title":"User-controllable Recommendation Against Filter Bubbles","date":"2022-04-29","arxiv_id":"2204.13844","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-permutation-graph-search-black","slug":"probabilistic-permutation-graph-search-black","title":"Probabilistic Permutation Graph Search: Black-Box Optimization for Fairness in Ranking","date":"2022-04-28","arxiv_id":"2204.13765","repositories_listed":1,"syntology":null},{"url":"/paper/scheduling-virtual-conferences-fairly","slug":"scheduling-virtual-conferences-fairly","title":"Scheduling Virtual Conferences Fairly: Achieving Equitable Participant and Speaker Satisfaction","date":"2022-04-26","arxiv_id":"2204.12062","repositories_listed":1,"syntology":null},{"url":"/paper/fairgan-gans-based-fairness-aware-learning","slug":"fairgan-gans-based-fairness-aware-learning","title":"FairGAN: GANs-based Fairness-aware Learning for Recommendations with Implicit Feedback","date":"2022-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/balancing-fairness-and-accuracy-in-sentiment","slug":"balancing-fairness-and-accuracy-in-sentiment","title":"Balancing Fairness and Accuracy in Sentiment Detection using Multiple Black Box Models","date":"2022-04-22","arxiv_id":"2204.10940","repositories_listed":1,"syntology":null},{"url":"/paper/ultra-marginal-feature-importance","slug":"ultra-marginal-feature-importance","title":"Ultra-marginal Feature Importance: Learning from Data with Causal Guarantees","date":"2022-04-21","arxiv_id":"2204.09938","repositories_listed":1,"syntology":null},{"url":"/paper/cpfair-personalized-consumer-and-producer","slug":"cpfair-personalized-consumer-and-producer","title":"CPFair: Personalized Consumer and Producer Fairness Re-ranking for Recommender Systems","date":"2022-04-17","arxiv_id":"2204.08085","repositories_listed":1,"syntology":null},{"url":"/paper/global-counterfactual-explanations","slug":"global-counterfactual-explanations","title":"Global Counterfactual Explanations: Investigations, Implementations and Improvements","date":"2022-04-14","arxiv_id":"2204.06917","repositories_listed":1,"syntology":null},{"url":"/paper/profairrec-provider-fairness-aware-news","slug":"profairrec-provider-fairness-aware-news","title":"ProFairRec: Provider Fairness-aware News Recommendation","date":"2022-04-10","arxiv_id":"2204.04724","repositories_listed":1,"syntology":null},{"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/fairneuron-improving-deep-neural-network","slug":"fairneuron-improving-deep-neural-network","title":"FairNeuron: Improving Deep Neural Network Fairness with Adversary Games on Selective Neurons","date":"2022-04-06","arxiv_id":"2204.02567","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-distributed-reinforcement","slug":"multi-agent-distributed-reinforcement","title":"Multi-Agent Distributed Reinforcement Learning for Making Decentralized Offloading Decisions","date":"2022-04-05","arxiv_id":"2204.02267","repositories_listed":1,"syntology":null},{"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/adjusting-for-bias-with-procedural-data","slug":"adjusting-for-bias-with-procedural-data","title":"Adjusting for Bias with Procedural Data","date":"2022-04-03","arxiv_id":"2204.01108","repositories_listed":1,"syntology":null},{"url":"/paper/a-critical-re-evaluation-of-neural-methods","slug":"a-critical-re-evaluation-of-neural-methods","title":"A Critical Re-evaluation of Neural Methods for Entity Alignment","date":"2022-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/balanced-mse-for-imbalanced-visual-regression","slug":"balanced-mse-for-imbalanced-visual-regression","title":"Balanced MSE for Imbalanced Visual Regression","date":"2022-03-30","arxiv_id":"2203.16427","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/balanced-mse-for-imbalanced-visual-regression#ran","syntology_url":"https://syntology.ai/paper/2203.16427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16427"}},"official":{"repos":["jiawei-ren/BalancedMSE"],"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-contrastive-learning-for-facial","slug":"fair-contrastive-learning-for-facial","title":"Fair Contrastive Learning for Facial Attribute Classification","date":"2022-03-30","arxiv_id":"2203.16209","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/fair-contrastive-learning-for-facial#ran","syntology_url":"https://syntology.ai/paper/2203.16209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16209"}},"official":{"repos":["sungho-coolg/fscl"],"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/learning-fair-models-without-sensitive","slug":"learning-fair-models-without-sensitive","title":"Learning Fair Models without Sensitive Attributes: A Generative Approach","date":"2022-03-30","arxiv_id":"2203.16413","repositories_listed":1,"syntology":null},{"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/searching-for-network-width-with-bilaterally","slug":"searching-for-network-width-with-bilaterally","title":"Searching for Network Width with Bilaterally Coupled Network","date":"2022-03-25","arxiv_id":"2203.13714","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-missing-sources-with-adversarial","slug":"addressing-missing-sources-with-adversarial","title":"Addressing Missing Sources with Adversarial Support-Matching","date":"2022-03-24","arxiv_id":"2203.13154","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-fairness-of-chest-x-ray","slug":"improving-the-fairness-of-chest-x-ray","title":"Improving the Fairness of Chest X-ray Classifiers","date":"2022-03-23","arxiv_id":"2203.12609","repositories_listed":1,"syntology":null},{"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/entropy-based-attention-regularization-frees","slug":"entropy-based-attention-regularization-frees","title":"Entropy-based Attention Regularization Frees Unintended Bias Mitigation from Lists","date":"2022-03-17","arxiv_id":"2203.09192","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/entropy-based-attention-regularization-frees#ran","syntology_url":"https://syntology.ai/paper/2203.09192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.09192"}},"official":{"repos":["g8a9/ear"],"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/to-train-or-not-to-train-adversarially-a","slug":"to-train-or-not-to-train-adversarially-a","title":"To train or not to train adversarially: A study of bias mitigation strategies for speaker recognition","date":"2022-03-17","arxiv_id":"2203.09122","repositories_listed":1,"syntology":null},{"url":"/paper/distraction-is-all-you-need-for-fairness","slug":"distraction-is-all-you-need-for-fairness","title":"Distraction is All You Need for Fairness","date":"2022-03-15","arxiv_id":"2203.07593","repositories_listed":1,"syntology":null},{"url":"/paper/dawn-of-the-transformer-era-in-speech-emotion","slug":"dawn-of-the-transformer-era-in-speech-emotion","title":"Dawn of the transformer era in speech emotion recognition: closing the valence gap","date":"2022-03-14","arxiv_id":"2203.07378","repositories_listed":1,"syntology":null},{"url":"/paper/fairlex-a-multilingual-benchmark-for-1","slug":"fairlex-a-multilingual-benchmark-for-1","title":"FairLex: A Multilingual Benchmark for Evaluating Fairness in Legal Text Processing","date":"2022-03-14","arxiv_id":"2203.07228","repositories_listed":1,"syntology":null},{"url":"/paper/towards-equal-opportunity-fairness-through-1","slug":"towards-equal-opportunity-fairness-through-1","title":"Towards Equal Opportunity Fairness through Adversarial Learning","date":"2022-03-12","arxiv_id":"2203.06317","repositories_listed":1,"syntology":null},{"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/learning-resilient-radio-resource-management","slug":"learning-resilient-radio-resource-management","title":"Learning Resilient Radio Resource Management Policies with Graph Neural Networks","date":"2022-03-07","arxiv_id":"2203.11012","repositories_listed":1,"syntology":null},{"url":"/paper/the-impact-of-differential-privacy-on-group","slug":"the-impact-of-differential-privacy-on-group","title":"The Impact of Differential Privacy on Group Disparity Mitigation","date":"2022-03-05","arxiv_id":"2203.02745","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-symbolic-verification-of-deep-neural","slug":"neuro-symbolic-verification-of-deep-neural","title":"Neuro-Symbolic Verification of Deep Neural Networks","date":"2022-03-02","arxiv_id":"2203.00938","repositories_listed":1,"syntology":null},{"url":"/paper/kl-divergence-estimation-with-multi-group","slug":"kl-divergence-estimation-with-multi-group","title":"KL Divergence Estimation with Multi-group Attribution","date":"2022-02-28","arxiv_id":"2202.13576","repositories_listed":1,"syntology":null},{"url":"/paper/the-unfairness-of-active-users-and-popularity","slug":"the-unfairness-of-active-users-and-popularity","title":"The Unfairness of Active Users and Popularity Bias in Point-of-Interest Recommendation","date":"2022-02-27","arxiv_id":"2202.13307","repositories_listed":1,"syntology":null},{"url":"/paper/a-fair-empirical-risk-minimization-with","slug":"a-fair-empirical-risk-minimization-with","title":"A Fair Empirical Risk Minimization with Generalized Entropy","date":"2022-02-24","arxiv_id":"2202.11966","repositories_listed":1,"syntology":null},{"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/bayes-optimal-classifiers-under-group","slug":"bayes-optimal-classifiers-under-group","title":"Bayes-Optimal Classifiers under Group Fairness","date":"2022-02-20","arxiv_id":"2202.09724","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-perturbations-of-tabular-features","slug":"stochastic-perturbations-of-tabular-features","title":"Stochastic Perturbations of Tabular Features for Non-Deterministic Inference with Automunge","date":"2022-02-18","arxiv_id":"2202.09248","repositories_listed":1,"syntology":null},{"url":"/paper/human-algorithm-collaboration-achieving","slug":"human-algorithm-collaboration-achieving","title":"Human-Algorithm Collaboration: Achieving Complementarity and Avoiding Unfairness","date":"2022-02-17","arxiv_id":"2202.08821","repositories_listed":1,"syntology":null},{"url":"/paper/vision-models-are-more-robust-and-fair-when","slug":"vision-models-are-more-robust-and-fair-when","title":"Vision Models Are More Robust And Fair When Pretrained On Uncurated Images Without Supervision","date":"2022-02-16","arxiv_id":"2202.08360","repositories_listed":1,"syntology":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/designing-closed-human-in-the-loop-deferral","slug":"designing-closed-human-in-the-loop-deferral","title":"Designing Closed Human-in-the-loop Deferral Pipelines","date":"2022-02-09","arxiv_id":"2202.04718","repositories_listed":1,"syntology":null},{"url":"/paper/obtaining-dyadic-fairness-by-optimal","slug":"obtaining-dyadic-fairness-by-optimal","title":"Obtaining Dyadic Fairness by Optimal Transport","date":"2022-02-09","arxiv_id":"2202.04520","repositories_listed":1,"syntology":null},{"url":"/paper/cascaded-debiasing-studying-the-cumulative","slug":"cascaded-debiasing-studying-the-cumulative","title":"Cascaded Debiasing: Studying the Cumulative Effect of Multiple Fairness-Enhancing Interventions","date":"2022-02-08","arxiv_id":"2202.03734","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-transport-of-binary-classifiers-to","slug":"optimal-transport-of-binary-classifiers-to","title":"Optimal Transport of Classifiers to Fairness","date":"2022-02-08","arxiv_id":"2202.03814","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/optimal-transport-of-binary-classifiers-to#ran","syntology_url":"https://syntology.ai/paper/2202.03814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03814"}},"official":{"repos":["aida-ugent/OTF"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/privfair-a-library-for-privacy-preserving","slug":"privfair-a-library-for-privacy-preserving","title":"PrivFair: a Library for Privacy-Preserving Fairness Auditing","date":"2022-02-08","arxiv_id":"2202.04058","repositories_listed":1,"syntology":null},{"url":"/paper/self-conditioned-generative-adversarial","slug":"self-conditioned-generative-adversarial","title":"Self-Conditioned Generative Adversarial Networks for Image Editing","date":"2022-02-08","arxiv_id":"2202.04040","repositories_listed":1,"syntology":null},{"url":"/paper/ai-based-artistic-representation-of-emotions","slug":"ai-based-artistic-representation-of-emotions","title":"AI-based artistic representation of emotions from EEG signals: a discussion on fairness, inclusion, and aesthetics","date":"2022-02-07","arxiv_id":"2202.03246","repositories_listed":1,"syntology":null},{"url":"/paper/introducing-the-expohedron-for-efficient","slug":"introducing-the-expohedron-for-efficient","title":"Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings","date":"2022-02-07","arxiv_id":"2202.03237","repositories_listed":1,"syntology":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/slide-a-surrogate-fairness-constraint-to","slug":"slide-a-surrogate-fairness-constraint-to","title":"SLIDE: a surrogate fairness constraint to ensure fairness consistency","date":"2022-02-07","arxiv_id":"2202.03165","repositories_listed":1,"syntology":null},{"url":"/paper/equality-is-not-equity-proportional-fairness","slug":"equality-is-not-equity-proportional-fairness","title":"Proportional Fairness in Federated Learning","date":"2022-02-03","arxiv_id":"2202.01666","repositories_listed":1,"syntology":null},{"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/achieving-fairness-at-no-utility-cost-via","slug":"achieving-fairness-at-no-utility-cost-via","title":"Achieving Fairness at No Utility Cost via Data Reweighing with Influence","date":"2022-02-01","arxiv_id":"2202.00787","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/achieving-fairness-at-no-utility-cost-via#ran","syntology_url":"https://syntology.ai/paper/2202.00787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.00787"}},"official":{"repos":["brandeis-machine-learning/influence-fairness"],"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-wrapping-for-black-box-predictions","slug":"fair-wrapping-for-black-box-predictions","title":"Fair Wrapping for Black-box Predictions","date":"2022-01-31","arxiv_id":"2201.12947","repositories_listed":1,"syntology":null},{"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/learning-optimal-fair-classification-trees","slug":"learning-optimal-fair-classification-trees","title":"Learning Optimal Fair Classification Trees: Trade-offs Between Interpretability, Fairness, and Accuracy","date":"2022-01-24","arxiv_id":"2201.09932","repositories_listed":1,"syntology":null},{"url":"/paper/consumer-fairness-in-recommender-systems","slug":"consumer-fairness-in-recommender-systems","title":"Consumer Fairness in Recommender Systems: Contextualizing Definitions and Mitigations","date":"2022-01-21","arxiv_id":"2201.08614","repositories_listed":1,"syntology":null},{"url":"/paper/visual-identification-of-problematic-bias-in","slug":"visual-identification-of-problematic-bias-in","title":"Visual Identification of Problematic Bias in Large Label Spaces","date":"2022-01-17","arxiv_id":"2201.06386","repositories_listed":1,"syntology":null},{"url":"/paper/blackbox-post-processing-for-multiclass","slug":"blackbox-post-processing-for-multiclass","title":"Blackbox Post-Processing for Multiclass Fairness","date":"2022-01-12","arxiv_id":"2201.04461","repositories_listed":1,"syntology":null},{"url":"/paper/fairedit-preserving-fairness-in-graph-neural","slug":"fairedit-preserving-fairness-in-graph-neural","title":"FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing","date":"2022-01-10","arxiv_id":"2201.03681","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-node-representations-with-graph","slug":"learning-fair-node-representations-with-graph","title":"Learning Fair Node Representations with Graph Counterfactual Fairness","date":"2022-01-10","arxiv_id":"2201.03662","repositories_listed":1,"syntology":null},{"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/fair-data-representation-for-machine-learning","slug":"fair-data-representation-for-machine-learning","title":"Fair Data Representation for Machine Learning at the Pareto Frontier","date":"2022-01-02","arxiv_id":"2201.00292","repositories_listed":1,"syntology":null},{"url":"/paper/self-reward-design-with-fine-grained-1","slug":"self-reward-design-with-fine-grained-1","title":"Self Reward Design with Fine-grained Interpretability","date":"2021-12-30","arxiv_id":"2112.15034","repositories_listed":1,"syntology":null},{"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/neuronfair-interpretable-white-box-fairness","slug":"neuronfair-interpretable-white-box-fairness","title":"NeuronFair: Interpretable White-Box Fairness Testing through Biased Neuron Identification","date":"2021-12-25","arxiv_id":"2112.13214","repositories_listed":1,"syntology":null},{"url":"/paper/forward-composition-propagation-for","slug":"forward-composition-propagation-for","title":"Forward Composition Propagation for Explainable Neural Reasoning","date":"2021-12-23","arxiv_id":"2112.12717","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-implicit-bias-with-fuzzy-cognitive","slug":"modeling-implicit-bias-with-fuzzy-cognitive","title":"Modeling Implicit Bias with Fuzzy Cognitive Maps","date":"2021-12-23","arxiv_id":"2112.12713","repositories_listed":1,"syntology":null},{"url":"/paper/testing-relative-fairness-in-human-decisions","slug":"testing-relative-fairness-in-human-decisions","title":"Testing Relative Fairness in Human Decisions With Machine Learning","date":"2021-12-21","arxiv_id":"2112.11279","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-and-mitigating-the-effect-of","slug":"understanding-and-mitigating-the-effect-of","title":"Understanding and Mitigating the Effect of Outliers in Fair Ranking","date":"2021-12-21","arxiv_id":"2112.11251","repositories_listed":1,"syntology":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/measuring-fairness-with-biased-rulers-a","slug":"measuring-fairness-with-biased-rulers-a","title":"Measuring Fairness with Biased Rulers: A Survey on Quantifying Biases in Pretrained Language Models","date":"2021-12-14","arxiv_id":"2112.07447","repositories_listed":1,"syntology":null},{"url":"/paper/self-paced-deep-regression-forests-with-1","slug":"self-paced-deep-regression-forests-with-1","title":"Self-Paced Deep Regression Forests with Consideration of Ranking Fairness","date":"2021-12-13","arxiv_id":"2112.06455","repositories_listed":1,"syntology":null}],"record_sha256":"d380ca5eedcdb853e3dc2058c9e65dcb388caf319f6a8f9c2d67ece9641a0d51","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}