Cover Image

Fairness Implications of Encoding Protected Categorical Attributes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mougan, Carlos, Alvarez, Jose M., Ruggieri, Salvatore, Staab, Steffen
Format:	Preprint
Published:	2022
Subjects:	Machine Learning Computers and Society Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Causal Equal Protection as Algorithmic Fairness
by: Di Bello, Marcello, et al.
Published: (2024)

Fair Submodular Cover
by: Chen, Wenjing, et al.
Published: (2024)

Continuous Fairness On Data Streams
by: Ghosh, Subhodeep, et al.
Published: (2026)

Time Fairness in Online Knapsack Problems
by: Lechowicz, Adam, et al.
Published: (2023)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
by: Halabi, Marwa El, et al.
Published: (2023)

A Scalable Algorithm for Individually Fair K-means Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
by: Funk, Nicole, et al.
Published: (2026)

Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
by: Basu, Debabrota, et al.
Published: (2025)

Fair Clustering: Critique, Caveats, and Future Directions
by: Dickerson, John, et al.
Published: (2024)

Robust Fair Clustering with Group Membership Uncertainty Sets
by: Duppala, Sharmila, et al.
Published: (2024)

Correcting Underrepresentation and Intersectional Bias for Classification
by: Diana, Emily, et al.
Published: (2023)

Matchings, Predictions and Counterfactual Harm in Refugee Resettlement Processes
by: Lee, Seungeon, et al.
Published: (2024)

Generalizing Fair Top-$k$ Selection: An Integrative Approach
by: Cai, Guangya
Published: (2026)

Balanced Spanning Tree Distributions Have Separation Fairness
by: Chen, Harry, et al.
Published: (2025)

Welfare-Centric Clustering
by: Zhang, Claire Jie, et al.
Published: (2025)

Verifying Classification with Limited Disclosure
by: Bhandari, Siddharth, et al.
Published: (2025)

Scalable Algorithms for Individual Preference Stable Clustering
by: Mosenzon, Ron, et al.
Published: (2024)

Centralized Selection with Preferences in the Presence of Biases
by: Celis, L. Elisa, et al.
Published: (2024)

On the Hardness of Approximation of the Fair k-Center Problem
by: Thejaswi, Suhas
Published: (2026)

Fair Secretaries with Unfair Predictions
by: Balkanski, Eric, et al.
Published: (2024)

Modification-Fair Cluster Editing
by: Froese, Vincent, et al.
Published: (2021)

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
by: McWhorter, Atticus, et al.
Published: (2025)

Towards Fair Representation: Clustering and Consensus
by: Chakraborty, Diptarka, et al.
Published: (2025)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
by: Diakonikolas, Ilias, et al.
Published: (2025)

Protecting the Undeleted in Machine Unlearning
by: Cohen, Aloni, et al.
Published: (2026)

Online Multi-Class Selection with Group Fairness Guarantee
by: Zargari, Faraz, et al.
Published: (2025)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
by: Zhu, Yanhui, et al.
Published: (2024)

On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
by: Drexler, Lukas, et al.
Published: (2023)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
by: Maity, Binita, et al.
Published: (2024)

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
by: Zeng, Shiwei, et al.
Published: (2023)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
by: Song, Shihong, et al.
Published: (2024)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data
by: Li, Xiaoyu, et al.
Published: (2025)

Counterfactual Situation Testing: Uncovering Discrimination under Fairness given the Difference
by: Alvarez, Jose M., et al.
Published: (2023)

Fast and explainable clustering based on sorting
by: Chen, Xinye, et al.
Published: (2022)

Experimental Design Using Interlacing Polynomials
by: Lau, Lap Chi, et al.
Published: (2024)

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
by: Jiang, Minhui, et al.
Published: (2024)

Testing Calibration in Nearly-Linear Time
by: Hu, Lunjia, et al.
Published: (2024)

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search
by: Brous, Daniel, et al.
Published: (2025)