{"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/12","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":12,"pages_in_order":57,"rows_per_page":100,"rows":[1101,1200],"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/11","next":"/task/fairness/papers/13","papers":[{"url":"/paper/uncovering-the-structural-fairness-in-graph","slug":"uncovering-the-structural-fairness-in-graph","title":"Uncovering the Structural Fairness in Graph Contrastive Learning","date":"2022-10-06","arxiv_id":"2210.03011","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uncovering-the-structural-fairness-in-graph#ran","syntology_url":"https://syntology.ai/paper/2210.03011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03011"}},"official":null}},{"url":"/paper/conformalized-fairness-via-quantile","slug":"conformalized-fairness-via-quantile","title":"Conformalized Fairness via Quantile Regression","date":"2022-10-05","arxiv_id":"2210.02015","repositories_listed":1,"syntology":null},{"url":"/paper/robust-fair-clustering-a-novel-fairness","slug":"robust-fair-clustering-a-novel-fairness","title":"Robust Fair Clustering: A Novel Fairness Attack and Defense Framework","date":"2022-10-04","arxiv_id":"2210.01953","repositories_listed":1,"syntology":null},{"url":"/paper/gantouch-an-attack-resilient-framework-for","slug":"gantouch-an-attack-resilient-framework-for","title":"GANTouch: An Attack-Resilient Framework for Touch-based Continuous Authentication System","date":"2022-10-02","arxiv_id":"2210.01594","repositories_listed":1,"syntology":null},{"url":"/paper/bigger-data-or-fairer-data-augmenting-bert","slug":"bigger-data-or-fairer-data-augmenting-bert","title":"Bigger Data or Fairer Data? Augmenting BERT via Active Sampling for Educational Text Classification","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/variable-based-calibration-for-machine","slug":"variable-based-calibration-for-machine","title":"Variable-Based Calibration for Machine Learning Classifiers","date":"2022-09-30","arxiv_id":"2209.15154","repositories_listed":1,"syntology":null},{"url":"/paper/proportional-multicalibration","slug":"proportional-multicalibration","title":"Fair admission risk prediction with proportional multicalibration","date":"2022-09-29","arxiv_id":"2209.14613","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-global-fairness-verification-of","slug":"explainable-global-fairness-verification-of","title":"Explainable Global Fairness Verification of Tree-Based Classifiers","date":"2022-09-27","arxiv_id":"2209.13179","repositories_listed":1,"syntology":null},{"url":"/paper/fair-fate-fair-federated-learning-with","slug":"fair-fate-fair-federated-learning-with","title":"FAIR-FATE: Fair Federated Learning with Momentum","date":"2022-09-27","arxiv_id":"2209.13678","repositories_listed":1,"syntology":null},{"url":"/paper/deep-fair-clustering-via-maximizing-and","slug":"deep-fair-clustering-via-maximizing-and","title":"Deep Fair Clustering via Maximizing and Minimizing Mutual Information: Theory, Algorithm and Metric","date":"2022-09-26","arxiv_id":"2209.12396","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-fair-clustering-via-maximizing-and#ran","syntology_url":"https://syntology.ai/paper/2209.12396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12396"}},"official":{"repos":["PengxinZeng/2023-CVPR-FCMI"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/re-contextualizing-fairness-in-nlp-the-case","slug":"re-contextualizing-fairness-in-nlp-the-case","title":"Re-contextualizing Fairness in NLP: The Case of India","date":"2022-09-25","arxiv_id":"2209.12226","repositories_listed":1,"syntology":null},{"url":"/paper/scales-from-fairness-principles-to","slug":"scales-from-fairness-principles-to","title":"SCALES: From Fairness Principles to Constrained Decision-Making","date":"2022-09-22","arxiv_id":"2209.10860","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-reprogramming","slug":"fairness-reprogramming","title":"Fairness Reprogramming","date":"2022-09-21","arxiv_id":"2209.10222","repositories_listed":1,"syntology":null},{"url":"/paper/fal-cur-fair-active-learning-using","slug":"fal-cur-fair-active-learning-using","title":"FAL-CUR: Fair Active Learning using Uncertainty and Representativeness on Fair Clustering","date":"2022-09-21","arxiv_id":"2209.12756","repositories_listed":1,"syntology":null},{"url":"/paper/closing-the-gender-wage-gap-adversarial","slug":"closing-the-gender-wage-gap-adversarial","title":"Closing the Gender Wage Gap: Adversarial Fairness in Job Recommendation","date":"2022-09-20","arxiv_id":"2209.09592","repositories_listed":1,"syntology":null},{"url":"/paper/high-resolution-synthesis-of-high-density","slug":"high-resolution-synthesis-of-high-density","title":"High-resolution synthesis of high-density breast mammograms: Application to improved fairness in deep learning based mass detection","date":"2022-09-20","arxiv_id":"2209.09809","repositories_listed":1,"syntology":null},{"url":"/paper/measuring-interventional-robustness-in","slug":"measuring-interventional-robustness-in","title":"Measuring Interventional Robustness in Reinforcement Learning","date":"2022-09-19","arxiv_id":"2209.09058","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-knowledge-graph-evaluation-under","slug":"rethinking-knowledge-graph-evaluation-under","title":"Rethinking Knowledge Graph Evaluation Under the Open-World Assumption","date":"2022-09-19","arxiv_id":"2209.08858","repositories_listed":1,"syntology":null},{"url":"/paper/fairgbm-gradient-boosting-with-fairness","slug":"fairgbm-gradient-boosting-with-fairness","title":"FairGBM: Gradient Boosting with Fairness Constraints","date":"2022-09-16","arxiv_id":"2209.07850","repositories_listed":1,"syntology":null},{"url":"/paper/imdrug-a-benchmark-for-deep-imbalanced","slug":"imdrug-a-benchmark-for-deep-imbalanced","title":"ImDrug: A Benchmark for Deep Imbalanced Learning in AI-aided Drug Discovery","date":"2022-09-16","arxiv_id":"2209.07921","repositories_listed":1,"syntology":null},{"url":"/paper/iflipper-label-flipping-for-individual","slug":"iflipper-label-flipping-for-individual","title":"iFlipper: Label Flipping for Individual Fairness","date":"2022-09-15","arxiv_id":"2209.07047","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-inter-group-link-injection","slug":"adversarial-inter-group-link-injection","title":"Adversarial Inter-Group Link Injection Degrades the Fairness of Graph Neural Networks","date":"2022-09-13","arxiv_id":"2209.05957","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-bias-with-a-synthetic-data","slug":"investigating-bias-with-a-synthetic-data","title":"Investigating Bias with a Synthetic Data Generator: Empirical Evidence and Philosophical Interpretation","date":"2022-09-13","arxiv_id":"2209.05889","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-in-forecasting-of-observations-of","slug":"fairness-in-forecasting-of-observations-of","title":"Fairness in Forecasting of Observations of Linear Dynamical Systems","date":"2022-09-12","arxiv_id":"2209.05274","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-the-effect-of-sampling-in-gnns-on","slug":"analyzing-the-effect-of-sampling-in-gnns-on","title":"Analyzing the Effect of Sampling in GNNs on Individual Fairness","date":"2022-09-08","arxiv_id":"2209.03904","repositories_listed":1,"syntology":null},{"url":"/paper/decoding-demographic-un-fairness-from-indian","slug":"decoding-demographic-un-fairness-from-indian","title":"Decoding Demographic un-fairness from Indian Names","date":"2022-09-07","arxiv_id":"2209.03089","repositories_listed":1,"syntology":null},{"url":"/paper/power-of-explanations-towards-automatic","slug":"power-of-explanations-towards-automatic","title":"Power of Explanations: Towards automatic debiasing in hate speech detection","date":"2022-09-07","arxiv_id":"2209.09975","repositories_listed":1,"syntology":null},{"url":"/paper/circle-color-invariant-representation","slug":"circle-color-invariant-representation","title":"CIRCLe: Color Invariant Representation Learning for Unbiased Classification of Skin Lesions","date":"2022-08-29","arxiv_id":"2208.13528","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/circle-color-invariant-representation#ran","syntology_url":"https://syntology.ai/paper/2208.13528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.13528"}},"official":{"repos":["arezou-pakzad/circle"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/towards-explaining-demographic-bias-through","slug":"towards-explaining-demographic-bias-through","title":"Towards Explaining Demographic Bias through the Eyes of Face Recognition Models","date":"2022-08-29","arxiv_id":"2208.13400","repositories_listed":1,"syntology":null},{"url":"/paper/on-gans-perpetuating-biases-for-face","slug":"on-gans-perpetuating-biases-for-face","title":"On Biased Behavior of GANs for Face Verification","date":"2022-08-27","arxiv_id":"2208.13061","repositories_listed":1,"syntology":null},{"url":"/paper/lucid-exposing-algorithmic-bias-through","slug":"lucid-exposing-algorithmic-bias-through","title":"LUCID: Exposing Algorithmic Bias through Inverse Design","date":"2022-08-26","arxiv_id":"2208.12786","repositories_listed":1,"syntology":null},{"url":"/paper/sustaining-fairness-via-incremental-learning","slug":"sustaining-fairness-via-incremental-learning","title":"Sustaining Fairness via Incremental Learning","date":"2022-08-25","arxiv_id":"2208.12212","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-approach-for-fair-principal-component","slug":"a-novel-approach-for-fair-principal-component","title":"A novel approach for Fair Principal Component Analysis based on eigendecomposition","date":"2022-08-24","arxiv_id":"2208.11362","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-detection-of-faults-in-race-walking","slug":"automatic-detection-of-faults-in-race-walking","title":"Automatic detection of faults in race walking from a smartphone camera: a comparison of an Olympic medalist and university athletes","date":"2022-08-24","arxiv_id":"2208.12646","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-bias-in-deep-face-recognition-via","slug":"explaining-bias-in-deep-face-recognition-via","title":"Explaining Bias in Deep Face Recognition via Image Characteristics","date":"2022-08-23","arxiv_id":"2208.11099","repositories_listed":1,"syntology":null},{"url":"/paper/shapelet-based-counterfactual-explanations","slug":"shapelet-based-counterfactual-explanations","title":"Shapelet-Based Counterfactual Explanations for Multivariate Time Series","date":"2022-08-22","arxiv_id":"2208.10462","repositories_listed":1,"syntology":null},{"url":"/paper/bipartite-matchings-with-group-fairness-and","slug":"bipartite-matchings-with-group-fairness-and","title":"Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All","date":"2022-08-21","arxiv_id":"2208.09951","repositories_listed":1,"syntology":null},{"url":"/paper/imputation-strategies-under-clinical-presence","slug":"imputation-strategies-under-clinical-presence","title":"Imputation Strategies Under Clinical Presence: Impact on Algorithmic Fairness","date":"2022-08-13","arxiv_id":"2208.06648","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/imputation-strategies-under-clinical-presence#ran","syntology_url":"https://syntology.ai/paper/2208.06648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.06648"}},"official":{"repos":["jeanselme/clinicalpresencefairness"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/locating-disparities-in-machine-learning","slug":"locating-disparities-in-machine-learning","title":"Locating disparities in machine learning","date":"2022-08-13","arxiv_id":"2208.06680","repositories_listed":1,"syntology":null},{"url":"/paper/rudi-explaining-behavior-sequence-models-by","slug":"rudi-explaining-behavior-sequence-models-by","title":"RuDi: Explaining Behavior Sequence Models by Automatic Statistics Generation and Rule Distillation","date":"2022-08-12","arxiv_id":"2208.07211","repositories_listed":1,"syntology":null},{"url":"/paper/eafl-towards-energy-aware-federated-learning","slug":"eafl-towards-energy-aware-federated-learning","title":"Towards Energy-Aware Federated Learning on Battery-Powered Clients","date":"2022-08-09","arxiv_id":"2208.04505","repositories_listed":1,"syntology":null},{"url":"/paper/streaming-algorithms-for-diversity","slug":"streaming-algorithms-for-diversity","title":"Streaming Algorithms for Diversity Maximization with Fairness Constraints","date":"2022-07-30","arxiv_id":"2208.00194","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-deep-chest-x-ray-classifiers-using","slug":"debiasing-deep-chest-x-ray-classifiers-using","title":"Debiasing Deep Chest X-Ray Classifiers using Intra- and Post-processing Methods","date":"2022-07-26","arxiv_id":"2208.00781","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-the-impact-of-temporal-bias-in","slug":"exploring-the-impact-of-temporal-bias-in","title":"Exploring the Impact of Temporal Bias in Point-of-Interest Recommendation","date":"2022-07-23","arxiv_id":"2207.11609","repositories_listed":1,"syntology":null},{"url":"/paper/handling-data-heterogeneity-in-federated","slug":"handling-data-heterogeneity-in-federated","title":"Handling Data Heterogeneity in Federated Learning via Knowledge Distillation and Fusion","date":"2022-07-23","arxiv_id":"2207.11447","repositories_listed":1,"syntology":null},{"url":"/paper/fairgrape-fairness-aware-gradient-pruning","slug":"fairgrape-fairness-aware-gradient-pruning","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","date":"2022-07-22","arxiv_id":"2207.10888","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fairgrape-fairness-aware-gradient-pruning#ran","syntology_url":"https://syntology.ai/paper/2207.10888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10888"}},"official":{"repos":["bernardo1998/fairgrape"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/verifying-fairness-in-quantum-machine","slug":"verifying-fairness-in-quantum-machine","title":"Verifying Fairness in Quantum Machine Learning","date":"2022-07-22","arxiv_id":"2207.11173","repositories_listed":1,"syntology":null},{"url":"/paper/gbdf-gender-balanced-deepfake-dataset-towards","slug":"gbdf-gender-balanced-deepfake-dataset-towards","title":"GBDF: Gender Balanced DeepFake Dataset Towards Fair DeepFake Detection","date":"2022-07-21","arxiv_id":"2207.10246","repositories_listed":1,"syntology":null},{"url":"/paper/mani-rank-multiple-attribute-and","slug":"mani-rank-multiple-attribute-and","title":"MANI-Rank: Multiple Attribute and Intersectional Group Fairness for Consensus Ranking","date":"2022-07-20","arxiv_id":"2207.10020","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-algorithmic-bias-with-limited","slug":"mitigating-algorithmic-bias-with-limited","title":"Mitigating Algorithmic Bias with Limited Annotations","date":"2022-07-20","arxiv_id":"2207.10018","repositories_listed":1,"syntology":null},{"url":"/paper/from-shapley-back-to-pearson-hypothesis","slug":"from-shapley-back-to-pearson-hypothesis","title":"SHAP-XRT: The Shapley Value Meets Conditional Independence Testing","date":"2022-07-14","arxiv_id":"2207.07038","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-holistic-view-of-bias-in-machine","slug":"towards-a-holistic-view-of-bias-in-machine","title":"Towards A Holistic View of Bias in Machine Learning: Bridging Algorithmic Fairness and Imbalanced Learning","date":"2022-07-13","arxiv_id":"2207.06084","repositories_listed":1,"syntology":null},{"url":"/paper/bottlenecks-club-unifying-information","slug":"bottlenecks-club-unifying-information","title":"Bottlenecks CLUB: Unifying Information-Theoretic Trade-offs Among Complexity, Leakage, and Utility","date":"2022-07-11","arxiv_id":"2207.04895","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bottlenecks-club-unifying-information#ran","syntology_url":"https://syntology.ai/paper/2207.04895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.04895"}},"official":{"repos":["BehroozRazeghi/CLUB"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/how-robust-is-your-fair-model-exploring-the","slug":"how-robust-is-your-fair-model-exploring-the","title":"How Robust is your Fair Model? Exploring the Robustness of Diverse Fairness Strategies","date":"2022-07-11","arxiv_id":"2207.04581","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-legal-case-matching-via-inverse","slug":"explainable-legal-case-matching-via-inverse","title":"Explainable Legal Case Matching via Inverse Optimal Transport-based Rationale Extraction","date":"2022-07-09","arxiv_id":"2207.04182","repositories_listed":1,"syntology":null},{"url":"/paper/an-approach-to-ensure-fairness-in-news","slug":"an-approach-to-ensure-fairness-in-news","title":"An Approach to Ensure Fairness in News Articles","date":"2022-07-08","arxiv_id":"2207.03938","repositories_listed":1,"syntology":null},{"url":"/paper/calibrate-to-interpret","slug":"calibrate-to-interpret","title":"Calibrate to Interpret","date":"2022-07-07","arxiv_id":"2207.03324","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-fairness-of-visual-attribute","slug":"enhancing-fairness-of-visual-attribute","title":"Enhancing Fairness of Visual Attribute Predictors","date":"2022-07-07","arxiv_id":"2207.05727","repositories_listed":1,"syntology":null},{"url":"/paper/group-fairness-in-adaptive-submodular","slug":"group-fairness-in-adaptive-submodular","title":"Group Equality in Adaptive Submodular Maximization","date":"2022-07-07","arxiv_id":"2207.03364","repositories_listed":1,"syntology":null},{"url":"/paper/individual-preference-stability-for","slug":"individual-preference-stability-for","title":"Individual Preference Stability for Clustering","date":"2022-07-07","arxiv_id":"2207.03600","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/individual-preference-stability-for#ran","syntology_url":"https://syntology.ai/paper/2207.03600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03600"}},"official":{"repos":["amazon-research/ip-stability-for-clustering"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rawlsian-assignments","slug":"rawlsian-assignments","title":"Rawlsian Assignments","date":"2022-07-06","arxiv_id":"2207.02930","repositories_listed":1,"syntology":null},{"url":"/paper/implementing-reinforcement-learning-1","slug":"implementing-reinforcement-learning-1","title":"Implementing Reinforcement Learning Datacenter Congestion Control in NVIDIA NICs","date":"2022-07-05","arxiv_id":"2207.02295","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-intersectional-biases-in-nlp","slug":"benchmarking-intersectional-biases-in-nlp","title":"Benchmarking Intersectional Biases in NLP","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fatnet-cost-effective-approach-towards","slug":"fatnet-cost-effective-approach-towards","title":"FAtNet: Cost-Effective Approach Towards Mitigating the Linguistic Bias in Speaker Verification Systems","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/features-or-spurious-artifacts-data-centric","slug":"features-or-spurious-artifacts-data-centric","title":"Features or Spurious Artifacts? Data-centric Baselines for Fair and Robust Hate Speech Detection","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/understanding-instance-level-impact-of","slug":"understanding-instance-level-impact-of","title":"Understanding Instance-Level Impact of Fairness Constraints","date":"2022-06-30","arxiv_id":"2206.15437","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-instance-level-impact-of#ran","syntology_url":"https://syntology.ai/paper/2206.15437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.15437"}},"official":{"repos":["ucsc-real/fairinfl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/transferring-fairness-under-distribution","slug":"transferring-fairness-under-distribution","title":"Transferring Fairness under Distribution Shifts via Fair Consistency Regularization","date":"2022-06-26","arxiv_id":"2206.12796","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/transferring-fairness-under-distribution#ran","syntology_url":"https://syntology.ai/paper/2206.12796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12796"}},"official":{"repos":["umd-huang-lab/transfer-fairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/on-structural-explanation-of-bias-in-graph","slug":"on-structural-explanation-of-bias-in-graph","title":"On Structural Explanation of Bias in Graph Neural Networks","date":"2022-06-24","arxiv_id":"2206.12104","repositories_listed":1,"syntology":null},{"url":"/paper/fairgrad-fairness-aware-gradient-descent","slug":"fairgrad-fairness-aware-gradient-descent","title":"FairGrad: Fairness Aware Gradient Descent","date":"2022-06-22","arxiv_id":"2206.10923","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-utility-fairness-and-compactness","slug":"achieving-utility-fairness-and-compactness","title":"Classification Utility, Fairness, and Compactness via Tunable Information Bottleneck and Rényi Measures","date":"2022-06-20","arxiv_id":"2206.10043","repositories_listed":1,"syntology":null},{"url":"/paper/square-one-bias-in-nlp-towards-a-multi-2","slug":"square-one-bias-in-nlp-towards-a-multi-2","title":"Square One Bias in NLP: Towards a Multi-Dimensional Exploration of the Research Manifold","date":"2022-06-20","arxiv_id":"2206.09755","repositories_listed":1,"syntology":null},{"url":"/paper/fair-generalized-linear-models-with-a-convex","slug":"fair-generalized-linear-models-with-a-convex","title":"Fair Generalized Linear Models with a Convex Penalty","date":"2022-06-18","arxiv_id":"2206.09076","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-generalized-linear-models-with-a-convex#ran","syntology_url":"https://syntology.ai/paper/2206.09076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09076"}},"official":{"repos":["hyungrok-do/fair-glm-cvx"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-fair-representation-via","slug":"learning-fair-representation-via","title":"Learning Fair Representation via Distributional Contrastive Disentanglement","date":"2022-06-17","arxiv_id":"2206.08743","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-adult-and-compas-fairness-in-multi","slug":"beyond-adult-and-compas-fairness-in-multi","title":"Beyond Adult and COMPAS: Fairness in Multi-Class Prediction","date":"2022-06-15","arxiv_id":"2206.07801","repositories_listed":1,"syntology":null},{"url":"/paper/disparate-impact-in-differential-privacy-from","slug":"disparate-impact-in-differential-privacy-from","title":"Disparate Impact in Differential Privacy from Gradient Misalignment","date":"2022-06-15","arxiv_id":"2206.07737","repositories_listed":1,"syntology":{"n":20,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/disparate-impact-in-differential-privacy-from#ran","syntology_url":"https://syntology.ai/paper/2206.07737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07737"}},"official":{"repos":["layer6ai-labs/fair-dp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-ranking-as-fair-division-impact-based","slug":"fair-ranking-as-fair-division-impact-based","title":"Fair Ranking as Fair Division: Impact-Based Individual Fairness in Ranking","date":"2022-06-15","arxiv_id":"2206.07247","repositories_listed":1,"syntology":null},{"url":"/paper/abcinml-anticipatory-bias-correction-in","slug":"abcinml-anticipatory-bias-correction-in","title":"ABCinML: Anticipatory Bias Correction in Machine Learning Applications","date":"2022-06-14","arxiv_id":"2206.06960","repositories_listed":1,"syntology":null},{"url":"/paper/specifying-and-testing-k-safety-properties","slug":"specifying-and-testing-k-safety-properties","title":"Specifying and Testing $k$-Safety Properties for Machine-Learning Models","date":"2022-06-13","arxiv_id":"2206.06054","repositories_listed":1,"syntology":null},{"url":"/paper/bounding-and-approximating-intersectional","slug":"bounding-and-approximating-intersectional","title":"Bounding and Approximating Intersectional Fairness through Marginal Fairness","date":"2022-06-12","arxiv_id":"2206.05828","repositories_listed":1,"syntology":null},{"url":"/paper/comprehensive-fair-meta-learned-recommender","slug":"comprehensive-fair-meta-learned-recommender","title":"Comprehensive Fair Meta-learned Recommender System","date":"2022-06-09","arxiv_id":"2206.04789","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/comprehensive-fair-meta-learned-recommender#ran","syntology_url":"https://syntology.ai/paper/2206.04789","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04789"}},"official":{"repos":["weitianxin/CLOVER"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/improved-approximation-for-fair-correlation","slug":"improved-approximation-for-fair-correlation","title":"Improved Approximation for Fair Correlation Clustering","date":"2022-06-09","arxiv_id":"2206.05050","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improved-approximation-for-fair-correlation#ran","syntology_url":"https://syntology.ai/paper/2206.05050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05050"}},"official":{"repos":["moonin12/improved_fair_correlation_clustering"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-adversarial-learning-for-cross-domain","slug":"joint-adversarial-learning-for-cross-domain","title":"Fair Classification via Domain Adaptation: A Dual Adversarial Learning Approach","date":"2022-06-08","arxiv_id":"2206.03656","repositories_listed":1,"syntology":null},{"url":"/paper/pfl-bench-a-comprehensive-benchmark-for","slug":"pfl-bench-a-comprehensive-benchmark-for","title":"pFL-Bench: A Comprehensive Benchmark for Personalized Federated Learning","date":"2022-06-08","arxiv_id":"2206.03655","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pfl-bench-a-comprehensive-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2206.03655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03655"}},"official":{"repos":["alibaba/federatedscope"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/eix-gnn-concept-level-eigencentrality","slug":"eix-gnn-concept-level-eigencentrality","title":"EiX-GNN : Concept-level eigencentrality explainer for graph neural networks","date":"2022-06-07","arxiv_id":"2206.03491","repositories_listed":1,"syntology":null},{"url":"/paper/fairvfl-a-fair-vertical-federated-learning","slug":"fairvfl-a-fair-vertical-federated-learning","title":"FairVFL: A Fair Vertical Federated Learning Framework with Contrastive Adversarial Learning","date":"2022-06-07","arxiv_id":"2206.03200","repositories_listed":1,"syntology":{"n":11,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/fairvfl-a-fair-vertical-federated-learning#ran","syntology_url":"https://syntology.ai/paper/2206.03200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03200"}},"official":{"repos":["taoqi98/fairvfl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/group-meritocratic-fairness-in-linear","slug":"group-meritocratic-fairness-in-linear","title":"Group Meritocratic Fairness in Linear Contextual Bandits","date":"2022-06-07","arxiv_id":"2206.03150","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/group-meritocratic-fairness-in-linear#ran","syntology_url":"https://syntology.ai/paper/2206.03150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03150"}},"official":{"repos":["csml-iit-ucl/gmfbandits"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-fairness-in-graph-neural-networks","slug":"improving-fairness-in-graph-neural-networks","title":"Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakage","date":"2022-06-07","arxiv_id":"2206.03426","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/improving-fairness-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2206.03426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03426"}},"official":{"repos":["yuwvandy/fairvgnn"],"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/inferring-unfairness-and-error-from","slug":"inferring-unfairness-and-error-from","title":"Fairness and Unfairness in Binary and Multiclass Classification: Quantifying, Calculating, and Bounding","date":"2022-06-07","arxiv_id":"2206.03234","repositories_listed":1,"syntology":{"n":31,"n_ran":24,"n_constructed":0,"n_ran_checked":7,"n_instrument":17,"n_unverified":7,"n_honours":5,"n_violates":2,"n_no_contract":0,"n_pointer_only":31,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 5 honoured, 2 violated, 0 with no contract checked; 17 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/inferring-unfairness-and-error-from#ran","syntology_url":"https://syntology.ai/paper/2206.03234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03234"}},"official":{"repos":["sivansabato/unfairness"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/distributive-justice-as-the-foundational","slug":"distributive-justice-as-the-foundational","title":"Distributive Justice as the Foundational Premise of Fair ML: Unification, Extension, and Interpretation of Group Fairness Metrics","date":"2022-06-06","arxiv_id":"2206.02897","repositories_listed":1,"syntology":null},{"url":"/paper/enforcing-group-fairness-in-algorithmic","slug":"enforcing-group-fairness-in-algorithmic","title":"Enforcing Group Fairness in Algorithmic Decision Making: Utility Maximization Under Sufficiency","date":"2022-06-05","arxiv_id":"2206.02237","repositories_listed":1,"syntology":null},{"url":"/paper/learning-distributed-and-fair-policies-for","slug":"learning-distributed-and-fair-policies-for","title":"Learning Distributed and Fair Policies for Network Load Balancing as Markov Potential Game","date":"2022-06-03","arxiv_id":"2206.01451","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-distributed-and-fair-policies-for#ran","syntology_url":"https://syntology.ai/paper/2206.01451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01451"}},"official":{"repos":["zhiyuanyaoj/marllb"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/how-biased-is-your-feature-computing-fairness","slug":"how-biased-is-your-feature-computing-fairness","title":"How Biased are Your Features?: Computing Fairness Influence Functions with Global Sensitivity Analysis","date":"2022-06-01","arxiv_id":"2206.00667","repositories_listed":1,"syntology":null},{"url":"/paper/certifying-some-distributional-fairness-with","slug":"certifying-some-distributional-fairness-with","title":"Certifying Some Distributional Fairness with Subpopulation Decomposition","date":"2022-05-31","arxiv_id":"2205.15494","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/certifying-some-distributional-fairness-with#ran","syntology_url":"https://syntology.ai/paper/2205.15494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15494"}},"official":{"repos":["ai-secure/certified-fairness"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-transferability-subject-to-bounded","slug":"fairness-transferability-subject-to-bounded","title":"Fairness Transferability Subject to Bounded Distribution Shift","date":"2022-05-31","arxiv_id":"2206.00129","repositories_listed":1,"syntology":null},{"url":"/paper/felare-fair-scheduling-of-machine-learning","slug":"felare-fair-scheduling-of-machine-learning","title":"FELARE: Fair Scheduling of Machine Learning Tasks on Heterogeneous Edge Systems","date":"2022-05-31","arxiv_id":"2206.00065","repositories_listed":1,"syntology":null},{"url":"/paper/social-bias-meets-data-bias-the-impacts-of","slug":"social-bias-meets-data-bias-the-impacts-of","title":"Social Bias Meets Data Bias: The Impacts of Labeling and Measurement Errors on Fairness Criteria","date":"2022-05-31","arxiv_id":"2206.00137","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/social-bias-meets-data-bias-the-impacts-of#ran","syntology_url":"https://syntology.ai/paper/2206.00137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.00137"}},"official":{"repos":["yl489/social-bias-meets-data-bias"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fairness-in-the-first-stage-of-two-stage","slug":"fairness-in-the-first-stage-of-two-stage","title":"Uncertainty Quantification for Fairness in Two-Stage Recommender Systems","date":"2022-05-30","arxiv_id":"2205.15436","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fairness-in-the-first-stage-of-two-stage#ran","syntology_url":"https://syntology.ai/paper/2205.15436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15436"}},"official":{"repos":["lequnwang/fair-two-stage-recommender"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fooling-shap-with-stealthily-biased-sampling","slug":"fooling-shap-with-stealthily-biased-sampling","title":"Fool SHAP with Stealthily Biased Sampling","date":"2022-05-30","arxiv_id":"2205.15419","repositories_listed":1,"syntology":null},{"url":"/paper/metrizing-fairness","slug":"metrizing-fairness","title":"Metrizing Fairness","date":"2022-05-30","arxiv_id":"2205.15049","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-based-classification-from-hierarchy-1","slug":"prototype-based-classification-from-hierarchy-1","title":"Prototype Based Classification from Hierarchy to Fairness","date":"2022-05-27","arxiv_id":"2205.13997","repositories_listed":1,"syntology":null}],"record_sha256":"1d25d4181a78978eb25528e966f862278a04848a2cb9a39df4bc5c447db58e47","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}