{"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/53","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":53,"pages_in_order":57,"rows_per_page":100,"rows":[5201,5300],"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/52","next":"/task/fairness/papers/54","papers":[{"url":null,"slug":"self-paced-deep-regression-forests-with","title":"Self-Paced Deep Regression Forests with Consideration on Underrepresented Examples","date":"2020-04-03","arxiv_id":"2004.01459","repositories_listed":0,"syntology":null},{"url":null,"slug":"covariance-robust-dynamic-watermarking","title":"Covariance-Robust Dynamic Watermarking","date":"2020-03-31","arxiv_id":"2003.13908","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-ad-auctions-through-inverse","title":"Individual Fairness in Advertising Auctions through Inverse Proportionality","date":"2020-03-31","arxiv_id":"2003.13966","repositories_listed":0,"syntology":null},{"url":null,"slug":"overview-of-the-trec-2019-fair-ranking-track","title":"Overview of the TREC 2019 Fair Ranking Track","date":"2020-03-25","arxiv_id":"2003.11650","repositories_listed":0,"syntology":null},{"url":null,"slug":"unfair-exposure-of-artists-in-music","title":"Unfair Exposure of Artists in Music Recommendation","date":"2020-03-25","arxiv_id":"2003.11634","repositories_listed":0,"syntology":null},{"url":null,"slug":"absolute-shapley-value","title":"Absolute Shapley Value","date":"2020-03-23","arxiv_id":"2003.10076","repositories_listed":0,"syntology":null},{"url":null,"slug":"gender-representation-in-open-source-speech","title":"Gender Representation in Open Source Speech Resources","date":"2020-03-18","arxiv_id":"2003.08132","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-of-rate-fairness-in-multi-pair","title":"Optimization of Rate Fairness in Multi-Pair Wireless-Powered Relaying Systems","date":"2020-03-18","arxiv_id":"2003.08194","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-inference-on-error-prone-outcomes","title":"Fair inference on error-prone outcomes","date":"2020-03-17","arxiv_id":"2003.07621","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-fair-and-efficient-allocations-when","title":"Finding Fair and Efficient Allocations When Valuations Don't Add Up","date":"2020-03-16","arxiv_id":"2003.07060","repositories_listed":0,"syntology":null},{"url":null,"slug":"getting-fairness-right-towards-a-toolbox-for","title":"Getting Fairness Right: Towards a Toolbox for Practitioners","date":"2020-03-15","arxiv_id":"2003.06920","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-user-opinions-of-fairness-in","title":"Exploring User Opinions of Fairness in Recommender Systems","date":"2020-03-13","arxiv_id":"2003.06461","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-and-fairness-in-energy-harvesting-a","title":"Learning and Fairness in Energy Harvesting: A Maximin Multi-Armed Bandits Approach","date":"2020-03-13","arxiv_id":"2003.06213","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-analysis-of-simple-and-online-user","title":"Stability Analysis of Simple and Online User Association Policies for Millimeter Wave Networks","date":"2020-03-13","arxiv_id":"1905.00237","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-by-explicability-and-adversarial","title":"Fairness by Explicability and Adversarial SHAP Learning","date":"2020-03-11","arxiv_id":"2003.05330","repositories_listed":0,"syntology":null},{"url":null,"slug":"experimental-studies-in-general-game-playing","title":"Experimental Studies in General Game Playing: An Experience Report","date":"2020-03-06","arxiv_id":"2003.03410","repositories_listed":0,"syntology":null},{"url":null,"slug":"evidence-based-explanation-to-promote","title":"Evidence-based explanation to promote fairness in AI systems","date":"2020-03-03","arxiv_id":"2003.01525","repositories_listed":0,"syntology":null},{"url":null,"slug":"detection-and-mitigation-of-bias-in-ted-talk","title":"Detection and Mitigation of Bias in Ted Talk Ratings","date":"2020-03-02","arxiv_id":"2003.00683","repositories_listed":0,"syntology":null},{"url":null,"slug":"demonstrating-rosa-the-fairness-solution-for","title":"Demonstrating Rosa: the fairness solution for any Data Analytic pipeline","date":"2020-02-28","arxiv_id":"2003.00899","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-min-fairness-in-irs-aided-multi-cell-miso","title":"Max-Min Fairness in IRS-Aided Multi-Cell MISO Systems with Joint Transmit and Reflective Beamforming","date":"2020-02-28","arxiv_id":"2003.00906","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-hybrid-precoding-for-mmwave","title":"Fairness-Aware Hybrid Precoding for mmWave NOMA Unicast/Multicast Transmissions in Industrial IoT","date":"2020-02-27","arxiv_id":"2002.00698","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-tier-automated-planning-for-adaptive","title":"Multi-tier Automated Planning for Adaptive Behavior (Extended Version)","date":"2020-02-27","arxiv_id":"2002.12445","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-learning-with-prejudice-free","title":"Fairness-Aware Learning with Prejudice Free Representations","date":"2020-02-26","arxiv_id":"2002.12143","repositories_listed":0,"syntology":null},{"url":null,"slug":"counterfactual-fairness-removing-direct","title":"Counterfactual fairness: removing direct effects through regularization","date":"2020-02-25","arxiv_id":"2002.10774","repositories_listed":0,"syntology":null},{"url":null,"slug":"teaching-the-old-dog-new-tricks-supervised","title":"Teaching the Old Dog New Tricks: Supervised Learning with Constraints","date":"2020-02-25","arxiv_id":"2002.10766","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-bandit-learning-with-delayed-impact-of","title":"Bandit Learning with Delayed Impact of Actions","date":"2020-02-24","arxiv_id":"2002.10316","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-for-personal-knowledge","title":"Data Augmentation for Personal Knowledge Base Population","date":"2020-02-23","arxiv_id":"2002.10943","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-adversarial-networks","title":"Fair Adversarial Networks","date":"2020-02-23","arxiv_id":"2002.12144","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fairness-aware-relational-structures","title":"Learning Fairness-aware Relational Structures","date":"2020-02-21","arxiv_id":"2002.09471","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-fair-ai-for-managing-employees-in","title":"Designing Fair AI for Managing Employees in Organizations: A Review, Critique, and Design Agenda","date":"2020-02-20","arxiv_id":"2002.09054","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fair-scoring-functions-fairness","title":"Learning Fair Scoring Functions: Bipartite Ranking under ROC-based Fairness Constraints","date":"2020-02-19","arxiv_id":"2002.08159","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-resolution-in-algorithmic-fairness","title":"A Possibility in Algorithmic Fairness: Can Calibration and Equal Error Rates Be Reconciled?","date":"2020-02-18","arxiv_id":"2002.07676","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-prediction-with-endogenous-behavior","title":"Fair Prediction with Endogenous Behavior","date":"2020-02-18","arxiv_id":"2002.07147","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-solve-fair-k-center-in-massive-data","title":"How to Solve Fair $k$-Center in Massive Data Models","date":"2020-02-18","arxiv_id":"2002.07682","repositories_listed":0,"syntology":null},{"url":null,"slug":"individual-fairness-revisited-transferring","title":"Individual Fairness Revisited: Transferring Techniques from Adversarial Robustness","date":"2020-02-18","arxiv_id":"2002.07738","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigating-potential-factors-associated","title":"Investigating Potential Factors Associated with Gender Discrimination in Collaborative Recommender Systems","date":"2020-02-18","arxiv_id":"2002.07786","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-individually-fair-classifier-with","title":"Learning Individually Fair Classifier with Path-Specific Causal-Effect Constraint","date":"2020-02-17","arxiv_id":"2002.06746","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-fairness-constrained-model-using","title":"Convex Fairness Constrained Model Using Causal Effect Estimators","date":"2020-02-16","arxiv_id":"2002.06501","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-principal-component-analysis-and-filter","title":"Fair Principal Component Analysis and Filter Design","date":"2020-02-16","arxiv_id":"2002.06557","repositories_listed":0,"syntology":null},{"url":null,"slug":"pipeline-interventions","title":"Pipeline Interventions","date":"2020-02-16","arxiv_id":"2002.06592","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-for-fair-team-formation-in-online","title":"Algorithms for Fair Team Formation in Online Labour Marketplaces","date":"2020-02-14","arxiv_id":"2002.11621","repositories_listed":0,"syntology":null},{"url":null,"slug":"symbolic-controller-synthesis-for-b-uchi","title":"Symbolic Controller Synthesis for B\\\"uchi Specifications on Stochastic Systems","date":"2020-02-14","arxiv_id":"1910.12137","repositories_listed":0,"syntology":null},{"url":null,"slug":"metric-free-individual-fairness-in-online","title":"Metric-Free Individual Fairness in Online Learning","date":"2020-02-13","arxiv_id":"2002.05474","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-dynamics-and-user-attitudes-on","title":"Trust dynamics and user attitudes on recommendation errors: preliminary results","date":"2020-02-11","arxiv_id":"2002.04302","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-correlation-clustering-1","title":"Fair Correlation Clustering","date":"2020-02-10","arxiv_id":"2002.03508","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-and-inclusion-metrics-in-subset","title":"Diversity and Inclusion Metrics in Subset Selection","date":"2020-02-09","arxiv_id":"2002.03256","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-initialisation-based-on-hospital","title":"A novel initialisation based on hospital-resident assignment for the k-modes algorithm","date":"2020-02-07","arxiv_id":"2002.02701","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-optimization-of-ai-fairness-and-utility","title":"Joint Optimization of AI Fairness and Utility: A Human-Centered Approach","date":"2020-02-05","arxiv_id":"2002.01621","repositories_listed":0,"syntology":null},{"url":null,"slug":"fae-a-fairness-aware-ensemble-framework","title":"FAE: A Fairness-Aware Ensemble Framework","date":"2020-02-03","arxiv_id":"2002.00695","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-allocation-based-soft-load-shedding","title":"Fair Allocation Based Soft Load Shedding","date":"2020-02-02","arxiv_id":"2002.00451","repositories_listed":0,"syntology":null},{"url":null,"slug":"cooperative-energy-scheduling-for-microgrids","title":"Cooperative Energy Scheduling for Microgrids under Peak Demand Energy Plans","date":"2020-01-31","arxiv_id":"2001.11983","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-constraint-definability-in-tractable","title":"On Constraint Definability in Tractable Probabilistic Models","date":"2020-01-29","arxiv_id":"2001.11349","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounded-incentives-in-manipulating-the","title":"Bounded Incentives in Manipulating the Probabilistic Serial Rule","date":"2020-01-28","arxiv_id":"2001.10640","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-lagrangian-dual-framework-for-deep-neural","title":"Lagrangian Duality for Constrained Deep Learning","date":"2020-01-26","arxiv_id":"2001.09394","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-fairness-of-randomized-trials-for","title":"On the Fairness of Randomized Trials for Recommendation with Heterogeneous Demographics and Beyond","date":"2020-01-25","arxiv_id":"2001.09328","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-fairness","title":"Algorithmic Fairness","date":"2020-01-21","arxiv_id":"2001.09784","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-incentives-that-shape-behaviour","title":"The Incentives that Shape Behaviour","date":"2020-01-20","arxiv_id":"2001.07118","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-gradient-sparsification-for","title":"Adaptive Gradient Sparsification for Efficient Federated Learning: An Online Learning Approach","date":"2020-01-14","arxiv_id":"2001.04756","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-and-fair","title":"Differentially Private and Fair Classification via Calibrated Functional Mechanism","date":"2020-01-14","arxiv_id":"2001.04958","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-learning-based-sequential","title":"Fairness in Learning-Based Sequential Decision Algorithms: A Survey","date":"2020-01-14","arxiv_id":"2001.04861","repositories_listed":0,"syntology":null},{"url":null,"slug":"debate-dynamics-for-human-comprehensible-fact","title":"Debate Dynamics for Human-comprehensible Fact-checking on Knowledge Graphs","date":"2020-01-09","arxiv_id":"2001.03436","repositories_listed":0,"syntology":null},{"url":null,"slug":"theory-in-theory-out-how-social-theory-can","title":"Theory In, Theory Out: The uses of social theory in machine learning for social science","date":"2020-01-09","arxiv_id":"2001.03203","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-fairness-from-a-non-ideal","title":"Algorithmic Fairness from a Non-ideal Perspective","date":"2020-01-08","arxiv_id":"2001.09773","repositories_listed":0,"syntology":null},{"url":null,"slug":"recast-interactive-auditing-of-automatic","title":"RECAST: Interactive Auditing of Automatic Toxicity Detection Models","date":"2020-01-07","arxiv_id":"2001.01819","repositories_listed":0,"syntology":null},{"url":null,"slug":"vamsa-tracking-provenance-in-data-science","title":"Vamsa: Automated Provenance Tracking in Data Science Scripts","date":"2020-01-07","arxiv_id":"2001.01861","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-consequentialism-and-fairness","title":"On Consequentialism and Fairness","date":"2020-01-02","arxiv_id":"2001.00329","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-k-centers-via-maximum-matching","title":"Fair k-Centers via Maximum Matching","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-solve-fair-k-center-in-massive-data-1","title":"How to Solve Fair k-Center in Massive Data Models","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"individual-fairness-for-k-clustering-1","title":"(Individual) Fairness for k-Clustering","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fair-policies-in-multi-objective","title":"Learning Fair Policies in Multi-Objective (Deep) Reinforcement Learning with Average and Discounted Rewards","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"model-agnostic-characterization-of-fairness-1","title":"Model-Agnostic Characterization of Fairness Trade-offs","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-simple-ways-to-learn-individual-fairness-1","title":"Two Simple Ways to Learn Individual Fairness Metric from Data","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-semi-supervised-learning-for","title":"Leveraging Semi-Supervised Learning for Fairness using Neural Networks","date":"2019-12-31","arxiv_id":"1912.13230","repositories_listed":0,"syntology":null},{"url":null,"slug":"individual-specialization-in-multi-task","title":"Individual specialization in multi-task environments with multiagent reinforcement learners","date":"2019-12-29","arxiv_id":"1912.12671","repositories_listed":0,"syntology":null},{"url":null,"slug":"achieving-arbitrary-throughput-fairness-trade","title":"Achieving Arbitrary Throughput-Fairness Trade-offs in the Inter Cell Interference Coordination with Fixed Transmit Power Problem","date":"2019-12-27","arxiv_id":"1912.12001","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-cooperative-game-theory-based-rate","title":"Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP","date":"2019-12-27","arxiv_id":"1912.11954","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-fairness-and-language-theoretic","title":"Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains","date":"2019-12-24","arxiv_id":"1912.11203","repositories_listed":0,"syntology":null},{"url":null,"slug":"where-are-we-using-scopus-to-map-the","title":"Where Are We? Using Scopus to Map the Literature at the Intersection Between Artificial Intelligence and Research on Crime","date":"2019-12-23","arxiv_id":"1912.11084","repositories_listed":0,"syntology":null},{"url":null,"slug":"lessons-from-archives-strategies-for","title":"Lessons from Archives: Strategies for Collecting Sociocultural Data in Machine Learning","date":"2019-12-22","arxiv_id":"1912.10389","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-and-holistic-review-informing-human","title":"AI and Holistic Review: Informing Human Reading in College Admissions","date":"2019-12-17","arxiv_id":"1912.09318","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-personal-is-machine-learning","title":"How Personal is Machine Learning Personalization?","date":"2019-12-17","arxiv_id":"1912.07938","repositories_listed":0,"syntology":null},{"url":null,"slug":"ltlf-synthesis-with-fairness-and-stability","title":"LTLf Synthesis with Fairness and Stability Assumptions","date":"2019-12-17","arxiv_id":"1912.07804","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-assessment-for-artificial","title":"Fairness Assessment for Artificial Intelligence in Financial Industry","date":"2019-12-16","arxiv_id":"1912.07211","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-mental-phenomena-psychophysics-as","title":"Artificial mental phenomena: Psychophysics as a framework to detect perception biases in AI models","date":"2019-12-15","arxiv_id":"1912.10818","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-multi-agent-reinforcement","title":"Fairness in Multi-agent Reinforcement Learning for Stock Trading","date":"2019-12-14","arxiv_id":"2001.00918","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-apparent-conflict-between-individual","title":"On the Apparent Conflict Between Individual and Group Fairness","date":"2019-12-14","arxiv_id":"1912.06883","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-contextual-multi-armed-bandits-theory","title":"Fair Contextual Multi-Armed Bandits: Theory and Experiments","date":"2019-12-13","arxiv_id":"1912.08055","repositories_listed":0,"syntology":null},{"url":null,"slug":"measurement-and-fairness","title":"Measurement and Fairness","date":"2019-12-11","arxiv_id":"1912.05511","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-evaluate-the-next-system-automatic","title":"How to Evaluate the Next System: Automatic Dialogue Evaluation from the Perspective of Continual Learning","date":"2019-12-10","arxiv_id":"1912.04664","repositories_listed":0,"syntology":null},{"url":null,"slug":"astra-high-throughput-3pc-over-rings-with","title":"ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction","date":"2019-12-05","arxiv_id":"1912.02592","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-from-biased-data-can-fairness","title":"Recovering from Biased Data: Can Fairness Constraints Improve Accuracy?","date":"2019-12-02","arxiv_id":"1912.01094","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-human-aligned-risk-minimization","title":"On Human-Aligned Risk Minimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-fairness-a-trade-off-revisited","title":"Unlocking Fairness: a Trade-off Revisited","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fairprep-promoting-data-to-a-first-class","title":"FairPrep: Promoting Data to a First-Class Citizen in Studies on Fairness-Enhancing Interventions","date":"2019-11-28","arxiv_id":"1911.12587","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-relationship-between-trust-in-ai-and","title":"The relationship between trust in AI and trustworthy machine learning technologies","date":"2019-11-27","arxiv_id":"1912.00782","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-peer-to-peer-negotiation-for-energy","title":"Automated Peer-to-peer Negotiation for Energy Contract Settlements in Residential Cooperatives","date":"2019-11-26","arxiv_id":"1911.12303","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-self-adaptive-synthetic-over-sampling","title":"A Self-Adaptive Synthetic Over-Sampling Technique for Imbalanced Classification","date":"2019-11-25","arxiv_id":"1911.11018","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-in-the-eyes-of-others","title":"Fair in the Eyes of Others","date":"2019-11-25","arxiv_id":"1911.11053","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairyted-a-fair-rating-predictor-for-ted-talk","title":"FairyTED: A Fair Rating Predictor for TED Talk Data","date":"2019-11-25","arxiv_id":"1911.11558","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-algorithms-for-fair-division-of-mixed","title":"Greedy Algorithms for Fair Division of Mixed Manna","date":"2019-11-25","arxiv_id":"1911.11005","repositories_listed":0,"syntology":null}],"record_sha256":"8eeeefc8b8c0b5a22276e67ab77645286dc89753e7dd0847a046257f8d0bb141","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}