{"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/11","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":11,"pages_in_order":57,"rows_per_page":100,"rows":[1001,1100],"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/10","next":"/task/fairness/papers/12","papers":[{"url":"/paper/scalable-infomin-learning","slug":"scalable-infomin-learning","title":"Scalable Infomin Learning","date":"2023-02-21","arxiv_id":"2302.10701","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/scalable-infomin-learning#ran","syntology_url":"https://syntology.ai/paper/2302.10701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10701"}},"official":{"repos":["cyz-ai/infomin"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/designing-equitable-algorithms","slug":"designing-equitable-algorithms","title":"Designing Equitable Algorithms","date":"2023-02-17","arxiv_id":"2302.09157","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-reasoning-for-bias-evaluation","slug":"counterfactual-reasoning-for-bias-evaluation","title":"Counterfactual Reasoning for Bias Evaluation and Detection in a Fairness under Unawareness setting","date":"2023-02-16","arxiv_id":"2302.08204","repositories_listed":1,"syntology":null},{"url":"/paper/efficiency-360-efficient-vision-transformers","slug":"efficiency-360-efficient-vision-transformers","title":"Efficiency 360: Efficient Vision Transformers","date":"2023-02-16","arxiv_id":"2302.08374","repositories_listed":1,"syntology":null},{"url":"/paper/learning-density-based-correlated-equilibria","slug":"learning-density-based-correlated-equilibria","title":"Learning Density-Based Correlated Equilibria for Markov Games","date":"2023-02-16","arxiv_id":"2302.08001","repositories_listed":1,"syntology":null},{"url":"/paper/readin-a-chinese-multi-task-benchmark-with","slug":"readin-a-chinese-multi-task-benchmark-with","title":"READIN: A Chinese Multi-Task Benchmark with Realistic and Diverse Input Noises","date":"2023-02-14","arxiv_id":"2302.07324","repositories_listed":1,"syntology":null},{"url":"/paper/when-mitigating-bias-is-unfair-a","slug":"when-mitigating-bias-is-unfair-a","title":"When mitigating bias is unfair: multiplicity and arbitrariness in algorithmic group fairness","date":"2023-02-14","arxiv_id":"2302.07185","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-smt-based-weighted-model","slug":"enhancing-smt-based-weighted-model","title":"Enhancing SMT-based Weighted Model Integration by Structure Awareness","date":"2023-02-13","arxiv_id":"2302.06188","repositories_listed":1,"syntology":null},{"url":"/paper/human-centric-multimodal-machine-learning","slug":"human-centric-multimodal-machine-learning","title":"Human-Centric Multimodal Machine Learning: Recent Advances and Testbed on AI-based Recruitment","date":"2023-02-13","arxiv_id":"2302.10908","repositories_listed":1,"syntology":null},{"url":"/paper/improving-recommendation-fairness-via-data","slug":"improving-recommendation-fairness-via-data","title":"Improving Recommendation Fairness via Data Augmentation","date":"2023-02-13","arxiv_id":"2302.06333","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-efficient-modularised-bias","slug":"parameter-efficient-modularised-bias","title":"Parameter-efficient Modularised Bias Mitigation via AdapterFusion","date":"2023-02-13","arxiv_id":"2302.06321","repositories_listed":1,"syntology":null},{"url":"/paper/on-testing-and-comparing-fair-classifiers","slug":"on-testing-and-comparing-fair-classifiers","title":"On Comparing Fair Classifiers under Data Bias","date":"2023-02-12","arxiv_id":"2302.05906","repositories_listed":1,"syntology":null},{"url":"/paper/fair-enough-standardizing-evaluation-and","slug":"fair-enough-standardizing-evaluation-and","title":"Fair Enough: Standardizing Evaluation and Model Selection for Fairness Research in NLP","date":"2023-02-11","arxiv_id":"2302.05711","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-aware-multi-view-clustering","slug":"fairness-aware-multi-view-clustering","title":"Fairness-aware Multi-view Clustering","date":"2023-02-11","arxiv_id":"2302.05788","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-vision-transformers-to-22-billion","slug":"scaling-vision-transformers-to-22-billion","title":"Scaling Vision Transformers to 22 Billion Parameters","date":"2023-02-10","arxiv_id":"2302.05442","repositories_listed":1,"syntology":null},{"url":"/paper/on-generalized-degree-fairness-in-graph","slug":"on-generalized-degree-fairness-in-graph","title":"On Generalized Degree Fairness in Graph Neural Networks","date":"2023-02-08","arxiv_id":"2302.03881","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/on-generalized-degree-fairness-in-graph#ran","syntology_url":"https://syntology.ai/paper/2302.03881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03881"}},"official":{"repos":["ntkien1904/DegFairGNN"],"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/ethical-considerations-for-collecting-human","slug":"ethical-considerations-for-collecting-human","title":"Ethical Considerations for Responsible Data Curation","date":"2023-02-07","arxiv_id":"2302.03629","repositories_listed":1,"syntology":null},{"url":"/paper/fair-diffusion-instructing-text-to-image","slug":"fair-diffusion-instructing-text-to-image","title":"Fair Diffusion: Instructing Text-to-Image Generation Models on Fairness","date":"2023-02-07","arxiv_id":"2302.10893","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fair-diffusion-instructing-text-to-image#ran","syntology_url":"https://syntology.ai/paper/2302.10893","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10893"}},"official":{"repos":["ml-research/fair-diffusion"],"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/fairness-aware-vision-transformer-via","slug":"fairness-aware-vision-transformer-via","title":"Fairness-aware Vision Transformer via Debiased Self-Attention","date":"2023-01-31","arxiv_id":"2301.13803","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-within-group-discrimination-of","slug":"on-the-within-group-discrimination-of","title":"On the Within-Group Fairness of Screening Classifiers","date":"2023-01-31","arxiv_id":"2302.00025","repositories_listed":1,"syntology":null},{"url":"/paper/retiring-d-dp-new-distribution-level-metrics","slug":"retiring-d-dp-new-distribution-level-metrics","title":"Retiring $Δ$DP: New Distribution-Level Metrics for Demographic Parity","date":"2023-01-31","arxiv_id":"2301.13443","repositories_listed":1,"syntology":null},{"url":"/paper/superhuman-fairness","slug":"superhuman-fairness","title":"Superhuman Fairness","date":"2023-01-31","arxiv_id":"2301.13420","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-and-accuracy-under-domain","slug":"fairness-and-accuracy-under-domain","title":"Fairness and Accuracy under Domain Generalization","date":"2023-01-30","arxiv_id":"2301.13323","repositories_listed":1,"syntology":null},{"url":"/paper/how-far-can-it-go-on-intrinsic-gender-bias","slug":"how-far-can-it-go-on-intrinsic-gender-bias","title":"How Far Can It Go?: On Intrinsic Gender Bias Mitigation for Text Classification","date":"2023-01-30","arxiv_id":"2301.12855","repositories_listed":1,"syntology":null},{"url":"/paper/pragmatic-fairness-developing-policies-with","slug":"pragmatic-fairness-developing-policies-with","title":"Pragmatic Fairness: Developing Policies with Outcome Disparity Control","date":"2023-01-28","arxiv_id":"2301.12278","repositories_listed":1,"syntology":null},{"url":"/paper/learning-informative-representation-for","slug":"learning-informative-representation-for","title":"Learning Informative Representation for Fairness-aware Multivariate Time-series Forecasting: A Group-based Perspective","date":"2023-01-27","arxiv_id":"2301.11535","repositories_listed":1,"syntology":null},{"url":"/paper/variance-self-consistency-and-arbitrariness","slug":"variance-self-consistency-and-arbitrariness","title":"Arbitrariness and Social Prediction: The Confounding Role of Variance in Fair Classification","date":"2023-01-27","arxiv_id":"2301.11562","repositories_listed":1,"syntology":null},{"url":"/paper/tier-balancing-towards-dynamic-fairness-over","slug":"tier-balancing-towards-dynamic-fairness-over","title":"Tier Balancing: Towards Dynamic Fairness over Underlying Causal Factors","date":"2023-01-21","arxiv_id":"2301.08987","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-is-power-understanding-is-impact","slug":"knowledge-is-power-understanding-is-impact","title":"Knowledge is Power, Understanding is Impact: Utility and Beyond Goals, Explanation Quality, and Fairness in Path Reasoning Recommendation","date":"2023-01-14","arxiv_id":"2301.05944","repositories_listed":1,"syntology":null},{"url":"/paper/ironforge-an-open-secure-fair-decentralized","slug":"ironforge-an-open-secure-fair-decentralized","title":"IronForge: An Open, Secure, Fair, Decentralized Federated Learning","date":"2023-01-07","arxiv_id":"2301.04006","repositories_listed":1,"syntology":null},{"url":"/paper/reliant-fair-knowledge-distillation-for-graph","slug":"reliant-fair-knowledge-distillation-for-graph","title":"RELIANT: Fair Knowledge Distillation for Graph Neural Networks","date":"2023-01-03","arxiv_id":"2301.01150","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/reliant-fair-knowledge-distillation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2301.01150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.01150"}},"official":{"repos":["yushundong/reliant"],"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-scratch-tickets-finding-fair-sparse","slug":"fair-scratch-tickets-finding-fair-sparse","title":"Fair Scratch Tickets: Finding Fair Sparse Networks Without Weight Training","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/federated-domain-generalization-with","slug":"federated-domain-generalization-with","title":"Federated Domain Generalization With Generalization Adjustment","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explainable-ai-for-bioinformatics-methods","slug":"explainable-ai-for-bioinformatics-methods","title":"Explainable AI for Bioinformatics: Methods, Tools, and Applications","date":"2022-12-25","arxiv_id":"2212.13261","repositories_listed":1,"syntology":null},{"url":"/paper/crab-learning-certifiably-fair-predictive","slug":"crab-learning-certifiably-fair-predictive","title":"Consistent Range Approximation for Fair Predictive Modeling","date":"2022-12-21","arxiv_id":"2212.10839","repositories_listed":1,"syntology":null},{"url":"/paper/human-guided-fair-classification-for-natural","slug":"human-guided-fair-classification-for-natural","title":"Human-Guided Fair Classification for Natural Language Processing","date":"2022-12-20","arxiv_id":"2212.10154","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/human-guided-fair-classification-for-natural#ran","syntology_url":"https://syntology.ai/paper/2212.10154","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10154"}},"official":{"repos":["eth-sri/fairness-feedback-nlp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-conditionally-invariant","slug":"efficient-conditionally-invariant","title":"Efficient Conditionally Invariant Representation Learning","date":"2022-12-16","arxiv_id":"2212.08645","repositories_listed":1,"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/efficient-conditionally-invariant#ran","syntology_url":"https://syntology.ai/paper/2212.08645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08645"}},"official":{"repos":["namratadeka/circe"],"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/ai-ethics-on-blockchain-topic-analysis-on","slug":"ai-ethics-on-blockchain-topic-analysis-on","title":"AI Ethics on Blockchain: Topic Analysis on Twitter Data for Blockchain Security","date":"2022-12-14","arxiv_id":"2212.06951","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-tree-structured-parzen","slug":"multi-objective-tree-structured-parzen","title":"Speeding Up Multi-Objective Hyperparameter Optimization by Task Similarity-Based Meta-Learning for the Tree-Structured Parzen Estimator","date":"2022-12-13","arxiv_id":"2212.06751","repositories_listed":1,"syntology":null},{"url":"/paper/fairify-fairness-verification-of-neural","slug":"fairify-fairness-verification-of-neural","title":"Fairify: Fairness Verification of Neural Networks","date":"2022-12-08","arxiv_id":"2212.06140","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 5 unverified","sample_list":"/paper/fairify-fairness-verification-of-neural#ran","syntology_url":"https://syntology.ai/paper/2212.06140","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.06140"}},"official":{"repos":["sumonbis/farify"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":[]}}},{"url":"/paper/towards-understanding-fairness-and-its","slug":"towards-understanding-fairness-and-its","title":"Towards Understanding Fairness and its Composition in Ensemble Machine Learning","date":"2022-12-08","arxiv_id":"2212.04593","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/towards-understanding-fairness-and-its#ran","syntology_url":"https://syntology.ai/paper/2212.04593","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04593"}},"official":{"repos":["usmangohar/fairensemble"],"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/fairness-and-explainability-bridging-the-gap","slug":"fairness-and-explainability-bridging-the-gap","title":"Fairness and Explainability: Bridging the Gap Towards Fair Model Explanations","date":"2022-12-07","arxiv_id":"2212.03840","repositories_listed":1,"syntology":null},{"url":"/paper/certifying-fairness-of-probabilistic-circuits","slug":"certifying-fairness-of-probabilistic-circuits","title":"Certifying Fairness of Probabilistic Circuits","date":"2022-12-05","arxiv_id":"2212.02474","repositories_listed":1,"syntology":null},{"url":"/paper/towards-robust-nlg-bias-evaluation-with","slug":"towards-robust-nlg-bias-evaluation-with","title":"Towards Robust NLG Bias Evaluation with Syntactically-diverse Prompts","date":"2022-12-03","arxiv_id":"2212.01700","repositories_listed":1,"syntology":null},{"url":"/paper/fair-generative-models-via-transfer-learning","slug":"fair-generative-models-via-transfer-learning","title":"Fair Generative Models via Transfer Learning","date":"2022-12-02","arxiv_id":"2212.00926","repositories_listed":1,"syntology":null},{"url":"/paper/probably-approximate-shapley-fairness-with","slug":"probably-approximate-shapley-fairness-with","title":"Probably Approximate Shapley Fairness with Applications in Machine Learning","date":"2022-12-01","arxiv_id":"2212.00630","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/probably-approximate-shapley-fairness-with#ran","syntology_url":"https://syntology.ai/paper/2212.00630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.00630"}},"official":{"repos":["BobbyZhouZijian/ProbablyApproximateShapleyFairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-ranking-with-noisy-protected-attributes","slug":"fair-ranking-with-noisy-protected-attributes","title":"Fair Ranking with Noisy Protected Attributes","date":"2022-11-30","arxiv_id":"2211.17067","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-ranking-with-noisy-protected-attributes#ran","syntology_url":"https://syntology.ai/paper/2211.17067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.17067"}},"official":{"repos":["anaymehrotra/fairrankingwithnoisyattributes"],"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/welfare-and-fairness-in-multi-objective","slug":"welfare-and-fairness-in-multi-objective","title":"Welfare and Fairness in Multi-objective Reinforcement Learning","date":"2022-11-30","arxiv_id":"2212.01382","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/welfare-and-fairness-in-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2212.01382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.01382"}},"official":{"repos":["MuhangTian/Fair-MORL-AAMAS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fairee-fair-classification-with-finite-sample","slug":"fairee-fair-classification-with-finite-sample","title":"FaiREE: Fair Classification with Finite-Sample and Distribution-Free Guarantee","date":"2022-11-28","arxiv_id":"2211.15072","repositories_listed":1,"syntology":null},{"url":"/paper/mixfairface-towards-ultimate-fairness-via","slug":"mixfairface-towards-ultimate-fairness-via","title":"MixFairFace: Towards Ultimate Fairness via MixFair Adapter in Face Recognition","date":"2022-11-28","arxiv_id":"2211.15181","repositories_listed":1,"syntology":null},{"url":"/paper/explain-it-in-the-same-way-model-agnostic","slug":"explain-it-in-the-same-way-model-agnostic","title":"\"Explain it in the Same Way!\" -- Model-Agnostic Group Fairness of Counterfactual Explanations","date":"2022-11-27","arxiv_id":"2211.14858","repositories_listed":1,"syntology":null},{"url":"/paper/incentive-aware-recommender-systems-in-two","slug":"incentive-aware-recommender-systems-in-two","title":"Incentive-Aware Recommender Systems in Two-Sided Markets","date":"2022-11-23","arxiv_id":"2211.15381","repositories_listed":1,"syntology":null},{"url":"/paper/subgroup-robustness-grows-on-trees-an","slug":"subgroup-robustness-grows-on-trees-an","title":"Subgroup Robustness Grows On Trees: An Empirical Baseline Investigation","date":"2022-11-23","arxiv_id":"2211.12703","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":3,"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/subgroup-robustness-grows-on-trees-an#ran","syntology_url":"https://syntology.ai/paper/2211.12703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.12703"}},"official":{"repos":["jpgard/subgroup-robustness-grows-on-trees"],"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/bursting-the-burden-bubble-an-assessment-of","slug":"bursting-the-burden-bubble-an-assessment-of","title":"Bursting the Burden Bubble? An Assessment of Sharma et al.'s Counterfactual-based Fairness Metric","date":"2022-11-21","arxiv_id":"2211.11512","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-on-a-healthy-data-diet-finding","slug":"deep-learning-on-a-healthy-data-diet-finding","title":"Deep Learning on a Healthy Data Diet: Finding Important Examples for Fairness","date":"2022-11-20","arxiv_id":"2211.11109","repositories_listed":1,"syntology":null},{"url":"/paper/a-fair-loss-function-for-network-pruning","slug":"a-fair-loss-function-for-network-pruning","title":"A Fair Loss Function for Network Pruning","date":"2022-11-18","arxiv_id":"2211.10285","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":5,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":12,"phrase":"8 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-fair-loss-function-for-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2211.10285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.10285"}},"official":{"repos":["robbiemeyer/pw_loss_pruning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/distributionally-robust-survival-analysis-a","slug":"distributionally-robust-survival-analysis-a","title":"Distributionally Robust Survival Analysis: A Novel Fairness Loss Without Demographics","date":"2022-11-18","arxiv_id":"2211.10508","repositories_listed":1,"syntology":null},{"url":"/paper/fairmile-a-multi-level-framework-for-fair-and","slug":"fairmile-a-multi-level-framework-for-fair-and","title":"FairMILE: Towards an Efficient Framework for Fair Graph Representation Learning","date":"2022-11-17","arxiv_id":"2211.09925","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairmile-a-multi-level-framework-for-fair-and#ran","syntology_url":"https://syntology.ai/paper/2211.09925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09925"}},"official":{"repos":["heyuntian/fairmile"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-contrastive-pre-training-for-geographic","slug":"fair-contrastive-pre-training-for-geographic","title":"Mitigating Urban-Rural Disparities in Contrastive Representation Learning with Satellite Imagery","date":"2022-11-16","arxiv_id":"2211.08672","repositories_listed":1,"syntology":null},{"url":"/paper/dark-patterns-in-e-commerce-a-dataset-and-its","slug":"dark-patterns-in-e-commerce-a-dataset-and-its","title":"Dark patterns in e-commerce: a dataset and its baseline evaluations","date":"2022-11-12","arxiv_id":"2211.06543","repositories_listed":1,"syntology":null},{"url":"/paper/rise-robust-individualized-decision-learning","slug":"rise-robust-individualized-decision-learning","title":"RISE: Robust Individualized Decision Learning with Sensitive Variables","date":"2022-11-12","arxiv_id":"2211.06569","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/rise-robust-individualized-decision-learning#ran","syntology_url":"https://syntology.ai/paper/2211.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06569"}},"official":{"repos":["ellenxtan/rise"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-and-bias-correction-in-machine","slug":"fairness-and-bias-correction-in-machine","title":"Fairness and bias correction in machine learning for depression prediction: results from four study populations","date":"2022-11-10","arxiv_id":"2211.05321","repositories_listed":1,"syntology":null},{"url":"/paper/nano-nested-human-in-the-loop-reward-learning","slug":"nano-nested-human-in-the-loop-reward-learning","title":"Nano: Nested Human-in-the-Loop Reward Learning for Few-shot Language Model Control","date":"2022-11-10","arxiv_id":"2211.05750","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-fairness-disparities-in-peer","slug":"investigating-fairness-disparities-in-peer","title":"Investigating Fairness Disparities in Peer Review: A Language Model Enhanced Approach","date":"2022-11-07","arxiv_id":"2211.06398","repositories_listed":1,"syntology":null},{"url":"/paper/herb-measuring-hierarchical-regional-bias-in","slug":"herb-measuring-hierarchical-regional-bias-in","title":"HERB: Measuring Hierarchical Regional Bias in Pre-trained Language Models","date":"2022-11-05","arxiv_id":"2211.02882","repositories_listed":1,"syntology":null},{"url":"/paper/fair-and-optimal-classification-via","slug":"fair-and-optimal-classification-via","title":"Fair and Optimal Classification via Post-Processing","date":"2022-11-03","arxiv_id":"2211.01528","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/fair-and-optimal-classification-via#ran","syntology_url":"https://syntology.ai/paper/2211.01528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01528"}},"official":{"repos":["rxian/fair-classification"],"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/balancing-utility-and-fairness-in-submodular","slug":"balancing-utility-and-fairness-in-submodular","title":"Balancing Utility and Fairness in Submodular Maximization (Technical Report)","date":"2022-11-02","arxiv_id":"2211.00980","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-without-demographics-through-1","slug":"fairness-without-demographics-through-1","title":"Fairness without Demographics through Knowledge Distillation","date":"2022-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/impact-of-missing-data-imputation-on-the","slug":"impact-of-missing-data-imputation-on-the","title":"Impact Of Missing Data Imputation On The Fairness And Accuracy Of Graph Node Classifiers","date":"2022-11-01","arxiv_id":"2211.00783","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-and-improving-robustness-of","slug":"rethinking-and-improving-robustness-of","title":"Rethinking and Improving Robustness of Convolutional Neural Networks: a Shapley Value-based Approach in Frequency Domain","date":"2022-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-fairness-in-image-classification","slug":"improving-fairness-in-image-classification","title":"Improving Fairness in Image Classification via Sketching","date":"2022-10-31","arxiv_id":"2211.00168","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-unfairness-via-evolutionary-multi","slug":"mitigating-unfairness-via-evolutionary-multi","title":"Mitigating Unfairness via Evolutionary Multi-objective Ensemble Learning","date":"2022-10-30","arxiv_id":"2210.16754","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-certificates-for-differentially","slug":"fairness-certificates-for-differentially","title":"Differential Privacy has Bounded Impact on Fairness in Classification","date":"2022-10-28","arxiv_id":"2210.16242","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fairness-certificates-for-differentially#ran","syntology_url":"https://syntology.ai/paper/2210.16242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16242"}},"official":{"repos":["pmangold/fairness-privacy"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-spectral-clustering-with-group","slug":"scalable-spectral-clustering-with-group","title":"Scalable Spectral Clustering with Group Fairness Constraints","date":"2022-10-28","arxiv_id":"2210.16435","repositories_listed":1,"syntology":null},{"url":"/paper/private-and-reliable-neural-network-inference","slug":"private-and-reliable-neural-network-inference","title":"Private and Reliable Neural Network Inference","date":"2022-10-27","arxiv_id":"2210.15614","repositories_listed":1,"syntology":null},{"url":"/paper/i-prefer-not-to-say-operationalizing-fair-and","slug":"i-prefer-not-to-say-operationalizing-fair-and","title":"I Prefer not to Say: Protecting User Consent in Models with Optional Personal Data","date":"2022-10-25","arxiv_id":"2210.13954","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/i-prefer-not-to-say-operationalizing-fair-and#ran","syntology_url":"https://syntology.ai/paper/2210.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13954"}},"official":{"repos":["tleemann/protectedconsent"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mitigating-gender-bias-in-face-recognition","slug":"mitigating-gender-bias-in-face-recognition","title":"Mitigating Gender Bias in Face Recognition Using the von Mises-Fisher Mixture Model","date":"2022-10-24","arxiv_id":"2210.13664","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mitigating-gender-bias-in-face-recognition#ran","syntology_url":"https://syntology.ai/paper/2210.13664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13664"}},"official":{"repos":["JRConti/EthicalModule_vMF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-demand-sampling-learning-optimally-from","slug":"on-demand-sampling-learning-optimally-from","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","date":"2022-10-22","arxiv_id":"2210.12529","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-demand-sampling-learning-optimally-from#ran","syntology_url":"https://syntology.ai/paper/2210.12529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12529"}},"official":{"repos":["ericzhao28/multidistributionlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/policy-optimization-with-advantage","slug":"policy-optimization-with-advantage","title":"Policy Optimization with Advantage Regularization for Long-Term Fairness in Decision Systems","date":"2022-10-22","arxiv_id":"2210.12546","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/policy-optimization-with-advantage#ran","syntology_url":"https://syntology.ai/paper/2210.12546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12546"}},"official":{"repos":["ericyangyu/pocar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-survey-on-graph-counterfactual-explanations","slug":"a-survey-on-graph-counterfactual-explanations","title":"A Survey on Graph Counterfactual Explanations: Definitions, Methods, Evaluation, and Research Challenges","date":"2022-10-21","arxiv_id":"2210.12089","repositories_listed":1,"syntology":null},{"url":"/paper/towards-human-centered-explainable-ai-user","slug":"towards-human-centered-explainable-ai-user","title":"Towards Human-centered Explainable AI: A Survey of User Studies for Model Explanations","date":"2022-10-20","arxiv_id":"2210.11584","repositories_listed":1,"syntology":null},{"url":"/paper/group-fairness-in-prediction-based-decision","slug":"group-fairness-in-prediction-based-decision","title":"Group Fairness in Prediction-Based Decision Making: From Moral Assessment to Implementation","date":"2022-10-19","arxiv_id":"2210.10456","repositories_listed":1,"syntology":null},{"url":"/paper/on-learning-fairness-and-accuracy-on-multiple","slug":"on-learning-fairness-and-accuracy-on-multiple","title":"On Learning Fairness and Accuracy on Multiple Subgroups","date":"2022-10-19","arxiv_id":"2210.10837","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-learning-fairness-and-accuracy-on-multiple#ran","syntology_url":"https://syntology.ai/paper/2210.10837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10837"}},"official":{"repos":["xugezheng/fams"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-procedural-fairness-uncovering-biases","slug":"towards-procedural-fairness-uncovering-biases","title":"Towards Procedural Fairness: Uncovering Biases in How a Toxic Language Classifier Uses Sentiment Information","date":"2022-10-19","arxiv_id":"2210.10689","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-multiclass-algorithms-for-complex","slug":"consistent-multiclass-algorithms-for-complex","title":"Consistent Multiclass Algorithms for Complex Metrics and Constraints","date":"2022-10-18","arxiv_id":"2210.09695","repositories_listed":1,"syntology":null},{"url":"/paper/prompting-gpt-3-to-be-reliable","slug":"prompting-gpt-3-to-be-reliable","title":"Prompting GPT-3 To Be Reliable","date":"2022-10-17","arxiv_id":"2210.09150","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-differentially-private-and-fair","slug":"stochastic-differentially-private-and-fair","title":"Stochastic Differentially Private and Fair Learning","date":"2022-10-17","arxiv_id":"2210.08781","repositories_listed":1,"syntology":null},{"url":"/paper/systematic-evaluation-of-predictive-fairness","slug":"systematic-evaluation-of-predictive-fairness","title":"Systematic Evaluation of Predictive Fairness","date":"2022-10-17","arxiv_id":"2210.08758","repositories_listed":1,"syntology":null},{"url":"/paper/bertscore-is-unfair-on-social-bias-in","slug":"bertscore-is-unfair-on-social-bias-in","title":"BERTScore is Unfair: On Social Bias in Language Model-Based Metrics for Text Generation","date":"2022-10-14","arxiv_id":"2210.07626","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bertscore-is-unfair-on-social-bias-in#ran","syntology_url":"https://syntology.ai/paper/2210.07626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07626"}},"official":{"repos":["txsun1997/metric-fairness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/equal-improvability-a-new-fairness-notion","slug":"equal-improvability-a-new-fairness-notion","title":"Equal Improvability: A New Fairness Notion Considering the Long-term Impact","date":"2022-10-13","arxiv_id":"2210.06732","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/equal-improvability-a-new-fairness-notion#ran","syntology_url":"https://syntology.ai/paper/2210.06732","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06732"}},"official":{"repos":["guldoganozgur/ei_fairness"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fare-provably-fair-representation-learning","slug":"fare-provably-fair-representation-learning","title":"FARE: Provably Fair Representation Learning with Practical Certificates","date":"2022-10-13","arxiv_id":"2210.07213","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fare-provably-fair-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2210.07213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07213"}},"official":{"repos":["eth-sri/fare"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/equal-experience-in-recommender-systems-1","slug":"equal-experience-in-recommender-systems-1","title":"Equal Experience in Recommender Systems","date":"2022-10-12","arxiv_id":"2210.05936","repositories_listed":1,"syntology":null},{"url":"/paper/sampling-in-constrained-domains-with","slug":"sampling-in-constrained-domains-with","title":"Sampling in Constrained Domains with Orthogonal-Space Variational Gradient Descent","date":"2022-10-12","arxiv_id":"2210.06447","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sampling-in-constrained-domains-with#ran","syntology_url":"https://syntology.ai/paper/2210.06447","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06447"}},"official":{"repos":["ruqizhang/o-gradient"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/are-pretrained-multilingual-models-equally-1","slug":"are-pretrained-multilingual-models-equally-1","title":"Are Pretrained Multilingual Models Equally Fair Across Languages?","date":"2022-10-11","arxiv_id":"2210.05457","repositories_listed":1,"syntology":null},{"url":"/paper/deepmed-semiparametric-causal-mediation","slug":"deepmed-semiparametric-causal-mediation","title":"DeepMed: Semiparametric Causal Mediation Analysis with Debiased Deep Learning","date":"2022-10-10","arxiv_id":"2210.04389","repositories_listed":1,"syntology":null},{"url":"/paper/montague-semantics-and-modifier-consistency","slug":"montague-semantics-and-modifier-consistency","title":"Montague semantics and modifier consistency measurement in neural language models","date":"2022-10-10","arxiv_id":"2212.04310","repositories_listed":1,"syntology":null},{"url":"/paper/a-differentiable-distance-approximation-for","slug":"a-differentiable-distance-approximation-for","title":"A Differentiable Distance Approximation for Fairer Image Classification","date":"2022-10-09","arxiv_id":"2210.04369","repositories_listed":1,"syntology":null},{"url":"/paper/augmentations-in-hypergraph-contrastive","slug":"augmentations-in-hypergraph-contrastive","title":"Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative","date":"2022-10-07","arxiv_id":"2210.03801","repositories_listed":1,"syntology":null},{"url":"/paper/tcnl-transparent-and-controllable-network","slug":"tcnl-transparent-and-controllable-network","title":"TCNL: Transparent and Controllable Network Learning Via Embedding Human-Guided Concepts","date":"2022-10-07","arxiv_id":"2210.03274","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-fairness-without-sensitive","slug":"evaluating-fairness-without-sensitive","title":"Weak Proxies are Sufficient and Preferable for Fairness with Missing Sensitive Attributes","date":"2022-10-06","arxiv_id":"2210.03175","repositories_listed":1,"syntology":null}],"record_sha256":"c2efd5601caa68941897a9836936e0bd64604558d96192c27d8ae93736b20151","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}