{"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/47","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":47,"pages_in_order":57,"rows_per_page":100,"rows":[4601,4700],"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/46","next":"/task/fairness/papers/48","papers":[{"url":null,"slug":"gender-bias-in-text-origin-taxonomy-and","title":"Gender Bias in Text: Origin, Taxonomy, and Implications","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stereotyping-norwegian-salmon-an-inventory-of","title":"Stereotyping Norwegian Salmon: An Inventory of Pitfalls in Fairness Benchmark Datasets","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-representation-learning-using","title":"Fair Representation Learning using Interpolation Enabled Disentanglement","date":"2021-07-31","arxiv_id":"2108.00295","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-fairness-discovery-and","title":"Adaptation and Generalization for Unknown Sensitive Factors of Variations","date":"2021-07-28","arxiv_id":"2107.13625","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-metrics-to-evaluate-the-performance-and","title":"New Metrics to Evaluate the Performance and Fairness of Personalized Federated Learning","date":"2021-07-28","arxiv_id":"2107.13173","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-free-and-fair-economy-a-game-of-justice-and","title":"A Free and Fair Economy: A Game of Justice and Inclusion","date":"2021-07-27","arxiv_id":"2107.12870","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-stacked-auto-encoders-for-fair","title":"Adversarial Stacked Auto-Encoders for Fair Representation Learning","date":"2021-07-27","arxiv_id":"2107.12826","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-guarantees-for-fairness-aware","title":"Statistical Guarantees for Fairness Aware Plug-In Algorithms","date":"2021-07-27","arxiv_id":"2107.12783","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-ethics-in-ai-with-ai-a-methodology","title":"Measuring Ethics in AI with AI: A Methodology and Dataset Construction","date":"2021-07-26","arxiv_id":"2107.11913","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-blame-attribution-for-accountable-multi","title":"On Blame Attribution for Accountable Multi-Agent Sequential Decision Making","date":"2021-07-26","arxiv_id":"2107.11927","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-with-fair-worker-selection","title":"Federated Learning with Fair Worker Selection: A Multi-Round Submodular Maximization Approach","date":"2021-07-25","arxiv_id":"2107.11728","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-are-you-optimizing-for-aligning","title":"What are you optimizing for? Aligning Recommender Systems with Human Values","date":"2021-07-22","arxiv_id":"2107.10939","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-reinforcement-learning-approach-for-7","title":"A Deep Reinforcement Learning Approach for Fair Traffic Signal Control","date":"2021-07-21","arxiv_id":"2107.10146","repositories_listed":0,"syntology":null},{"url":null,"slug":"leave-one-out-unfairness","title":"Leave-one-out Unfairness","date":"2021-07-21","arxiv_id":"2107.10171","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-gender-and-racial-disparities","title":"Understanding Gender and Racial Disparities in Image Recognition Models","date":"2021-07-20","arxiv_id":"2107.09211","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-reward-shaping-for-efficient","title":"Multimodal Reward Shaping for Efficient Exploration in Reinforcement Learning","date":"2021-07-19","arxiv_id":"2107.08888","repositories_listed":0,"syntology":null},{"url":null,"slug":"desiderata-for-explainable-ai-in-statistical","title":"Desiderata for Explainable AI in statistical production systems of the European Central Bank","date":"2021-07-18","arxiv_id":"2107.08045","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-verification-of-neural-networks","title":"Probabilistic Verification of Neural Networks Against Group Fairness","date":"2021-07-18","arxiv_id":"2107.08362","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-fairness-testing-of-neural","title":"Automatic Fairness Testing of Neural Classifiers through Adversarial Sampling","date":"2021-07-17","arxiv_id":"2107.08176","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-limit-data-collection-via-scaling","title":"Learning to Limit Data Collection via Scaling Laws: A Computational Interpretation for the Legal Principle of Data Minimization","date":"2021-07-16","arxiv_id":"2107.08096","repositories_listed":0,"syntology":null},{"url":null,"slug":"dire-committee-diversity-and-representation","title":"DiRe Committee : Diversity and Representation Constraints in Multiwinner Elections","date":"2021-07-15","arxiv_id":"2107.07356","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-sided-matching-meets-fair-division","title":"Two-Sided Matching Meets Fair Division","date":"2021-07-15","arxiv_id":"2107.07404","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-impossibility-of-non-trivial-accuracy","title":"On the impossibility of non-trivial accuracy under fairness constraints","date":"2021-07-14","arxiv_id":"2107.06944","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-summarization-for-justified","title":"Fairness-aware Summarization for Justified Decision-Making","date":"2021-07-13","arxiv_id":"2107.06243","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-impact-of-information-acquisition-and","title":"Making Auctions Robust to Aftermarkets","date":"2021-07-13","arxiv_id":"2107.05853","repositories_listed":0,"syntology":null},{"url":null,"slug":"trustworthy-ai-a-computational-perspective","title":"Trustworthy AI: A Computational Perspective","date":"2021-07-12","arxiv_id":"2107.06641","repositories_listed":0,"syntology":null},{"url":null,"slug":"impossibility-of-what-formal-and-substantive","title":"Escaping the Impossibility of Fairness: From Formal to Substantive Algorithmic Fairness","date":"2021-07-09","arxiv_id":"2107.04642","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiaccurate-proxies-for-downstream-fairness","title":"Multiaccurate Proxies for Downstream Fairness","date":"2021-07-09","arxiv_id":"2107.04423","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-over-parameterized-models-with-non","title":"Training Over-parameterized Models with Non-decomposable Objectives","date":"2021-07-09","arxiv_id":"2107.04641","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-based-approach-for-mitigating-multi","title":"A Graph-based Approach for Mitigating Multi-sided Exposure Bias in Recommender Systems","date":"2021-07-07","arxiv_id":"2107.03415","repositories_listed":0,"syntology":null},{"url":null,"slug":"bias-tolerant-fair-classification","title":"Bias-Tolerant Fair Classification","date":"2021-07-07","arxiv_id":"2107.03207","repositories_listed":0,"syntology":null},{"url":null,"slug":"impossibility-results-for-fair","title":"Impossibility results for fair representations","date":"2021-07-07","arxiv_id":"2107.03483","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-counterfactual-identification-from","title":"Nested Counterfactual Identification from Arbitrary Surrogate Experiments","date":"2021-07-07","arxiv_id":"2107.03190","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-modelling-for-model","title":"Bayesian Nonparametric Modelling for Model-Free Reinforcement Learning in LTE-LAA and Wi-Fi Coexistence","date":"2021-07-06","arxiv_id":"2107.02431","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-decision-rules-for-binary-classification","title":"Fair Decision Rules for Binary Classification","date":"2021-07-03","arxiv_id":"2107.01325","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-do-end-to-end-speech-models-learn-about","title":"What do End-to-End Speech Models Learn about Speaker, Language and Channel Information? A Layer-wise and Neuron-level Analysis","date":"2021-07-01","arxiv_id":"2107.00439","repositories_listed":0,"syntology":null},{"url":null,"slug":"unaware-fairness-hierarchical-random-forest","title":"Unaware Fairness: Hierarchical Random Forest for Protected Classes","date":"2021-06-30","arxiv_id":"2106.15767","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-comparative-fairness-for-human-auditing","title":"Non-Comparative Fairness for Human-Auditing and Its Relation to Traditional Fairness Notions","date":"2021-06-29","arxiv_id":"2107.01277","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-approximation-algorithms-for-4","title":"Improved Approximation Algorithms for Individually Fair Clustering","date":"2021-06-26","arxiv_id":"2106.14043","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-accuracy-and-fairness-for","title":"Balancing Accuracy and Fairness for Interactive Recommendation with Reinforcement Learning","date":"2021-06-25","arxiv_id":"2106.13386","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-classification-and-policy","title":"Constrained Classification and Policy Learning","date":"2021-06-24","arxiv_id":"2106.12886","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-will-it-take-to-generate-fairness","title":"What will it take to generate fairness-preserving explanations?","date":"2021-06-24","arxiv_id":"2106.13346","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-approach-to-fair-online-learning","title":"A Unified Approach to Fair Online Learning via Blackwell Approachability","date":"2021-06-23","arxiv_id":"2106.12242","repositories_listed":0,"syntology":null},{"url":null,"slug":"best-case-lower-bounds-in-online-learning","title":"Best-Case Lower Bounds in Online Learning","date":"2021-06-23","arxiv_id":"2106.12688","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-in-cardiac-mr-image-analysis-an","title":"Fairness in Cardiac MR Image Analysis: An Investigation of Bias Due to Data Imbalance in Deep Learning Based Segmentation","date":"2021-06-23","arxiv_id":"2106.12387","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-via-representation-neutralization","title":"Fairness via Representation Neutralization","date":"2021-06-23","arxiv_id":"2106.12674","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-robustness-improve-fairness-approaching","title":"Does Robustness Improve Fairness? Approaching Fairness with Word Substitution Robustness Methods for Text Classification","date":"2021-06-21","arxiv_id":"2106.10826","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-team-skill-aggregation-in-online","title":"Evaluating Team Skill Aggregation in Online Competitive Games","date":"2021-06-21","arxiv_id":"2106.11397","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-face-manipulation-detection-via","title":"Interpretable Face Manipulation Detection via Feature Whitening","date":"2021-06-21","arxiv_id":"2106.10834","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithmic-bias-and-data-bias-understanding","title":"Algorithmic Bias and Data Bias: Understanding the Relation between Distributionally Robust Optimization and Data Curation","date":"2021-06-17","arxiv_id":"2106.09467","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fair-and-ethical-healthcare-artificial","title":"A Fair and Ethical Healthcare Artificial Intelligence System for Monitoring Driver Behavior and Preventing Road Accidents","date":"2021-06-16","arxiv_id":"2107.14077","repositories_listed":0,"syntology":null},{"url":null,"slug":"costs-and-benefits-of-wasserstein-fair","title":"Costs and Benefits of Fair Regression","date":"2021-06-16","arxiv_id":"2106.08812","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-gender-bias-in-hindi-english","title":"Evaluating Gender Bias in Hindi-English Machine Translation","date":"2021-06-16","arxiv_id":"2106.08680","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-fairness-aware-information-retrieval","title":"FAIR: Fairness-Aware Information Retrieval Evaluation","date":"2021-06-16","arxiv_id":"2106.08527","repositories_listed":0,"syntology":null},{"url":null,"slug":"maxmin-fair-ranking-individual-fairness-under","title":"Maxmin-Fair Ranking: Individual Fairness under Group-Fairness Constraints","date":"2021-06-16","arxiv_id":"2106.08652","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-rigorous-theoretical-analysis-and","title":"Probing GNN Explainers: A Rigorous Theoretical and Empirical Analysis of GNN Explanation Methods","date":"2021-06-16","arxiv_id":"2106.09078","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-analysis-of-the-deployment-of-models","title":"An Analysis of the Deployment of Models Trained on Private Tabular Synthetic Data: Unexpected Surprises","date":"2021-06-15","arxiv_id":"2106.10241","repositories_listed":0,"syntology":null},{"url":null,"slug":"demographic-fairness-in-face-identification","title":"Demographic Fairness in Face Identification: The Watchlist Imbalance Effect","date":"2021-06-15","arxiv_id":"2106.08049","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-as-equality-of-opportunity-normative","title":"Fairness as Equality of Opportunity: Normative Guidance from Political Philosophy","date":"2021-06-15","arxiv_id":"2106.08259","repositories_listed":0,"syntology":null},{"url":null,"slug":"massive-wireless-energy-transfer-with","title":"Massive Wireless Energy Transfer with Statistical CSI Beamforming","date":"2021-06-15","arxiv_id":"2106.07988","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-large-cohort-training-for-federated","title":"On Large-Cohort Training for Federated Learning","date":"2021-06-15","arxiv_id":"2106.07820","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-explainable-ai-explain-unfairness-a","title":"Can Explainable AI Explain Unfairness? A Framework for Evaluating Explainable AI","date":"2021-06-14","arxiv_id":"2106.07483","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-clustering-under-a-bounded-cost","title":"Fair Clustering Under a Bounded Cost","date":"2021-06-14","arxiv_id":"2106.07239","repositories_listed":0,"syntology":null},{"url":null,"slug":"faircanary-rapid-continuous-explainable","title":"FairCanary: Rapid Continuous Explainable Fairness","date":"2021-06-13","arxiv_id":"2106.07057","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-multilingual-fairness-in-pre","title":"Assessing Multilingual Fairness in Pre-trained Multimodal Representations","date":"2021-06-12","arxiv_id":"2106.06683","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-for-cooperative-multi-agent-learning","title":"Cooperative Multi-Agent Fairness and Equivariant Policies","date":"2021-06-10","arxiv_id":"2106.05727","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-disaster-containment-via-graph-cut","title":"Fair Disaster Containment via Graph-Cut Problems","date":"2021-06-09","arxiv_id":"2106.05424","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-node-representation-learning","title":"Fairness-Aware Node Representation Learning","date":"2021-06-09","arxiv_id":"2106.05391","repositories_listed":0,"syntology":null},{"url":null,"slug":"bias-mitigation-of-face-recognition-models","title":"FairCal: Fairness Calibration for Face Verification","date":"2021-06-07","arxiv_id":"2106.03761","repositories_listed":0,"syntology":null},{"url":null,"slug":"securing-secure-aggregation-mitigating-multi","title":"Securing Secure Aggregation: Mitigating Multi-Round Privacy Leakage in Federated Learning","date":"2021-06-07","arxiv_id":"2106.03328","repositories_listed":0,"syntology":null},{"url":null,"slug":"highlighting-the-importance-of-reducing","title":"Highlighting the Importance of Reducing Research Bias and Carbon Emissions in CNNs","date":"2021-06-06","arxiv_id":"2106.03242","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-specific-effects-based-on-information","title":"Path-specific Effects Based on Information Accounts of Causality","date":"2021-06-06","arxiv_id":"2106.03178","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-contrastive-learning-removing","title":"Conditional Contrastive Learning for Improving Fairness in Self-Supervised Learning","date":"2021-06-05","arxiv_id":"2106.02866","repositories_listed":0,"syntology":null},{"url":null,"slug":"tetrad-actively-secure-4pc-for-secure","title":"Tetrad: Actively Secure 4PC for Secure Training and Inference","date":"2021-06-05","arxiv_id":"2106.02850","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-deep-learning-under","title":"Differentially Empirical Risk Minimization under the Fairness Lens","date":"2021-06-04","arxiv_id":"2106.02674","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-exploration-via-axiomatic-bargaining","title":"Fair Exploration via Axiomatic Bargaining","date":"2021-06-04","arxiv_id":"2106.02553","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-unsupervised-feature-selection","title":"Fairness-Aware Unsupervised Feature Selection","date":"2021-06-04","arxiv_id":"2106.02216","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-equal-gender-representation-in-the","title":"Towards Equal Gender Representation in the Annotations of Toxic Language Detection","date":"2021-06-04","arxiv_id":"2106.02183","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fairness-certification-in-artificial","title":"Towards Fairness Certification in Artificial Intelligence","date":"2021-06-04","arxiv_id":"2106.02498","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-improving-fairness-accuracy","title":"Understanding and Improving Fairness-Accuracy Trade-offs in Multi-Task Learning","date":"2021-06-04","arxiv_id":"2106.02705","repositories_listed":0,"syntology":null},{"url":null,"slug":"causality-in-neural-networks-an-extended","title":"Causality in Neural Networks -- An Extended Abstract","date":"2021-06-03","arxiv_id":"2106.05842","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-rankings-for-recommendation-in","title":"Optimizing Rankings for Recommendation in Matching Markets","date":"2021-06-03","arxiv_id":"2106.01941","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-group-fairness-via-optimal-transport","title":"Testing Group Fairness via Optimal Transport Projections","date":"2021-06-02","arxiv_id":"2106.01070","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-clustering-using-antidote-data","title":"Fair Clustering Using Antidote Data","date":"2021-06-01","arxiv_id":"2106.00600","repositories_listed":0,"syntology":null},{"url":null,"slug":"fish-fair-spatial-hotspots","title":"FiSH: Fair Spatial Hotspots","date":"2021-06-01","arxiv_id":"2106.06049","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-compositionality-of-neural-networks","title":"Improving Compositionality of Neural Networks by Decoding Representations to Inputs","date":"2021-06-01","arxiv_id":"2106.00769","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-measures-for-fairness","title":"Information Theoretic Measures for Fairness-aware Feature Selection","date":"2021-06-01","arxiv_id":"2106.00772","repositories_listed":0,"syntology":null},{"url":null,"slug":"demographic-fairness-in-biometric-systems","title":"Demographic Fairness in Biometric Systems: What do the Experts say?","date":"2021-05-31","arxiv_id":"2105.14844","repositories_listed":0,"syntology":null},{"url":null,"slug":"rawlsian-fair-adaptation-of-deep-learning","title":"Rawlsian Fair Adaptation of Deep Learning Classifiers","date":"2021-05-31","arxiv_id":"2105.14890","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-based-dynamic-service","title":"Reinforcement Learning-based Dynamic Service Placement in Vehicular Networks","date":"2021-05-31","arxiv_id":"2105.15022","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-distillation-with-personalization-in","title":"Unifying Distillation with Personalization in Federated Learning","date":"2021-05-31","arxiv_id":"2105.15191","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-pareto-simulated-annealing-to-address","title":"Using Pareto Simulated Annealing to Address Algorithmic Bias in Machine Learning","date":"2021-05-31","arxiv_id":"2105.15064","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-representations-by-compression","title":"Fair Representations by Compression","date":"2021-05-28","arxiv_id":"2105.14044","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-feature-distillation-for-visual","title":"Fair Feature Distillation for Visual Recognition","date":"2021-05-27","arxiv_id":"2106.04411","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-reinforcement-learning","title":"Bayesian Nonparametric Reinforcement Learning in LTE and Wi-Fi Coexistence","date":"2021-05-25","arxiv_id":"2105.12249","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-gap-between-explainable-ai-and","title":"Bridging the Gap Between Explainable AI and Uncertainty Quantification to Enhance Trustability","date":"2021-05-25","arxiv_id":"2105.11828","repositories_listed":0,"syntology":null},{"url":null,"slug":"fnas-uncertainty-aware-fast-neural","title":"FNAS: Uncertainty-Aware Fast Neural Architecture Search","date":"2021-05-25","arxiv_id":"2105.11694","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-hybrid-mac-design-with-reduced","title":"A Low-Delay MAC for IoT Applications: Decentralized Optimal Scheduling of Queues without Explicit State Information Sharing","date":"2021-05-24","arxiv_id":"2105.11213","repositories_listed":0,"syntology":null},{"url":null,"slug":"multifair-multi-group-fairness-in-machine","title":"InfoFair: Information-Theoretic Intersectional Fairness","date":"2021-05-24","arxiv_id":"2105.11069","repositories_listed":0,"syntology":null},{"url":null,"slug":"out-of-distribution-detection-in-dermatology","title":"Out-of-Distribution Detection in Dermatology using Input Perturbation and Subset Scanning","date":"2021-05-24","arxiv_id":"2105.11160","repositories_listed":0,"syntology":null}],"record_sha256":"d9d2af0f4cc394f56c72ef46c191794b189d7355e4a45b04c67e80d82d3fa6d4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}