{"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/3","list_of":"/task/fairness","task":"Fairness","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":57,"rows_per_page":100,"rows":[201,300],"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/2","next":"/task/fairness/papers/4","papers":[{"url":"/paper/learning-fair-representations","slug":"learning-fair-representations","title":"Learning Fair Representations","date":"2013-06-17","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/a-reproducibility-study-of-product-side","slug":"a-reproducibility-study-of-product-side","title":"A Reproducibility Study of Product-side Fairness in Bundle Recommendation","date":"2025-07-18","arxiv_id":"2507.14352","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-aware-grouping-for-continuous","slug":"fairness-aware-grouping-for-continuous","title":"Fairness-Aware Grouping for Continuous Sensitive Variables: Application for Debiasing Face Analysis with respect to Skin Tone","date":"2025-07-15","arxiv_id":"2507.11247","repositories_listed":1,"syntology":null},{"url":"/paper/guiding-llm-decision-making-with-fairness","slug":"guiding-llm-decision-making-with-fairness","title":"Guiding LLM Decision-Making with Fairness Reward Models","date":"2025-07-15","arxiv_id":"2507.11344","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-is-not-enough-auditing-competence","slug":"fairness-is-not-enough-auditing-competence","title":"Fairness Is Not Enough: Auditing Competence and Intersectional Bias in AI-powered Resume Screening","date":"2025-07-11","arxiv_id":"2507.11548","repositories_listed":1,"syntology":null},{"url":"/paper/datasets-for-fairness-in-language-models-an","slug":"datasets-for-fairness-in-language-models-an","title":"Datasets for Fairness in Language Models: An In-Depth Survey","date":"2025-06-29","arxiv_id":"2506.23411","repositories_listed":1,"syntology":null},{"url":"/paper/hyperfa-ir-a-hypergeometric-approach-to-fair","slug":"hyperfa-ir-a-hypergeometric-approach-to-fair","title":"hyperFA*IR: A hypergeometric approach to fair rankings with finite candidate pool","date":"2025-06-17","arxiv_id":"2506.14349","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-scheduling-for-llm-inference","slug":"semantic-scheduling-for-llm-inference","title":"Semantic Scheduling for LLM Inference","date":"2025-06-13","arxiv_id":"2506.12204","repositories_listed":1,"syntology":null},{"url":"/paper/2506-10586","slug":"2506-10586","title":"Size-adaptive Hypothesis Testing for Fairness","date":"2025-06-12","arxiv_id":"2506.10586","repositories_listed":1,"syntology":null},{"url":"/paper/robustly-improving-llm-fairness-in-realistic","slug":"robustly-improving-llm-fairness-in-realistic","title":"Robustly Improving LLM Fairness in Realistic Settings via Interpretability","date":"2025-06-12","arxiv_id":"2506.10922","repositories_listed":1,"syntology":null},{"url":"/paper/2506-10102","slug":"2506-10102","title":"Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach","date":"2025-06-11","arxiv_id":"2506.10102","repositories_listed":1,"syntology":null},{"url":"/paper/towards-class-wise-fair-adversarial-training","slug":"towards-class-wise-fair-adversarial-training","title":"Towards Class-wise Fair Adversarial Training via Anti-Bias Soft Label Distillation","date":"2025-06-10","arxiv_id":"2506.08611","repositories_listed":1,"syntology":null},{"url":"/paper/addressing-correlated-latent-exogenous","slug":"addressing-correlated-latent-exogenous","title":"Addressing Correlated Latent Exogenous Variables in Debiased Recommender Systems","date":"2025-06-09","arxiv_id":"2506.07517","repositories_listed":1,"syntology":null},{"url":"/paper/improving-fairness-of-large-language-models","slug":"improving-fairness-of-large-language-models","title":"Improving Fairness of Large Language Models in Multi-document Summarization","date":"2025-06-09","arxiv_id":"2506.07479","repositories_listed":1,"syntology":null},{"url":"/paper/fairpfn-a-tabular-foundation-model-for-causal","slug":"fairpfn-a-tabular-foundation-model-for-causal","title":"FairPFN: A Tabular Foundation Model for Causal Fairness","date":"2025-06-08","arxiv_id":"2506.07049","repositories_listed":1,"syntology":null},{"url":"/paper/information-bargaining-bilateral-commitment","slug":"information-bargaining-bilateral-commitment","title":"Information Bargaining: Bilateral Commitment in Bayesian Persuasion","date":"2025-06-06","arxiv_id":"2506.05876","repositories_listed":1,"syntology":null},{"url":"/paper/composing-agents-to-minimize-worst-case-risk","slug":"composing-agents-to-minimize-worst-case-risk","title":"Composing Agents to Minimize Worst-case Risk","date":"2025-06-05","arxiv_id":"2506.04632","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/composing-agents-to-minimize-worst-case-risk#ran","syntology_url":"https://syntology.ai/paper/2506.04632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.04632"}},"official":{"repos":["guruprerana/worm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/opengt-a-comprehensive-benchmark-for-graph","slug":"opengt-a-comprehensive-benchmark-for-graph","title":"OpenGT: A Comprehensive Benchmark For Graph Transformers","date":"2025-06-05","arxiv_id":"2506.04765","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-challenges-to-the","slug":"understanding-challenges-to-the","title":"Understanding challenges to the interpretation of disaggregated evaluations of algorithmic fairness","date":"2025-06-04","arxiv_id":"2506.04193","repositories_listed":1,"syntology":null},{"url":"/paper/simulating-training-data-leakage-in-multiple","slug":"simulating-training-data-leakage-in-multiple","title":"Simulating Training Data Leakage in Multiple-Choice Benchmarks for LLM Evaluation","date":"2025-05-30","arxiv_id":"2505.24263","repositories_listed":1,"syntology":null},{"url":"/paper/is-your-model-fairly-certain-uncertainty","slug":"is-your-model-fairly-certain-uncertainty","title":"Is Your Model Fairly Certain? Uncertainty-Aware Fairness Evaluation for LLMs","date":"2025-05-29","arxiv_id":"2505.23996","repositories_listed":1,"syntology":null},{"url":"/paper/towards-reward-fairness-in-rlhf-from-a","slug":"towards-reward-fairness-in-rlhf-from-a","title":"Towards Reward Fairness in RLHF: From a Resource Allocation Perspective","date":"2025-05-29","arxiv_id":"2505.23349","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/towards-reward-fairness-in-rlhf-from-a#ran","syntology_url":"https://syntology.ai/paper/2505.23349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23349"}},"official":{"repos":["shoyua/towards-reward-fairness"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/talent-or-luck-evaluating-attribution-bias-in","slug":"talent-or-luck-evaluating-attribution-bias-in","title":"Talent or Luck? Evaluating Attribution Bias in Large Language Models","date":"2025-05-28","arxiv_id":"2505.22910","repositories_listed":1,"syntology":null},{"url":"/paper/subgroups-matter-for-robust-bias-mitigation","slug":"subgroups-matter-for-robust-bias-mitigation","title":"Subgroups Matter for Robust Bias Mitigation","date":"2025-05-27","arxiv_id":"2505.21363","repositories_listed":1,"syntology":null},{"url":"/paper/logic-gate-neural-networks-are-good-for","slug":"logic-gate-neural-networks-are-good-for","title":"Logic Gate Neural Networks are Good for Verification","date":"2025-05-26","arxiv_id":"2505.19932","repositories_listed":1,"syntology":{"n":18,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/logic-gate-neural-networks-are-good-for#ran","syntology_url":"https://syntology.ai/paper/2505.19932","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.19932"}},"official":{"repos":["HyberionBrew/difflogic_verify"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/preserving-auc-fairness-in-learning-with","slug":"preserving-auc-fairness-in-learning-with","title":"Preserving AUC Fairness in Learning with Noisy Protected Groups","date":"2025-05-24","arxiv_id":"2505.18532","repositories_listed":1,"syntology":null},{"url":"/paper/a-generic-framework-for-conformal-fairness","slug":"a-generic-framework-for-conformal-fairness","title":"A Generic Framework for Conformal Fairness","date":"2025-05-22","arxiv_id":"2505.16115","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":14,"n_ran_checked":14,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"15 ran (of which 14 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-generic-framework-for-conformal-fairness#ran","syntology_url":"https://syntology.ai/paper/2505.16115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16115"}},"official":{"repos":["adityavadlamani/conformal-fairness"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":14,"n_ran_no_instrument_failure":14,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/audiotrust-benchmarking-the-multifaceted","slug":"audiotrust-benchmarking-the-multifaceted","title":"AudioTrust: Benchmarking the Multifaceted Trustworthiness of Audio Large Language Models","date":"2025-05-22","arxiv_id":"2505.16211","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":0,"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/audiotrust-benchmarking-the-multifaceted#ran","syntology_url":"https://syntology.ai/paper/2505.16211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16211"}},"official":{"repos":["jusperlee/audiotrust"],"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/are-the-confidence-scores-of-reviewers","slug":"are-the-confidence-scores-of-reviewers","title":"Are the confidence scores of reviewers consistent with the review content? Evidence from top conference proceedings in AI","date":"2025-05-21","arxiv_id":"2505.15031","repositories_listed":1,"syntology":null},{"url":"/paper/hava-hybrid-approach-to-value-alignment","slug":"hava-hybrid-approach-to-value-alignment","title":"HAVA: Hybrid Approach to Value-Alignment through Reward Weighing for Reinforcement Learning","date":"2025-05-21","arxiv_id":"2505.15011","repositories_listed":1,"syntology":null},{"url":"/paper/openethics-a-comprehensive-ethical-evaluation","slug":"openethics-a-comprehensive-ethical-evaluation","title":"OpenEthics: A Comprehensive Ethical Evaluation of Open-Source Generative Large Language Models","date":"2025-05-21","arxiv_id":"2505.16036","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-neural-networks-with-reasons","slug":"explaining-neural-networks-with-reasons","title":"Explaining Neural Networks with Reasons","date":"2025-05-20","arxiv_id":"2505.14424","repositories_listed":1,"syntology":null},{"url":"/paper/automated-bias-assessment-in-ai-generated","slug":"automated-bias-assessment-in-ai-generated","title":"Automated Bias Assessment in AI-Generated Educational Content Using CEAT Framework","date":"2025-05-19","arxiv_id":"2505.12718","repositories_listed":1,"syntology":null},{"url":"/paper/cpret-a-dataset-benchmark-and-model-for","slug":"cpret-a-dataset-benchmark-and-model-for","title":"CPRet: A Dataset, Benchmark, and Model for Retrieval in Competitive Programming","date":"2025-05-19","arxiv_id":"2505.12925","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/cpret-a-dataset-benchmark-and-model-for#ran","syntology_url":"https://syntology.ai/paper/2505.12925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12925"}},"official":{"repos":["coldchair/cpret"],"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":["found_in_text"]}}},{"url":"/paper/teach2eval-an-indirect-evaluation-method-for","slug":"teach2eval-an-indirect-evaluation-method-for","title":"Teach2Eval: An Indirect Evaluation Method for LLM by Judging How It Teaches","date":"2025-05-18","arxiv_id":"2505.12259","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11111","slug":"2505-11111","title":"FairSHAP: Preprocessing for Fairness Through Attribution-Based Data Augmentation","date":"2025-05-16","arxiv_id":"2505.11111","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11396","slug":"2505-11396","title":"Finding Counterfactual Evidences for Node Classification","date":"2025-05-16","arxiv_id":"2505.11396","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11454","slug":"2505-11454","title":"HumaniBench: A Human-Centric Framework for Large Multimodal Models Evaluation","date":"2025-05-16","arxiv_id":"2505.11454","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-interplay-of-human-ai-alignment","slug":"on-the-interplay-of-human-ai-alignment","title":"On the Interplay of Human-AI Alignment,Fairness, and Performance Trade-offs in Medical Imaging","date":"2025-05-15","arxiv_id":"2505.10231","repositories_listed":1,"syntology":null},{"url":"/paper/toward-fair-federated-learning-under","slug":"toward-fair-federated-learning-under","title":"Toward Fair Federated Learning under Demographic Disparities and Data Imbalance","date":"2025-05-14","arxiv_id":"2505.09295","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-system-to-prove-machine-learning","slug":"a-scalable-system-to-prove-machine-learning","title":"FairZK: A Scalable System to Prove Machine Learning Fairness in Zero-Knowledge","date":"2025-05-12","arxiv_id":"2505.07997","repositories_listed":1,"syntology":null},{"url":"/paper/fair-play-for-individuals-foul-play-for","slug":"fair-play-for-individuals-foul-play-for","title":"Fair Play for Individuals, Foul Play for Groups? Auditing Anonymization's Impact on ML Fairness","date":"2025-05-12","arxiv_id":"2505.07985","repositories_listed":1,"syntology":null},{"url":"/paper/justified-evidence-collection-for-argument","slug":"justified-evidence-collection-for-argument","title":"Justified Evidence Collection for Argument-based AI Fairness Assurance","date":"2025-05-12","arxiv_id":"2505.08064","repositories_listed":1,"syntology":null},{"url":"/paper/must-read-a-systematic-survey-of","slug":"must-read-a-systematic-survey-of","title":"Must Read: A Systematic Survey of Computational Persuasion","date":"2025-05-12","arxiv_id":"2505.07775","repositories_listed":1,"syntology":null},{"url":"/paper/wireless-link-scheduling-with-state-augmented","slug":"wireless-link-scheduling-with-state-augmented","title":"Wireless Link Scheduling with State-Augmented Graph Neural Networks","date":"2025-05-12","arxiv_id":"2505.07598","repositories_listed":1,"syntology":null},{"url":"/paper/facets-of-disparate-impact-evaluating-legally","slug":"facets-of-disparate-impact-evaluating-legally","title":"Facets of Disparate Impact: Evaluating Legally Consistent Bias in Machine Learning","date":"2025-05-08","arxiv_id":"2505.05471","repositories_listed":1,"syntology":null},{"url":"/paper/tetweave-isosurface-extraction-using-on-the","slug":"tetweave-isosurface-extraction-using-on-the","title":"TetWeave: Isosurface Extraction using On-The-Fly Delaunay Tetrahedral Grids for Gradient-Based Mesh Optimization","date":"2025-05-07","arxiv_id":"2505.04590","repositories_listed":1,"syntology":null},{"url":"/paper/robust-fairness-vision-language-learning-for","slug":"robust-fairness-vision-language-learning-for","title":"Robust Fairness Vision-Language Learning for Medical Image Analysis","date":"2025-05-06","arxiv_id":"2505.03153","repositories_listed":1,"syntology":null},{"url":"/paper/colombian-waitresses-y-jueces-canadienses","slug":"colombian-waitresses-y-jueces-canadienses","title":"Colombian Waitresses y Jueces canadienses: Gender and Country Biases in Occupation Recommendations from LLMs","date":"2025-05-05","arxiv_id":"2505.02456","repositories_listed":1,"syntology":null},{"url":"/paper/social-biases-in-knowledge-representations-of","slug":"social-biases-in-knowledge-representations-of","title":"Social Biases in Knowledge Representations of Wikidata separates Global North from Global South","date":"2025-05-05","arxiv_id":"2505.02352","repositories_listed":1,"syntology":null},{"url":"/paper/component-based-fairness-in-face-attribute","slug":"component-based-fairness-in-face-attribute","title":"Component-Based Fairness in Face Attribute Classification with Bayesian Network-informed Meta Learning","date":"2025-05-03","arxiv_id":"2505.01699","repositories_listed":1,"syntology":null},{"url":"/paper/simaug-enhancing-recommendation-with","slug":"simaug-enhancing-recommendation-with","title":"SimAug: Enhancing Recommendation with Pretrained Language Models for Dense and Balanced Data Augmentation","date":"2025-05-03","arxiv_id":"2505.01695","repositories_listed":1,"syntology":null},{"url":"/paper/gender-bias-in-explainability-investigating","slug":"gender-bias-in-explainability-investigating","title":"Gender Bias in Explainability: Investigating Performance Disparity in Post-hoc Methods","date":"2025-05-02","arxiv_id":"2505.01198","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-fairness-in-house-price","slug":"machine-learning-fairness-in-house-price","title":"Machine Learning Fairness in House Price Prediction: A Case Study of America's Expanding Metropolises","date":"2025-05-02","arxiv_id":"2505.01591","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-new-item-fairness-in-dynamic","slug":"enhancing-new-item-fairness-in-dynamic","title":"Enhancing New-item Fairness in Dynamic Recommender Systems","date":"2025-04-30","arxiv_id":"2504.21362","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-the-generalisation-gap-synthetic","slug":"bridging-the-generalisation-gap-synthetic","title":"Bridging the Generalisation Gap: Synthetic Data Generation for Multi-Site Clinical Model Validation","date":"2025-04-29","arxiv_id":"2504.20635","repositories_listed":1,"syntology":null},{"url":"/paper/decision-centric-fairness-evaluation-and","slug":"decision-centric-fairness-evaluation-and","title":"Decision-centric fairness: Evaluation and optimization for resource allocation problems","date":"2025-04-29","arxiv_id":"2504.20642","repositories_listed":1,"syntology":null},{"url":"/paper/ai-alignment-in-medical-imaging-unveiling","slug":"ai-alignment-in-medical-imaging-unveiling","title":"AI Alignment in Medical Imaging: Unveiling Hidden Biases Through Counterfactual Analysis","date":"2025-04-28","arxiv_id":"2504.19621","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-distributive-justice-in-federated","slug":"achieving-distributive-justice-in-federated","title":"Achieving Distributive Justice in Federated Learning via Uncertainty Quantification","date":"2025-04-22","arxiv_id":"2504.15924","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-degree-bias-in-graph","slug":"mitigating-degree-bias-in-graph","title":"Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention","date":"2025-04-21","arxiv_id":"2504.15075","repositories_listed":1,"syntology":null},{"url":"/paper/software-engineering-principles-for-fairer","slug":"software-engineering-principles-for-fairer","title":"Software Engineering Principles for Fairer Systems: Experiments with GroupCART","date":"2025-04-17","arxiv_id":"2504.12587","repositories_listed":1,"syntology":null},{"url":"/paper/m-2-fgb-a-min-max-gradient-boosting-framework","slug":"m-2-fgb-a-min-max-gradient-boosting-framework","title":"M$^2$FGB: A Min-Max Gradient Boosting Framework for Subgroup Fairness","date":"2025-04-16","arxiv_id":"2504.12458","repositories_listed":1,"syntology":null},{"url":"/paper/seebias-a-comprehensive-tool-for-assessing","slug":"seebias-a-comprehensive-tool-for-assessing","title":"seeBias: A Comprehensive Tool for Assessing and Visualizing AI Fairness","date":"2025-04-11","arxiv_id":"2504.08418","repositories_listed":1,"syntology":null},{"url":"/paper/the-other-side-of-the-coin-exploring-fairness","slug":"the-other-side-of-the-coin-exploring-fairness","title":"The Other Side of the Coin: Exploring Fairness in Retrieval-Augmented Generation","date":"2025-04-11","arxiv_id":"2504.12323","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-bounded-exploration-and-intermediate","slug":"adaptive-bounded-exploration-and-intermediate","title":"Adaptive Bounded Exploration and Intermediate Actions for Data Debiasing","date":"2025-04-10","arxiv_id":"2504.08151","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-adversarial-robustness-to-bias","slug":"benchmarking-adversarial-robustness-to-bias","title":"Benchmarking Adversarial Robustness to Bias Elicitation in Large Language Models: Scalable Automated Assessment with LLM-as-a-Judge","date":"2025-04-10","arxiv_id":"2504.07887","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-llm-evaluation-through-mechanism","slug":"revisiting-llm-evaluation-through-mechanism","title":"Model Utility Law: Evaluating LLMs beyond Performance through Mechanism Interpretable Metric","date":"2025-04-10","arxiv_id":"2504.07440","repositories_listed":1,"syntology":null},{"url":"/paper/reasoning-towards-fairness-mitigating-bias-in","slug":"reasoning-towards-fairness-mitigating-bias-in","title":"Reasoning Towards Fairness: Mitigating Bias in Language Models through Reasoning-Guided Fine-Tuning","date":"2025-04-08","arxiv_id":"2504.05632","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reasoning-towards-fairness-mitigating-bias-in#ran","syntology_url":"https://syntology.ai/paper/2504.05632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.05632"}},"official":{"repos":["Sanchit-404/Reasoing-Towards-Fairness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/advanced-codebook-design-for-scma-aided-ntns","slug":"advanced-codebook-design-for-scma-aided-ntns","title":"Advanced Codebook Design for SCMA-aided NTNs With Randomly Distributed Users","date":"2025-04-07","arxiv_id":"2504.04928","repositories_listed":1,"syntology":null},{"url":"/paper/are-you-getting-what-you-pay-for-auditing","slug":"are-you-getting-what-you-pay-for-auditing","title":"Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs","date":"2025-04-07","arxiv_id":"2504.04715","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/are-you-getting-what-you-pay-for-auditing#ran","syntology_url":"https://syntology.ai/paper/2504.04715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.04715"}},"official":{"repos":["sunblaze-ucb/llm-api-audit"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-single-turn-a-survey-on-multi-turn","slug":"beyond-single-turn-a-survey-on-multi-turn","title":"Beyond Single-Turn: A Survey on Multi-Turn Interactions with Large Language Models","date":"2025-04-07","arxiv_id":"2504.04717","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-popularity-bias-amplification","slug":"investigating-popularity-bias-amplification","title":"Investigating Popularity Bias Amplification in Recommender Systems Employed in the Entertainment Domain","date":"2025-04-07","arxiv_id":"2504.04752","repositories_listed":1,"syntology":null},{"url":"/paper/post-processing-for-fair-regression-via","slug":"post-processing-for-fair-regression-via","title":"Post-processing for Fair Regression via Explainable SVD","date":"2025-04-04","arxiv_id":"2504.03093","repositories_listed":1,"syntology":null},{"url":"/paper/faire-assessing-racial-and-gender-bias-in-ai","slug":"faire-assessing-racial-and-gender-bias-in-ai","title":"FAIRE: Assessing Racial and Gender Bias in AI-Driven Resume Evaluations","date":"2025-04-02","arxiv_id":"2504.01420","repositories_listed":1,"syntology":null},{"url":"/paper/lite-llm-impelled-efficient-taxonomy","slug":"lite-llm-impelled-efficient-taxonomy","title":"LITE: LLM-Impelled efficient Taxonomy Evaluation","date":"2025-04-02","arxiv_id":"2504.01369","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-capabilities-and","slug":"investigating-the-capabilities-and","title":"Investigating the Capabilities and Limitations of Machine Learning for Identifying Bias in English Language Data with Information and Heritage Professionals","date":"2025-04-01","arxiv_id":"2504.00860","repositories_listed":1,"syntology":null},{"url":"/paper/ride-sourcing-vehicle-rebalancing-with","slug":"ride-sourcing-vehicle-rebalancing-with","title":"Scalable Ride-Sourcing Vehicle Rebalancing with Service Accessibility Guarantee: A Constrained Mean-Field Reinforcement Learning Approach","date":"2025-03-31","arxiv_id":"2503.24183","repositories_listed":1,"syntology":null},{"url":"/paper/the-more-the-merrier-logical-and-multistage","slug":"the-more-the-merrier-logical-and-multistage","title":"The more the merrier: logical and multistage processors in credit scoring","date":"2025-03-31","arxiv_id":"2503.23979","repositories_listed":1,"syntology":null},{"url":"/paper/a-constrained-multi-agent-reinforcement","slug":"a-constrained-multi-agent-reinforcement","title":"A Constrained Multi-Agent Reinforcement Learning Approach to Autonomous Traffic Signal Control","date":"2025-03-30","arxiv_id":"2503.23626","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-companion-paper-in-processing","slug":"reproducibility-companion-paper-in-processing","title":"Reproducibility Companion Paper:In-processing User Constrained Dominant Sets for User-Oriented Fairness in Recommender Systems","date":"2025-03-29","arxiv_id":"2503.23040","repositories_listed":1,"syntology":null},{"url":"/paper/a-causal-framework-to-measure-and-mitigate","slug":"a-causal-framework-to-measure-and-mitigate","title":"A Causal Framework to Measure and Mitigate Non-binary Treatment Discrimination","date":"2025-03-28","arxiv_id":"2503.22454","repositories_listed":1,"syntology":null},{"url":"/paper/bias-aware-agent-enhancing-fairness-in-ai","slug":"bias-aware-agent-enhancing-fairness-in-ai","title":"Bias-Aware Agent: Enhancing Fairness in AI-Driven Knowledge Retrieval","date":"2025-03-27","arxiv_id":"2503.21237","repositories_listed":1,"syntology":null},{"url":"/paper/the-cost-of-local-and-global-fairness-in","slug":"the-cost-of-local-and-global-fairness-in","title":"The Cost of Local and Global Fairness in Federated Learning","date":"2025-03-27","arxiv_id":"2503.22762","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/the-cost-of-local-and-global-fairness-in#ran","syntology_url":"https://syntology.ai/paper/2503.22762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.22762"}},"official":{"repos":["papersubmission678/the-cost-of-local-and-global-fairness-in-fl"],"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/flex-a-benchmark-for-evaluating-robustness-of","slug":"flex-a-benchmark-for-evaluating-robustness-of","title":"FLEX: A Benchmark for Evaluating Robustness of Fairness in Large Language Models","date":"2025-03-25","arxiv_id":"2503.19540","repositories_listed":1,"syntology":null},{"url":"/paper/fundamental-limits-of-perfect-concept-erasure","slug":"fundamental-limits-of-perfect-concept-erasure","title":"Fundamental Limits of Perfect Concept Erasure","date":"2025-03-25","arxiv_id":"2503.20098","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-and-fair-mechanisms-for","slug":"interpretable-and-fair-mechanisms-for","title":"Interpretable and Fair Mechanisms for Abstaining Classifiers","date":"2025-03-24","arxiv_id":"2503.18826","repositories_listed":1,"syntology":null},{"url":"/paper/simulation-driven-balancing-of-competitive","slug":"simulation-driven-balancing-of-competitive","title":"Simulation-Driven Balancing of Competitive Game Levels with Reinforcement Learning","date":"2025-03-24","arxiv_id":"2503.18748","repositories_listed":1,"syntology":null},{"url":"/paper/logofair-post-processing-for-local-and-global","slug":"logofair-post-processing-for-local-and-global","title":"LoGoFair: Post-Processing for Local and Global Fairness in Federated Learning","date":"2025-03-21","arxiv_id":"2503.17231","repositories_listed":1,"syntology":null},{"url":"/paper/global-group-fairness-in-federated-learning","slug":"global-group-fairness-in-federated-learning","title":"Global Group Fairness in Federated Learning via Function Tracking","date":"2025-03-19","arxiv_id":"2503.15163","repositories_listed":1,"syntology":null},{"url":"/paper/statistical-impossibility-and-possibility-of","slug":"statistical-impossibility-and-possibility-of","title":"Statistical Impossibility and Possibility of Aligning LLMs with Human Preferences: From Condorcet Paradox to Nash Equilibrium","date":"2025-03-14","arxiv_id":"2503.10990","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/statistical-impossibility-and-possibility-of#ran","syntology_url":"https://syntology.ai/paper/2503.10990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.10990"}},"official":{"repos":["szk123456789/Nash_RS"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-federated-medical-image-classification","slug":"fair-federated-medical-image-classification","title":"Fair Federated Medical Image Classification Against Quality Shift via Inter-Client Progressive State Matching","date":"2025-03-12","arxiv_id":"2503.09587","repositories_listed":1,"syntology":null},{"url":"/paper/group-robust-machine-unlearning","slug":"group-robust-machine-unlearning","title":"Group-robust Machine Unlearning","date":"2025-03-12","arxiv_id":"2503.09330","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/group-robust-machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/2503.09330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09330"}},"official":{"repos":["tdemin16/group-robust_machine_unlearning"],"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/fairdeface-evaluating-the-fairness-and","slug":"fairdeface-evaluating-the-fairness-and","title":"FairDeFace: Evaluating the Fairness and Adversarial Robustness of Face Obfuscation Methods","date":"2025-03-11","arxiv_id":"2503.08731","repositories_listed":1,"syntology":null},{"url":"/paper/process-supervised-llm-recommenders-via-flow","slug":"process-supervised-llm-recommenders-via-flow","title":"Process-Supervised LLM Recommenders via Flow-guided Tuning","date":"2025-03-10","arxiv_id":"2503.07377","repositories_listed":1,"syntology":null},{"url":"/paper/you-only-debias-once-towards-flexible","slug":"you-only-debias-once-towards-flexible","title":"You Only Debias Once: Towards Flexible Accuracy-Fairness Trade-offs at Inference Time","date":"2025-03-10","arxiv_id":"2503.07066","repositories_listed":1,"syntology":null},{"url":"/paper/aim-fair-advancing-algorithmic-fairness-via","slug":"aim-fair-advancing-algorithmic-fairness-via","title":"AIM-Fair: Advancing Algorithmic Fairness via Selectively Fine-Tuning Biased Models with Contextual Synthetic Data","date":"2025-03-07","arxiv_id":"2503.05665","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/aim-fair-advancing-algorithmic-fairness-via#ran","syntology_url":"https://syntology.ai/paper/2503.05665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.05665"}},"official":{"repos":["zengqunzhao/aim-fair"],"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/biased-heritage-how-datasets-shape-models-in","slug":"biased-heritage-how-datasets-shape-models-in","title":"Biased Heritage: How Datasets Shape Models in Facial Expression Recognition","date":"2025-03-05","arxiv_id":"2503.03446","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-and-or-privacy-on-social-graphs","slug":"fairness-and-or-privacy-on-social-graphs","title":"Fairness and/or Privacy on Social Graphs","date":"2025-03-03","arxiv_id":"2503.02114","repositories_listed":1,"syntology":null},{"url":"/paper/llms-as-educational-analysts-transforming","slug":"llms-as-educational-analysts-transforming","title":"LLMs as Educational Analysts: Transforming Multimodal Data Traces into Actionable Reading Assessment Reports","date":"2025-03-03","arxiv_id":"2503.02099","repositories_listed":1,"syntology":null},{"url":"/paper/cagn-gat-fusion-a-hybrid-contrastive","slug":"cagn-gat-fusion-a-hybrid-contrastive","title":"CAGN-GAT Fusion: A Hybrid Contrastive Attentive Graph Neural Network for Network Intrusion Detection","date":"2025-03-02","arxiv_id":"2503.00961","repositories_listed":1,"syntology":null}],"record_sha256":"f2effa686c7cd02e0b0d926b0470d9355a55dbbb3a39edba73b77ce3380b19ec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}