{"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/17","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":17,"pages_in_order":57,"rows_per_page":100,"rows":[1601,1700],"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/16","next":"/task/fairness/papers/18","papers":[{"url":"/paper/balancing-efficiency-and-fairness-in-on","slug":"balancing-efficiency-and-fairness-in-on","title":"Balancing Efficiency and Fairness in On-Demand Ridesourcing","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/offline-contextual-bandits-with-high","slug":"offline-contextual-bandits-with-high","title":"Offline Contextual Bandits with High Probability Fairness Guarantees","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-making-stochastic-classifiers","slug":"on-making-stochastic-classifiers","title":"On Making Stochastic Classifiers Deterministic","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/paradoxes-in-fair-machine-learning","slug":"paradoxes-in-fair-machine-learning","title":"Paradoxes in Fair Machine Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fair-learning-to-rank-from-implicit-feedback","slug":"fair-learning-to-rank-from-implicit-feedback","title":"Policy-Gradient Training of Fair and Unbiased Ranking Functions","date":"2019-11-19","arxiv_id":"1911.08054","repositories_listed":1,"syntology":null},{"url":"/paper/fair-adversarial-gradient-tree-boosting","slug":"fair-adversarial-gradient-tree-boosting","title":"Fair Adversarial Gradient Tree Boosting","date":"2019-11-13","arxiv_id":"1911.05369","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/fair-adversarial-gradient-tree-boosting#ran","syntology_url":"https://syntology.ai/paper/1911.05369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05369"}},"official":null}},{"url":"/paper/fairness-aware-neural-reyni-minimization-for","slug":"fairness-aware-neural-reyni-minimization-for","title":"Fairness-Aware Neural Réyni Minimization for Continuous Features","date":"2019-11-12","arxiv_id":"1911.04929","repositories_listed":1,"syntology":null},{"url":"/paper/assessing-social-and-intersectional-biases-in","slug":"assessing-social-and-intersectional-biases-in","title":"Assessing Social and Intersectional Biases in Contextualized Word Representations","date":"2019-11-04","arxiv_id":"1911.01485","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-and-interpretable","slug":"learning-fair-and-interpretable","title":"Learning Fair and Interpretable Representations via Linear Orthogonalization","date":"2019-10-28","arxiv_id":"1910.12854","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-study-on-learning-fairness","slug":"an-empirical-study-on-learning-fairness","title":"An Empirical Study on Learning Fairness Metrics for COMPAS Data with Human Supervision","date":"2019-10-22","arxiv_id":"1910.10255","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-empirical-study-on-learning-fairness#ran","syntology_url":"https://syntology.ai/paper/1910.10255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10255"}},"official":{"repos":["hansen7/LearnFairMetric_Empirical"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/explainable-artificial-intelligence-xai","slug":"explainable-artificial-intelligence-xai","title":"Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AI","date":"2019-10-22","arxiv_id":"1910.10045","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-learning-of-fair-representations","slug":"conditional-learning-of-fair-representations","title":"Conditional Learning of Fair Representations","date":"2019-10-16","arxiv_id":"1910.07162","repositories_listed":1,"syntology":null},{"url":"/paper/does-gender-matter-towards-fairness-in","slug":"does-gender-matter-towards-fairness-in","title":"Does Gender Matter? Towards Fairness in Dialogue Systems","date":"2019-10-16","arxiv_id":"1910.10486","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/does-gender-matter-towards-fairness-in#ran","syntology_url":"https://syntology.ai/paper/1910.10486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10486"}},"official":{"repos":["zgahhblhc/DialogueFairness"],"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/on-tractable-computation-of-expected","slug":"on-tractable-computation-of-expected","title":"On Tractable Computation of Expected Predictions","date":"2019-10-05","arxiv_id":"1910.02182","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-tractable-computation-of-expected#ran","syntology_url":"https://syntology.ai/paper/1910.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02182"}},"official":{"repos":["UCLA-StarAI/mc2"],"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/the-bouncer-problem-challenges-to-remote","slug":"the-bouncer-problem-challenges-to-remote","title":"The Bouncer Problem: Challenges to Remote Explainability","date":"2019-10-03","arxiv_id":"1910.01432","repositories_listed":1,"syntology":null},{"url":"/paper/causal-modeling-for-fairness-in-dynamical","slug":"causal-modeling-for-fairness-in-dynamical","title":"Causal Modeling for Fairness in Dynamical Systems","date":"2019-09-18","arxiv_id":"1909.09141","repositories_listed":1,"syntology":null},{"url":"/paper/a-distributed-fair-machine-learning-framework","slug":"a-distributed-fair-machine-learning-framework","title":"A Distributed Fair Machine Learning Framework with Private Demographic Data Protection","date":"2019-09-17","arxiv_id":"1909.08081","repositories_listed":1,"syntology":null},{"url":"/paper/adafair-cumulative-fairness-adaptive-boosting","slug":"adafair-cumulative-fairness-adaptive-boosting","title":"AdaFair: Cumulative Fairness Adaptive Boosting","date":"2019-09-17","arxiv_id":"1909.08982","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/adafair-cumulative-fairness-adaptive-boosting#ran","syntology_url":"https://syntology.ai/paper/1909.08982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.08982"}},"official":{"repos":["iosifidisvasileios/AdaFair"],"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/alter-auxiliary-text-rewriting-tool-for","slug":"alter-auxiliary-text-rewriting-tool-for","title":"ALTER: Auxiliary Text Rewriting Tool for Natural Language Generation","date":"2019-09-14","arxiv_id":"1909.06564","repositories_listed":1,"syntology":null},{"url":"/paper/dl2-a-deep-learning-driven-scheduler-for-deep","slug":"dl2-a-deep-learning-driven-scheduler-for-deep","title":"DL2: A Deep Learning-driven Scheduler for Deep Learning Clusters","date":"2019-09-13","arxiv_id":"1909.06040","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-rule-lists","slug":"learning-fair-rule-lists","title":"Learning Fair Rule Lists","date":"2019-09-09","arxiv_id":"1909.03977","repositories_listed":1,"syntology":null},{"url":"/paper/master-your-metrics-with-calibration","slug":"master-your-metrics-with-calibration","title":"Master your Metrics with Calibration","date":"2019-09-06","arxiv_id":"1909.02827","repositories_listed":1,"syntology":null},{"url":"/paper/avoiding-resentment-via-monotonic-fairness","slug":"avoiding-resentment-via-monotonic-fairness","title":"Avoiding Resentment Via Monotonic Fairness","date":"2019-09-03","arxiv_id":"1909.01251","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-risk-assessments-evaluation","slug":"counterfactual-risk-assessments-evaluation","title":"Counterfactual Risk Assessments, Evaluation, and Fairness","date":"2019-08-30","arxiv_id":"1909.00066","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-warnings-and-fair-maml-learning","slug":"fairness-warnings-and-fair-maml-learning","title":"Fairness Warnings and Fair-MAML: Learning Fairly with Minimal Data","date":"2019-08-24","arxiv_id":"1908.09092","repositories_listed":1,"syntology":null},{"url":"/paper/bias-disparity-in-collaborative","slug":"bias-disparity-in-collaborative","title":"Bias Disparity in Collaborative Recommendation: Algorithmic Evaluation and Comparison","date":"2019-08-02","arxiv_id":"1908.00831","repositories_listed":1,"syntology":null},{"url":"/paper/fairsight-visual-analytics-for-fairness-in","slug":"fairsight-visual-analytics-for-fairness-in","title":"FairSight: Visual Analytics for Fairness in Decision Making","date":"2019-08-01","arxiv_id":"1908.00176","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-fair-classification","slug":"wasserstein-fair-classification","title":"Wasserstein Fair Classification","date":"2019-07-28","arxiv_id":"1907.12059","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/wasserstein-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1907.12059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12059"}},"official":{"repos":["deepmind/wasserstein_fairness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/faht-an-adaptive-fairness-aware-decision-tree","slug":"faht-an-adaptive-fairness-aware-decision-tree","title":"FAHT: An Adaptive Fairness-aware Decision Tree Classifier","date":"2019-07-16","arxiv_id":"1907.07237","repositories_listed":1,"syntology":null},{"url":"/paper/the-what-if-tool-interactive-probing-of","slug":"the-what-if-tool-interactive-probing-of","title":"The What-If Tool: Interactive Probing of Machine Learning Models","date":"2019-07-09","arxiv_id":"1907.04135","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-what-if-tool-interactive-probing-of#ran","syntology_url":"https://syntology.ai/paper/1907.04135","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04135"}},"official":{"repos":["pair-code/what-if-tool"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-sensitivity-of-counterfactual-fairness-to","slug":"the-sensitivity-of-counterfactual-fairness-to","title":"The Sensitivity of Counterfactual Fairness to Unmeasured Confounding","date":"2019-07-01","arxiv_id":"1907.01040","repositories_listed":1,"syntology":null},{"url":"/paper/fliptest-fairness-auditing-via-optimal","slug":"fliptest-fairness-auditing-via-optimal","title":"FlipTest: Fairness Testing via Optimal Transport","date":"2019-06-21","arxiv_id":"1906.09218","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/fliptest-fairness-auditing-via-optimal#ran","syntology_url":"https://syntology.ai/paper/1906.09218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09218"}},"official":null}},{"url":"/paper/coresets-for-clustering-with-fairness","slug":"coresets-for-clustering-with-fairness","title":"Coresets for Clustering with Fairness Constraints","date":"2019-06-20","arxiv_id":"1906.08484","repositories_listed":1,"syntology":null},{"url":"/paper/the-price-of-local-fairness-in-multistage","slug":"the-price-of-local-fairness-in-multistage","title":"The Price of Local Fairness in Multistage Selection","date":"2019-06-15","arxiv_id":"1906.06613","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-labeled-and-unlabeled-data-for","slug":"leveraging-labeled-and-unlabeled-data-for","title":"Leveraging Labeled and Unlabeled Data for Consistent Fair Binary Classification","date":"2019-06-12","arxiv_id":"1906.05082","repositories_listed":1,"syntology":null},{"url":"/paper/pairwise-fairness-for-ranking-and-regression","slug":"pairwise-fairness-for-ranking-and-regression","title":"Pairwise Fairness for Ranking and Regression","date":"2019-06-12","arxiv_id":"1906.05330","repositories_listed":1,"syntology":null},{"url":"/paper/propublicas-compas-data-revisited","slug":"propublicas-compas-data-revisited","title":"ProPublica's COMPAS Data Revisited","date":"2019-06-11","arxiv_id":"1906.04711","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-naive-bayes-classifiers-by","slug":"learning-fair-naive-bayes-classifiers-by","title":"Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination Patterns","date":"2019-06-10","arxiv_id":"1906.03843","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/learning-fair-naive-bayes-classifiers-by#ran","syntology_url":"https://syntology.ai/paper/1906.03843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03843"}},"official":{"repos":["UCLA-StarAI/LearnFairNB"],"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/quantifying-layerwise-information-discarding","slug":"quantifying-layerwise-information-discarding","title":"Quantification and Analysis of Layer-wise and Pixel-wise Information Discarding","date":"2019-06-10","arxiv_id":"1906.04109","repositories_listed":1,"syntology":null},{"url":"/paper/maximum-weighted-loss-discrepancy","slug":"maximum-weighted-loss-discrepancy","title":"Maximum Weighted Loss Discrepancy","date":"2019-06-08","arxiv_id":"1906.03518","repositories_listed":1,"syntology":null},{"url":"/paper/addictive-auctions-using-lucky-draw-and","slug":"addictive-auctions-using-lucky-draw-and","title":"Addictive Auctions: using lucky-draw and gambling addiction to increase participation during auctioning","date":"2019-06-07","arxiv_id":"1906.03237","repositories_listed":1,"syntology":null},{"url":"/paper/fair-distributions-from-biased-samples-a","slug":"fair-distributions-from-biased-samples-a","title":"Data preprocessing to mitigate bias: A maximum entropy based approach","date":"2019-06-05","arxiv_id":"1906.02164","repositories_listed":1,"syntology":null},{"url":"/paper/fair-near-neighbor-search-independent-range","slug":"fair-near-neighbor-search-independent-range","title":"Fair Near Neighbor Search: Independent Range Sampling in High Dimensions","date":"2019-06-05","arxiv_id":"1906.01859","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-near-neighbor-search-independent-range#ran","syntology_url":"https://syntology.ai/paper/1906.01859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.01859"}},"official":{"repos":["alfahaf/fair-near-neighbor-search"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/assessing-disparate-impacts-of-personalized","slug":"assessing-disparate-impacts-of-personalized","title":"Assessing Disparate Impacts of Personalized Interventions: Identifiability and Bounds","date":"2019-06-04","arxiv_id":"1906.01552","repositories_listed":1,"syntology":null},{"url":"/paper/towards-fair-and-decentralized-privacy","slug":"towards-fair-and-decentralized-privacy","title":"Towards Fair and Privacy-Preserving Federated Deep Models","date":"2019-06-04","arxiv_id":"1906.01167","repositories_listed":1,"syntology":null},{"url":"/paper/190600285","slug":"190600285","title":"Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combination","date":"2019-06-01","arxiv_id":"1906.00285","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-and-missing-values","slug":"fairness-and-missing-values","title":"Fairness and Missing Values","date":"2019-05-29","arxiv_id":"1905.12728","repositories_listed":1,"syntology":null},{"url":"/paper/average-individual-fairness-algorithms","slug":"average-individual-fairness-algorithms","title":"Average Individual Fairness: Algorithms, Generalization and Experiments","date":"2019-05-25","arxiv_id":"1905.10607","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/average-individual-fairness-algorithms#ran","syntology_url":"https://syntology.ai/paper/1905.10607","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10607"}},"official":{"repos":["SaeedSharifiMa/AIF"],"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/compositional-fairness-constraints-for-graph","slug":"compositional-fairness-constraints-for-graph","title":"Compositional Fairness Constraints for Graph Embeddings","date":"2019-05-25","arxiv_id":"1905.10674","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compositional-fairness-constraints-for-graph#ran","syntology_url":"https://syntology.ai/paper/1905.10674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10674"}},"official":{"repos":["joeybose/Flexible-Fairness-Constraints"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/eliciting-and-enforcing-subjective-individual","slug":"eliciting-and-enforcing-subjective-individual","title":"An Algorithmic Framework for Fairness Elicitation","date":"2019-05-25","arxiv_id":"1905.10660","repositories_listed":1,"syntology":null},{"url":"/paper/learning-fair-representations-via-an","slug":"learning-fair-representations-via-an","title":"Learning Fair Representations via an Adversarial Framework","date":"2019-04-30","arxiv_id":"1904.13341","repositories_listed":1,"syntology":null},{"url":"/paper/attraction-repulsion-clustering-with","slug":"attraction-repulsion-clustering-with","title":"Attraction-Repulsion clustering with applications to fairness","date":"2019-04-10","arxiv_id":"1904.05254","repositories_listed":1,"syntology":null},{"url":"/paper/fairvis-visual-analytics-for-discovering","slug":"fairvis-visual-analytics-for-discovering","title":"FairVis: Visual Analytics for Discovering Intersectional Bias in Machine Learning","date":"2019-04-10","arxiv_id":"1904.05419","repositories_listed":1,"syntology":null},{"url":"/paper/randomized-kaczmarz-algorithm-for-massive","slug":"randomized-kaczmarz-algorithm-for-massive","title":"Randomized Kaczmarz Algorithm for Massive MIMO Systems with Channel Estimation and Spatial Correlation","date":"2019-04-08","arxiv_id":"1904.04376","repositories_listed":1,"syntology":null},{"url":"/paper/learning-edge-properties-in-graphs-from-path","slug":"learning-edge-properties-in-graphs-from-path","title":"Learning Edge Properties in Graphs from Path Aggregations","date":"2019-03-11","arxiv_id":"1903.04613","repositories_listed":1,"syntology":null},{"url":"/paper/fair-logistic-regression-an-adversarial","slug":"fair-logistic-regression-an-adversarial","title":"Fairness for Robust Log Loss Classification","date":"2019-03-10","arxiv_id":"1903.03910","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-long-term-impact-of-algorithmic","slug":"on-the-long-term-impact-of-algorithmic","title":"On the Long-term Impact of Algorithmic Decision Policies: Effort Unfairness and Feature Segregation through Social Learning","date":"2019-03-04","arxiv_id":"1903.01209","repositories_listed":1,"syntology":null},{"url":"/paper/oracle-order-robust-adaptive-continual","slug":"oracle-order-robust-adaptive-continual","title":"Scalable and Order-robust Continual Learning with Additive Parameter Decomposition","date":"2019-02-25","arxiv_id":"1902.09432","repositories_listed":1,"syntology":null},{"url":"/paper/stable-and-fair-classification","slug":"stable-and-fair-classification","title":"Stable and Fair Classification","date":"2019-02-21","arxiv_id":"1902.07823","repositories_listed":1,"syntology":null},{"url":"/paper/the-fairness-of-risk-scores-beyond","slug":"the-fairness-of-risk-scores-beyond","title":"The Fairness of Risk Scores Beyond Classification: Bipartite Ranking and the xAUC Metric","date":"2019-02-15","arxiv_id":"1902.05826","repositories_listed":1,"syntology":null},{"url":"/paper/salus-fine-grained-gpu-sharing-primitives-for","slug":"salus-fine-grained-gpu-sharing-primitives-for","title":"Salus: Fine-Grained GPU Sharing Primitives for Deep Learning Applications","date":"2019-02-12","arxiv_id":"1902.04610","repositories_listed":1,"syntology":null},{"url":"/paper/policy-learning-for-fairness-in-ranking","slug":"policy-learning-for-fairness-in-ranking","title":"Policy Learning for Fairness in Ranking","date":"2019-02-11","arxiv_id":"1902.04056","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/policy-learning-for-fairness-in-ranking#ran","syntology_url":"https://syntology.ai/paper/1902.04056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.04056"}},"official":{"repos":["ashudeep/Fair-PGRank"],"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/scalable-fair-clustering","slug":"scalable-fair-clustering","title":"Scalable Fair Clustering","date":"2019-02-10","arxiv_id":"1902.03519","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/scalable-fair-clustering#ran","syntology_url":"https://syntology.ai/paper/1902.03519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.03519"}},"official":{"repos":["talwagner/fair_clustering"],"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/improving-consequential-decision-making-under","slug":"improving-consequential-decision-making-under","title":"Fair Decisions Despite Imperfect Predictions","date":"2019-02-08","arxiv_id":"1902.02979","repositories_listed":1,"syntology":null},{"url":"/paper/equal-opportunity-in-online-classification","slug":"equal-opportunity-in-online-classification","title":"Equal Opportunity in Online Classification with Partial Feedback","date":"2019-02-06","arxiv_id":"1902.02242","repositories_listed":1,"syntology":null},{"url":"/paper/sensitivenets-learning-agnostic","slug":"sensitivenets-learning-agnostic","title":"SensitiveNets: Learning Agnostic Representations with Application to Face Images","date":"2019-02-01","arxiv_id":"1902.00334","repositories_listed":1,"syntology":null},{"url":"/paper/noise-tolerant-fair-classification","slug":"noise-tolerant-fair-classification","title":"Noise-tolerant fair classification","date":"2019-01-30","arxiv_id":"1901.10837","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/noise-tolerant-fair-classification#ran","syntology_url":"https://syntology.ai/paper/1901.10837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10837"}},"official":{"repos":["AIasd/noise_fairlearn"],"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/fair-online-advertising","slug":"fair-online-advertising","title":"Toward Controlling Discrimination in Online Ad Auctions","date":"2019-01-29","arxiv_id":"1901.10450","repositories_listed":1,"syntology":null},{"url":"/paper/repairing-without-retraining-avoiding","slug":"repairing-without-retraining-avoiding","title":"Repairing without Retraining: Avoiding Disparate Impact with Counterfactual Distributions","date":"2019-01-29","arxiv_id":"1901.10501","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/repairing-without-retraining-avoiding#ran","syntology_url":"https://syntology.ai/paper/1901.10501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.10501"}},"official":{"repos":["ustunb/ctfdist"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/fair-regression-for-health-care-spending","slug":"fair-regression-for-health-care-spending","title":"Fair Regression for Health Care Spending","date":"2019-01-28","arxiv_id":"1901.10566","repositories_listed":1,"syntology":null},{"url":"/paper/fairwashing-the-risk-of-rationalization","slug":"fairwashing-the-risk-of-rationalization","title":"Fairwashing: the risk of rationalization","date":"2019-01-28","arxiv_id":"1901.09749","repositories_listed":1,"syntology":null},{"url":"/paper/fair-k-center-clustering-for-data","slug":"fair-k-center-clustering-for-data","title":"Fair k-Center Clustering for Data Summarization","date":"2019-01-24","arxiv_id":"1901.08628","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-risk-measures","slug":"fairness-risk-measures","title":"Fairness risk measures","date":"2019-01-24","arxiv_id":"1901.08665","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/fairness-risk-measures#ran","syntology_url":"https://syntology.ai/paper/1901.08665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08665"}},"official":null}},{"url":"/paper/fairness-with-dynamics","slug":"fairness-with-dynamics","title":"Algorithms for Fairness in Sequential Decision Making","date":"2019-01-24","arxiv_id":"1901.08568","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-with-dynamics#ran","syntology_url":"https://syntology.ai/paper/1901.08568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08568"}},"official":{"repos":["wmgithub/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/guarantees-for-spectral-clustering-with","slug":"guarantees-for-spectral-clustering-with","title":"Guarantees for Spectral Clustering with Fairness Constraints","date":"2019-01-24","arxiv_id":"1901.08668","repositories_listed":1,"syntology":null},{"url":"/paper/equalizing-gender-biases-in-neural-machine","slug":"equalizing-gender-biases-in-neural-machine","title":"Equalizing Gender Biases in Neural Machine Translation with Word Embeddings Techniques","date":"2019-01-10","arxiv_id":"1901.03116","repositories_listed":1,"syntology":null},{"url":"/paper/fair-algorithms-for-clustering","slug":"fair-algorithms-for-clustering","title":"Fair Algorithms for Clustering","date":"2019-01-08","arxiv_id":"1901.02393","repositories_listed":1,"syntology":null},{"url":"/paper/fighting-fire-with-fire-using-antidote-data","slug":"fighting-fire-with-fire-using-antidote-data","title":"Fighting Fire with Fire: Using Antidote Data to Improve Polarization and Fairness of Recommender Systems","date":"2018-12-02","arxiv_id":"1812.01504","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fighting-fire-with-fire-using-antidote-data#ran","syntology_url":"https://syntology.ai/paper/1812.01504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01504"}},"official":null}},{"url":"/paper/verifying-fairness-properties-via","slug":"verifying-fairness-properties-via","title":"Probabilistic Verification of Fairness Properties via Concentration","date":"2018-12-02","arxiv_id":"1812.02573","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/verifying-fairness-properties-via#ran","syntology_url":"https://syntology.ai/paper/1812.02573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.02573"}},"official":{"repos":["obastani/verifair"],"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/the-effect-of-heterogeneous-data-for","slug":"the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","arxiv_id":"1811.12254","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/the-effect-of-heterogeneous-data-for#ran","syntology_url":"https://syntology.ai/paper/1811.12254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12254"}},"official":null}},{"url":"/paper/fairness-under-unawareness-assessing","slug":"fairness-under-unawareness-assessing","title":"Fairness Under Unawareness: Assessing Disparity When Protected Class Is Unobserved","date":"2018-11-27","arxiv_id":"1811.11154","repositories_listed":1,"syntology":null},{"url":"/paper/intersectionality-multiple-group-fairness-in","slug":"intersectionality-multiple-group-fairness-in","title":"Intersectionality: Multiple Group Fairness in Expectation Constraints","date":"2018-11-25","arxiv_id":"1811.09960","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-robust-kidney-exchange","slug":"scalable-robust-kidney-exchange","title":"Scalable Robust Kidney Exchange","date":"2018-11-08","arxiv_id":"1811.03532","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/scalable-robust-kidney-exchange#ran","syntology_url":"https://syntology.ai/paper/1811.03532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03532"}},"official":{"repos":["duncanmcelfresh/RobustKidneyExchange"],"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/fairness-preserving-text-summarzation","slug":"fairness-preserving-text-summarzation","title":"Summarizing User-generated Textual Content: Motivation and Methods for Fairness in Algorithmic Summaries","date":"2018-10-22","arxiv_id":"1810.09147","repositories_listed":1,"syntology":null},{"url":"/paper/neural-styling-for-interpretable-fair","slug":"neural-styling-for-interpretable-fair","title":"Discovering Fair Representations in the Data Domain","date":"2018-10-15","arxiv_id":"1810.06755","repositories_listed":1,"syntology":null},{"url":"/paper/interpretable-fairness-via-target-labels-in","slug":"interpretable-fairness-via-target-labels-in","title":"Tuning Fairness by Balancing Target Labels","date":"2018-10-12","arxiv_id":"1810.05598","repositories_listed":1,"syntology":null},{"url":"/paper/from-soft-classifiers-to-hard-decisions-how","slug":"from-soft-classifiers-to-hard-decisions-how","title":"From Soft Classifiers to Hard Decisions: How fair can we be?","date":"2018-10-03","arxiv_id":"1810.02003","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactually-fair-prediction-using","slug":"counterfactually-fair-prediction-using","title":"Counterfactually Fair Prediction Using Multiple Causal Models","date":"2018-10-01","arxiv_id":"1810.00694","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-with-non-differentiable","slug":"optimization-with-non-differentiable","title":"Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals","date":"2018-09-11","arxiv_id":"1809.04198","repositories_listed":1,"syntology":null},{"url":"/paper/spatial-deep-learning-for-wireless-scheduling","slug":"spatial-deep-learning-for-wireless-scheduling","title":"Spatial Deep Learning for Wireless Scheduling","date":"2018-08-04","arxiv_id":"1808.01486","repositories_listed":1,"syntology":null},{"url":"/paper/automated-directed-fairness-testing","slug":"automated-directed-fairness-testing","title":"Automated Directed Fairness Testing","date":"2018-07-02","arxiv_id":"1807.00468","repositories_listed":1,"syntology":null},{"url":"/paper/nonconvex-optimization-for-regression-with","slug":"nonconvex-optimization-for-regression-with","title":"Nonconvex Optimization for Regression with Fairness Constraints","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/training-well-generalizing-classifiers-for","slug":"training-well-generalizing-classifiers-for","title":"Training Well-Generalizing Classifiers for Fairness Metrics and Other Data-Dependent Constraints","date":"2018-06-29","arxiv_id":"1807.00028","repositories_listed":1,"syntology":null},{"url":"/paper/fairness-without-demographics-in-repeated","slug":"fairness-without-demographics-in-repeated","title":"Fairness Without Demographics in Repeated Loss Minimization","date":"2018-06-20","arxiv_id":"1806.08010","repositories_listed":1,"syntology":null},{"url":"/paper/integral-privacy-for-sampling-from-mollifier","slug":"integral-privacy-for-sampling-from-mollifier","title":"Integral Privacy for Sampling","date":"2018-06-13","arxiv_id":"1806.04819","repositories_listed":1,"syntology":null},{"url":"/paper/blind-justice-fairness-with-encrypted","slug":"blind-justice-fairness-with-encrypted","title":"Blind Justice: Fairness with Encrypted Sensitive Attributes","date":"2018-06-08","arxiv_id":"1806.03281","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/blind-justice-fairness-with-encrypted#ran","syntology_url":"https://syntology.ai/paper/1806.03281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03281"}},"official":{"repos":["nikikilbertus/blind-justice"],"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/pots-protective-optimization-technologies","slug":"pots-protective-optimization-technologies","title":"POTs: Protective Optimization Technologies","date":"2018-06-07","arxiv_id":"1806.02711","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pots-protective-optimization-technologies#ran","syntology_url":"https://syntology.ai/paper/1806.02711","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02711"}},"official":{"repos":["spring-epfl/pots"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/explaining-explanations-an-overview-of","slug":"explaining-explanations-an-overview-of","title":"Explaining Explanations: An Overview of Interpretability of Machine Learning","date":"2018-05-31","arxiv_id":"1806.00069","repositories_listed":1,"syntology":null},{"url":"/paper/multiaccuracy-black-box-post-processing-for","slug":"multiaccuracy-black-box-post-processing-for","title":"Multiaccuracy: Black-Box Post-Processing for Fairness in Classification","date":"2018-05-31","arxiv_id":"1805.12317","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multiaccuracy-black-box-post-processing-for#ran","syntology_url":"https://syntology.ai/paper/1805.12317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.12317"}},"official":null}},{"url":"/paper/enhancing-the-accuracy-and-fairness-of-human","slug":"enhancing-the-accuracy-and-fairness-of-human","title":"Enhancing the Accuracy and Fairness of Human Decision Making","date":"2018-05-25","arxiv_id":"1805.10318","repositories_listed":1,"syntology":null}],"record_sha256":"7998e892a6c0d93b2d7e8cc0e0839e8898e8477f4038654391b489d51701e0dc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}