{"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/4","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":4,"pages_in_order":57,"rows_per_page":100,"rows":[301,400],"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/3","next":"/task/fairness/papers/5","papers":[{"url":"/paper/facroc-a-fairness-measure-for-fair-clustering","slug":"facroc-a-fairness-measure-for-fair-clustering","title":"FACROC: a fairness measure for FAir Clustering through ROC curves","date":"2025-03-02","arxiv_id":"2503.00854","repositories_listed":1,"syntology":null},{"url":"/paper/2503-00299","slug":"2503-00299","title":"Hidden Convexity of Fair PCA and Fast Solver via Eigenvalue Optimization","date":"2025-03-01","arxiv_id":"2503.00299","repositories_listed":1,"syntology":null},{"url":"/paper/towards-responsible-ai-in-education-hybrid","slug":"towards-responsible-ai-in-education-hybrid","title":"Towards Responsible AI in Education: Hybrid Recommendation System for K-12 Students Case Study","date":"2025-02-27","arxiv_id":"2502.20354","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-bias-in-rag-controlling-the","slug":"mitigating-bias-in-rag-controlling-the","title":"Mitigating Bias in RAG: Controlling the Embedder","date":"2025-02-24","arxiv_id":"2502.17390","repositories_listed":1,"syntology":null},{"url":"/paper/unmasking-societal-biases-in-respiratory","slug":"unmasking-societal-biases-in-respiratory","title":"Unmasking Societal Biases in Respiratory Support for ICU Patients through Social Determinants of Health","date":"2025-02-23","arxiv_id":"2502.16477","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-estimation-of-shortest-path","slug":"efficient-estimation-of-shortest-path","title":"Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs","date":"2025-02-21","arxiv_id":"2502.15890","repositories_listed":1,"syntology":null},{"url":"/paper/multi-agent-multi-armed-bandits-with-minimum","slug":"multi-agent-multi-armed-bandits-with-minimum","title":"Multi-agent Multi-armed Bandits with Minimum Reward Guarantee Fairness","date":"2025-02-21","arxiv_id":"2502.15240","repositories_listed":1,"syntology":null},{"url":"/paper/siglip-2-multilingual-vision-language","slug":"siglip-2-multilingual-vision-language","title":"SigLIP 2: Multilingual Vision-Language Encoders with Improved Semantic Understanding, Localization, and Dense Features","date":"2025-02-20","arxiv_id":"2502.14786","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-popularity-bias-in-collaborative","slug":"mitigating-popularity-bias-in-collaborative","title":"Unbiased Collaborative Filtering with Fair Sampling","date":"2025-02-19","arxiv_id":"2502.13840","repositories_listed":1,"syntology":null},{"url":"/paper/edge-colored-clustering-in-hypergraphs-beyond","slug":"edge-colored-clustering-in-hypergraphs-beyond","title":"Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges","date":"2025-02-18","arxiv_id":"2502.13000","repositories_listed":1,"syntology":null},{"url":"/paper/from-abstract-to-actionable-pairwise-shapley","slug":"from-abstract-to-actionable-pairwise-shapley","title":"From Abstract to Actionable: Pairwise Shapley Values for Explainable AI","date":"2025-02-18","arxiv_id":"2502.12525","repositories_listed":1,"syntology":null},{"url":"/paper/political-neutrality-in-ai-is-impossible-but","slug":"political-neutrality-in-ai-is-impossible-but","title":"Political Neutrality in AI Is Impossible- But Here Is How to Approximate It","date":"2025-02-18","arxiv_id":"2503.05728","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":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/political-neutrality-in-ai-is-impossible-but#ran","syntology_url":"https://syntology.ai/paper/2503.05728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.05728"}},"official":{"repos":["jfisher52/approximation_political_neutrality"],"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/rejected-dialects-biases-against-african","slug":"rejected-dialects-biases-against-african","title":"Rejected Dialects: Biases Against African American Language in Reward Models","date":"2025-02-18","arxiv_id":"2502.12858","repositories_listed":1,"syntology":null},{"url":"/paper/urinary-tract-infection-detection-in-digital","slug":"urinary-tract-infection-detection-in-digital","title":"Urinary Tract Infection Detection in Digital Remote Monitoring: Strategies for Managing Participant-Specific Prediction Complexity","date":"2025-02-18","arxiv_id":"2502.17484","repositories_listed":1,"syntology":null},{"url":"/paper/fairdiverse-a-comprehensive-toolkit-for-fair","slug":"fairdiverse-a-comprehensive-toolkit-for-fair","title":"FairDiverse: A Comprehensive Toolkit for Fair and Diverse Information Retrieval Algorithms","date":"2025-02-17","arxiv_id":"2502.11883","repositories_listed":1,"syntology":null},{"url":"/paper/joint-evaluation-of-fairness-and-relevance-in","slug":"joint-evaluation-of-fairness-and-relevance-in","title":"Joint Evaluation of Fairness and Relevance in Recommender Systems with Pareto Frontier","date":"2025-02-17","arxiv_id":"2502.11921","repositories_listed":1,"syntology":null},{"url":"/paper/bridging-jensen-gap-for-max-min-group","slug":"bridging-jensen-gap-for-max-min-group","title":"Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation","date":"2025-02-13","arxiv_id":"2502.09319","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bridging-jensen-gap-for-max-min-group#ran","syntology_url":"https://syntology.ai/paper/2502.09319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09319"}},"official":{"repos":["xuchen0427/fairdual"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-models-explainable-data-valuation-and","slug":"beyond-models-explainable-data-valuation-and","title":"Beyond Models! Explainable Data Valuation and Metric Adaption for Recommendation","date":"2025-02-12","arxiv_id":"2502.08685","repositories_listed":1,"syntology":null},{"url":"/paper/creagent-towards-long-term-evaluation-of","slug":"creagent-towards-long-term-evaluation-of","title":"CreAgent: Towards Long-Term Evaluation of Recommender System under Platform-Creator Information Asymmetry","date":"2025-02-11","arxiv_id":"2502.07307","repositories_listed":1,"syntology":null},{"url":"/paper/fact-or-fair-a-checklist-for-behavioral","slug":"fact-or-fair-a-checklist-for-behavioral","title":"Fact-or-Fair: A Checklist for Behavioral Testing of AI Models on Fairness-Related Queries","date":"2025-02-09","arxiv_id":"2502.05849","repositories_listed":1,"syntology":null},{"url":"/paper/towards-trustworthy-retrieval-augmented","slug":"towards-trustworthy-retrieval-augmented","title":"Towards Trustworthy Retrieval Augmented Generation for Large Language Models: A Survey","date":"2025-02-08","arxiv_id":"2502.06872","repositories_listed":1,"syntology":null},{"url":"/paper/group-adaptive-threshold-optimization-for","slug":"group-adaptive-threshold-optimization-for","title":"Group-Adaptive Threshold Optimization for Robust AI-Generated Text Detection","date":"2025-02-06","arxiv_id":"2502.04528","repositories_listed":1,"syntology":null},{"url":"/paper/towards-fair-medical-ai-adversarial-debiasing","slug":"towards-fair-medical-ai-adversarial-debiasing","title":"Towards Fair Medical AI: Adversarial Debiasing of 3D CT Foundation Embeddings","date":"2025-02-05","arxiv_id":"2502.04386","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-through-difference-awareness","slug":"fairness-through-difference-awareness","title":"Fairness through Difference Awareness: Measuring Desired Group Discrimination in LLMs","date":"2025-02-04","arxiv_id":"2502.01926","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-situation-testing-from-single","slug":"counterfactual-situation-testing-from-single","title":"Counterfactual Situation Testing: From Single to Multidimensional Discrimination","date":"2025-02-03","arxiv_id":"2502.01267","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-aware-fairness-learning-in","slug":"distribution-aware-fairness-learning-in","title":"Distribution-aware Fairness Learning in Medical Image Segmentation From A Control-Theoretic Perspective","date":"2025-02-02","arxiv_id":"2502.00619","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"4 ran (of which 2 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/distribution-aware-fairness-learning-in#ran","syntology_url":"https://syntology.ai/paper/2502.00619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00619"}},"official":{"repos":["tvseg/dmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-minimax-group-fairness-in","slug":"improving-minimax-group-fairness-in","title":"Improving Minimax Group Fairness in Sequential Recommendation","date":"2025-01-30","arxiv_id":"2501.18117","repositories_listed":1,"syntology":null},{"url":"/paper/reconciling-predictive-multiplicity-in","slug":"reconciling-predictive-multiplicity-in","title":"Reconciling Predictive Multiplicity in Practice","date":"2025-01-27","arxiv_id":"2501.16549","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-transport-on-categorical-data-for","slug":"optimal-transport-on-categorical-data-for","title":"Optimal Transport on Categorical Data for Counterfactuals using Compositional Data and Dirichlet Transport","date":"2025-01-26","arxiv_id":"2501.15549","repositories_listed":1,"syntology":null},{"url":"/paper/ai-biases-towards-rich-and-powerful-surnames","slug":"ai-biases-towards-rich-and-powerful-surnames","title":"Algorithmic Inheritance: Surname Bias in AI Decisions Reinforces Intergenerational Inequality","date":"2025-01-23","arxiv_id":"2501.19407","repositories_listed":1,"syntology":null},{"url":"/paper/watching-the-ai-watchdogs-a-fairness-and","slug":"watching-the-ai-watchdogs-a-fairness-and","title":"Watching the AI Watchdogs: A Fairness and Robustness Analysis of AI Safety Moderation Classifiers","date":"2025-01-23","arxiv_id":"2501.13302","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/watching-the-ai-watchdogs-a-fairness-and#ran","syntology_url":"https://syntology.ai/paper/2501.13302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.13302"}},"official":{"repos":["acharaakshit/fairmod"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-robust-fairness-via-confusional","slug":"enhancing-robust-fairness-via-confusional","title":"Enhancing Robust Fairness via Confusional Spectral Regularization","date":"2025-01-22","arxiv_id":"2501.13273","repositories_listed":1,"syntology":null},{"url":"/paper/t2isafety-benchmark-for-assessing-fairness","slug":"t2isafety-benchmark-for-assessing-fairness","title":"T2ISafety: Benchmark for Assessing Fairness, Toxicity, and Privacy in Image Generation","date":"2025-01-22","arxiv_id":"2501.12612","repositories_listed":1,"syntology":null},{"url":"/paper/generating-with-fairness-a-modality-diffused","slug":"generating-with-fairness-a-modality-diffused","title":"Generating with Fairness: A Modality-Diffused Counterfactual Framework for Incomplete Multimodal Recommendations","date":"2025-01-21","arxiv_id":"2501.11916","repositories_listed":1,"syntology":null},{"url":"/paper/facexbench-evaluating-multimodal-llms-on-face","slug":"facexbench-evaluating-multimodal-llms-on-face","title":"FaceXBench: Evaluating Multimodal LLMs on Face Understanding","date":"2025-01-17","arxiv_id":"2501.10360","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-reward-hacking-causal-rewards-for","slug":"beyond-reward-hacking-causal-rewards-for","title":"Beyond Reward Hacking: Causal Rewards for Large Language Model Alignment","date":"2025-01-16","arxiv_id":"2501.09620","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/beyond-reward-hacking-causal-rewards-for#ran","syntology_url":"https://syntology.ai/paper/2501.09620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09620"}},"official":{"repos":["tatsu-lab/alpaca_farm"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhanced-sps-velocity-adaptive-scheme-access","slug":"enhanced-sps-velocity-adaptive-scheme-access","title":"Enhanced SPS Velocity-adaptive Scheme: Access Fairness in 5G NR V2I Networks","date":"2025-01-14","arxiv_id":"2501.08037","repositories_listed":1,"syntology":null},{"url":"/paper/fairttts-a-tree-test-time-simulation-method","slug":"fairttts-a-tree-test-time-simulation-method","title":"FairTTTS: A Tree Test Time Simulation Method for Fairness-Aware Classification","date":"2025-01-14","arxiv_id":"2501.08155","repositories_listed":1,"syntology":null},{"url":"/paper/uncovering-bias-in-foundation-models-impact","slug":"uncovering-bias-in-foundation-models-impact","title":"Uncovering Bias in Foundation Models: Impact, Testing, Harm, and Mitigation","date":"2025-01-14","arxiv_id":"2501.10453","repositories_listed":1,"syntology":null},{"url":"/paper/foundation-models-at-work-fine-tuning-for","slug":"foundation-models-at-work-fine-tuning-for","title":"Foundation Models at Work: Fine-Tuning for Fairness in Algorithmic Hiring","date":"2025-01-13","arxiv_id":"2501.07324","repositories_listed":1,"syntology":null},{"url":"/paper/procedural-fairness-and-its-relationship-with","slug":"procedural-fairness-and-its-relationship-with","title":"Procedural Fairness and Its Relationship with Distributive Fairness in Machine Learning","date":"2025-01-12","arxiv_id":"2501.06753","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-instructor-ai-cooperation-for","slug":"assessing-instructor-ai-cooperation-for","title":"Assessing instructor-AI cooperation for grading essay-type questions in an introductory sociology course","date":"2025-01-11","arxiv_id":"2501.06461","repositories_listed":1,"syntology":null},{"url":"/paper/repeat-bias-aware-optimization-of-beyond","slug":"repeat-bias-aware-optimization-of-beyond","title":"Repeat-bias-aware Optimization of Beyond-accuracy Metrics for Next Basket Recommendation","date":"2025-01-10","arxiv_id":"2501.06362","repositories_listed":1,"syntology":null},{"url":"/paper/ecbench-can-multi-modal-foundation-models","slug":"ecbench-can-multi-modal-foundation-models","title":"ECBench: Can Multi-modal Foundation Models Understand the Egocentric World? A Holistic Embodied Cognition Benchmark","date":"2025-01-09","arxiv_id":"2501.05031","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/ecbench-can-multi-modal-foundation-models#ran","syntology_url":"https://syntology.ai/paper/2501.05031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.05031"}},"official":{"repos":["rh-dang/ecbench"],"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/who-does-the-giant-number-pile-like-best","slug":"who-does-the-giant-number-pile-like-best","title":"Who Does the Giant Number Pile Like Best: Analyzing Fairness in Hiring Contexts","date":"2025-01-08","arxiv_id":"2501.04316","repositories_listed":1,"syntology":null},{"url":"/paper/biasguard-guardrailing-fairness-in-machine","slug":"biasguard-guardrailing-fairness-in-machine","title":"BiasGuard: Guardrailing Fairness in Machine Learning Production Systems","date":"2025-01-07","arxiv_id":"2501.04142","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-through-matching","slug":"fairness-through-matching","title":"Fairness Through Matching","date":"2025-01-06","arxiv_id":"2501.02793","repositories_listed":1,"syntology":null},{"url":"/paper/langfair-a-python-package-for-assessing-bias","slug":"langfair-a-python-package-for-assessing-bias","title":"LangFair: A Python Package for Assessing Bias and Fairness in Large Language Model Use Cases","date":"2025-01-06","arxiv_id":"2501.03112","repositories_listed":1,"syntology":null},{"url":"/paper/over-the-air-fair-federated-learning-via","slug":"over-the-air-fair-federated-learning-via","title":"Over-the-Air Fair Federated Learning via Multi-Objective Optimization","date":"2025-01-06","arxiv_id":"2501.03392","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-of-lab-values-via","slug":"representation-learning-of-lab-values-via","title":"Representation Learning of Lab Values via Masked AutoEncoder","date":"2025-01-05","arxiv_id":"2501.02648","repositories_listed":1,"syntology":null},{"url":"/paper/fairsense-long-term-fairness-analysis-of-ml","slug":"fairsense-long-term-fairness-analysis-of-ml","title":"FairSense: Long-Term Fairness Analysis of ML-Enabled Systems","date":"2025-01-03","arxiv_id":"2501.01665","repositories_listed":1,"syntology":null},{"url":"/paper/towards-effective-discrimination-testing-for","slug":"towards-effective-discrimination-testing-for","title":"Towards Effective Discrimination Testing for Generative AI","date":"2024-12-30","arxiv_id":"2412.21052","repositories_listed":1,"syntology":null},{"url":"/paper/fairdiffusion-enhancing-equity-in-latent","slug":"fairdiffusion-enhancing-equity-in-latent","title":"FairDiffusion: Enhancing Equity in Latent Diffusion Models via Fair Bayesian Perturbation","date":"2024-12-29","arxiv_id":"2412.20374","repositories_listed":1,"syntology":null},{"url":"/paper/impact-of-data-distribution-on-fairness","slug":"impact-of-data-distribution-on-fairness","title":"Impact of Data Distribution on Fairness Guarantees in Equitable Deep Learning","date":"2024-12-29","arxiv_id":"2412.20377","repositories_listed":1,"syntology":null},{"url":"/paper/kvc-ongoing-keystroke-verification-challenge","slug":"kvc-ongoing-keystroke-verification-challenge","title":"KVC-onGoing: Keystroke Verification Challenge","date":"2024-12-29","arxiv_id":"2412.20530","repositories_listed":1,"syntology":null},{"url":"/paper/calibre-towards-fair-and-accurate","slug":"calibre-towards-fair-and-accurate","title":"Calibre: Towards Fair and Accurate Personalized Federated Learning with Self-Supervised Learning","date":"2024-12-28","arxiv_id":"2412.20020","repositories_listed":1,"syntology":null},{"url":"/paper/implementing-trust-in-non-small-cell-lung","slug":"implementing-trust-in-non-small-cell-lung","title":"Implementing Trust in Non-Small Cell Lung Cancer Diagnosis with a Conformalized Uncertainty-Aware AI Framework in Whole-Slide Images","date":"2024-12-28","arxiv_id":"2501.00053","repositories_listed":1,"syntology":null},{"url":"/paper/from-interets-to-insights-an-llm-approach-to","slug":"from-interets-to-insights-an-llm-approach-to","title":"From Interests to Insights: An LLM Approach to Course Recommendations Using Natural Language Queries","date":"2024-12-26","arxiv_id":"2412.19312","repositories_listed":1,"syntology":null},{"url":"/paper/iust-personreid-a-new-domain-in-person-re","slug":"iust-personreid-a-new-domain-in-person-re","title":"IUST_PersonReId: A New Domain in Person Re-Identification Datasets","date":"2024-12-25","arxiv_id":"2412.18874","repositories_listed":1,"syntology":null},{"url":"/paper/fap-cd-fairness-driven-age-friendly-community","slug":"fap-cd-fairness-driven-age-friendly-community","title":"FAP-CD: Fairness-Driven Age-Friendly Community Planning via Conditional Diffusion Generation","date":"2024-12-21","arxiv_id":"2412.16699","repositories_listed":1,"syntology":null},{"url":"/paper/decoding-fairness-a-reinforcement-learning","slug":"decoding-fairness-a-reinforcement-learning","title":"Decoding fairness: a reinforcement learning perspective","date":"2024-12-20","arxiv_id":"2412.16249","repositories_listed":1,"syntology":null},{"url":"/paper/autotrust-benchmarking-trustworthiness-in","slug":"autotrust-benchmarking-trustworthiness-in","title":"AutoTrust: Benchmarking Trustworthiness in Large Vision Language Models for Autonomous Driving","date":"2024-12-19","arxiv_id":"2412.15206","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/autotrust-benchmarking-trustworthiness-in#ran","syntology_url":"https://syntology.ai/paper/2412.15206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15206"}},"official":{"repos":["taco-group/autotrust"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/froc-building-fair-roc-from-a-trained","slug":"froc-building-fair-roc-from-a-trained","title":"FROC: Building Fair ROC from a Trained Classifier","date":"2024-12-19","arxiv_id":"2412.14724","repositories_listed":1,"syntology":null},{"url":"/paper/fairtp-a-prolonged-fairness-framework-for","slug":"fairtp-a-prolonged-fairness-framework-for","title":"FairTP: A Prolonged Fairness Framework for Traffic Prediction","date":"2024-12-18","arxiv_id":"2412.16214","repositories_listed":1,"syntology":null},{"url":"/paper/fairgp-a-scalable-and-fair-graph-transformer","slug":"fairgp-a-scalable-and-fair-graph-transformer","title":"FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning","date":"2024-12-14","arxiv_id":"2412.10669","repositories_listed":1,"syntology":null},{"url":"/paper/p-mean-regret-for-stochastic-bandits","slug":"p-mean-regret-for-stochastic-bandits","title":"p-Mean Regret for Stochastic Bandits","date":"2024-12-14","arxiv_id":"2412.10751","repositories_listed":1,"syntology":null},{"url":"/paper/who-s-the-multi-fairest-of-them-textsc-all","slug":"who-s-the-multi-fairest-of-them-textsc-all","title":"Who's the (Multi-)Fairest of Them All: Rethinking Interpolation-Based Data Augmentation Through the Lens of Multicalibration","date":"2024-12-13","arxiv_id":"2412.10575","repositories_listed":1,"syntology":null},{"url":"/paper/sprec-leveraging-self-play-to-debias","slug":"sprec-leveraging-self-play-to-debias","title":"SPRec: Leveraging Self-Play to Debias Preference Alignment for Large Language Model-based Recommendations","date":"2024-12-12","arxiv_id":"2412.09243","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sprec-leveraging-self-play-to-debias#ran","syntology_url":"https://syntology.ai/paper/2412.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09243"}},"official":{"repos":["regionch/sprec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/uplift-modeling-with-continuous-treatments-a","slug":"uplift-modeling-with-continuous-treatments-a","title":"Uplift modeling with continuous treatments: A predict-then-optimize approach","date":"2024-12-12","arxiv_id":"2412.09232","repositories_listed":1,"syntology":null},{"url":"/paper/coverage-based-fairness-in-multi-document","slug":"coverage-based-fairness-in-multi-document","title":"Coverage-based Fairness in Multi-document Summarization","date":"2024-12-11","arxiv_id":"2412.08795","repositories_listed":1,"syntology":null},{"url":"/paper/facex-understanding-face-attribute","slug":"facex-understanding-face-attribute","title":"FaceX: Understanding Face Attribute Classifiers through Summary Model Explanations","date":"2024-12-10","arxiv_id":"2412.07313","repositories_listed":1,"syntology":null},{"url":"/paper/razor-sharpening-knowledge-by-cutting-bias","slug":"razor-sharpening-knowledge-by-cutting-bias","title":"RAZOR: Sharpening Knowledge by Cutting Bias with Unsupervised Text Rewriting","date":"2024-12-10","arxiv_id":"2412.07675","repositories_listed":1,"syntology":null},{"url":"/paper/achieving-group-fairness-through-independence","slug":"achieving-group-fairness-through-independence","title":"Achieving Group Fairness through Independence in Predictive Process Monitoring","date":"2024-12-06","arxiv_id":"2412.04914","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-random-feature-model","slug":"differentially-private-random-feature-model","title":"Differentially Private Random Feature Model","date":"2024-12-06","arxiv_id":"2412.04785","repositories_listed":1,"syntology":null},{"url":"/paper/towards-counterfactual-fairness-thorough","slug":"towards-counterfactual-fairness-thorough","title":"Towards counterfactual fairness through auxiliary variables","date":"2024-12-06","arxiv_id":"2412.04767","repositories_listed":1,"syntology":null},{"url":"/paper/user-item-fairness-tradeoffs-in","slug":"user-item-fairness-tradeoffs-in","title":"User-item fairness tradeoffs in recommendations","date":"2024-12-05","arxiv_id":"2412.04466","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-without-demographics-through-2","slug":"fairness-without-demographics-through-2","title":"Fairness without Demographics through Learning Graph of Gradients","date":"2024-12-04","arxiv_id":"2412.03706","repositories_listed":1,"syntology":null},{"url":"/paper/lookahead-counterfactual-fairness","slug":"lookahead-counterfactual-fairness","title":"Lookahead Counterfactual Fairness","date":"2024-12-02","arxiv_id":"2412.01065","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-guide-to-explainable-ai-from","slug":"a-comprehensive-guide-to-explainable-ai-from","title":"A Comprehensive Guide to Explainable AI: From Classical Models to LLMs","date":"2024-12-01","arxiv_id":"2412.00800","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-social-determinants-of-health","slug":"integrating-social-determinants-of-health","title":"Integrating Social Determinants of Health into Knowledge Graphs: Evaluating Prediction Bias and Fairness in Healthcare","date":"2024-11-29","arxiv_id":"2412.00245","repositories_listed":1,"syntology":null},{"url":"/paper/abroca-distributions-for-algorithmic-bias","slug":"abroca-distributions-for-algorithmic-bias","title":"ABROCA Distributions For Algorithmic Bias Assessment: Considerations Around Interpretation","date":"2024-11-28","arxiv_id":"2411.19090","repositories_listed":1,"syntology":null},{"url":"/paper/fastswitch-optimizing-context-switching","slug":"fastswitch-optimizing-context-switching","title":"FastSwitch: Optimizing Context Switching Efficiency in Fairness-aware Large Language Model Serving","date":"2024-11-27","arxiv_id":"2411.18424","repositories_listed":1,"syntology":null},{"url":"/paper/metric-dst-mitigating-selection-bias-through","slug":"metric-dst-mitigating-selection-bias-through","title":"Metric-DST: Mitigating Selection Bias Through Diversity-Guided Semi-Supervised Metric Learning","date":"2024-11-27","arxiv_id":"2411.18442","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-multi-objective-reinforcement","slug":"scalable-multi-objective-reinforcement","title":"Scalable Multi-Objective Reinforcement Learning with Fairness Guarantees using Lorenz Dominance","date":"2024-11-27","arxiv_id":"2411.18195","repositories_listed":1,"syntology":null},{"url":"/paper/all-that-glitters-approaches-to-evaluations","slug":"all-that-glitters-approaches-to-evaluations","title":"\"All that Glitters\": Approaches to Evaluations with Unreliable Model and Human Annotations","date":"2024-11-23","arxiv_id":"2411.15634","repositories_listed":1,"syntology":null},{"url":"/paper/fairadapter-detecting-ai-generated-images","slug":"fairadapter-detecting-ai-generated-images","title":"FairAdapter: Detecting AI-generated Images with Improved Fairness","date":"2024-11-22","arxiv_id":"2411.14755","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-neural-joint-activity-in-spiking","slug":"exploring-neural-joint-activity-in-spiking","title":"Exploring Neural Joint Activity in Spiking Neural Networks for Fraud Detection","date":"2024-11-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-fraud-detection-with-1d","slug":"improving-fraud-detection-with-1d","title":"Improving Fraud Detection with 1D-Convolutional Spiking Neural Networks Through Bayesian Optimization","date":"2024-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/safes-sequential-privacy-and-fairness","slug":"safes-sequential-privacy-and-fairness","title":"SAFES: Sequential Privacy and Fairness Enhancing Data Synthesis for Responsible AI","date":"2024-11-14","arxiv_id":"2411.09178","repositories_listed":1,"syntology":null},{"url":"/paper/suremap-simultaneous-mean-estimation-for","slug":"suremap-simultaneous-mean-estimation-for","title":"SureMap: Simultaneous Mean Estimation for Single-Task and Multi-Task Disaggregated Evaluation","date":"2024-11-14","arxiv_id":"2411.09730","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/suremap-simultaneous-mean-estimation-for#ran","syntology_url":"https://syntology.ai/paper/2411.09730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.09730"}},"official":{"repos":["mkhodak/SureMap"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/optimisation-strategies-for-ensuring-fairness","slug":"optimisation-strategies-for-ensuring-fairness","title":"Optimisation Strategies for Ensuring Fairness in Machine Learning: With and Without Demographics","date":"2024-11-13","arxiv_id":"2411.09056","repositories_listed":1,"syntology":null},{"url":"/paper/properties-of-fairness-measures-in-the","slug":"properties-of-fairness-measures-in-the","title":"Properties of fairness measures in the context of varying class imbalance and protected group ratios","date":"2024-11-13","arxiv_id":"2411.08425","repositories_listed":1,"syntology":null},{"url":"/paper/a-stochastic-optimization-framework-for","slug":"a-stochastic-optimization-framework-for","title":"A Stochastic Optimization Framework for Private and Fair Learning From Decentralized Data","date":"2024-11-12","arxiv_id":"2411.07889","repositories_listed":1,"syntology":null},{"url":"/paper/aligning-visual-contrastive-learning-models","slug":"aligning-visual-contrastive-learning-models","title":"Aligning Visual Contrastive learning models via Preference Optimization","date":"2024-11-12","arxiv_id":"2411.08923","repositories_listed":1,"syntology":null},{"url":"/paper/fair-summarization-bridging-quality-and","slug":"fair-summarization-bridging-quality-and","title":"Fair Summarization: Bridging Quality and Diversity in Extractive Summaries","date":"2024-11-12","arxiv_id":"2411.07521","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-summarization-bridging-quality-and#ran","syntology_url":"https://syntology.ai/paper/2411.07521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07521"}},"official":{"repos":["PortNLP/FairEXTSummarizer"],"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","unlocated"]}}},{"url":"/paper/mitigating-bias-in-queer-representation","slug":"mitigating-bias-in-queer-representation","title":"Mitigating Bias in Queer Representation within Large Language Models: A Collaborative Agent Approach","date":"2024-11-12","arxiv_id":"2411.07656","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":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mitigating-bias-in-queer-representation#ran","syntology_url":"https://syntology.ai/paper/2411.07656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07656"}},"official":{"repos":["tonyhrule/queer-bias-llms"],"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/interpret-the-internal-states-of","slug":"interpret-the-internal-states-of","title":"Interpret the Internal States of Recommendation Model with Sparse Autoencoder","date":"2024-11-09","arxiv_id":"2411.06112","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-aware-resource-management-for-c-v2x","slug":"semantic-aware-resource-management-for-c-v2x","title":"Semantic-Aware Resource Management for C-V2X Platooning via Multi-Agent Reinforcement Learning","date":"2024-11-07","arxiv_id":"2411.04672","repositories_listed":1,"syntology":null},{"url":"/paper/policy-aggregation","slug":"policy-aggregation","title":"Policy Aggregation","date":"2024-11-06","arxiv_id":"2411.03651","repositories_listed":1,"syntology":null},{"url":"/paper/smoa-improving-multi-agent-large-language","slug":"smoa-improving-multi-agent-large-language","title":"SMoA: Improving Multi-agent Large Language Models with Sparse Mixture-of-Agents","date":"2024-11-05","arxiv_id":"2411.03284","repositories_listed":1,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"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) · 7 unverified","sample_list":"/paper/smoa-improving-multi-agent-large-language#ran","syntology_url":"https://syntology.ai/paper/2411.03284","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03284"}},"official":{"repos":["david-li0406/smoa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":7,"ran_from_kinds":["official"]}}}],"record_sha256":"ed05bf9028791344e5a29c201d263508fbfd163da6911d789a328f9246e28b34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}