Cover Image

Correcting Underrepresentation and Intersectional Bias for Classification

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Diana, Emily, Tolbert, Alexander Williams
Format:	Preprint
Published:	2023
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

A Theoretical Model for Grit in Pursuing Ambitious Ends
by: Blum, Avrim, et al.
Published: (2025)

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

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

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

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

Fairness Implications of Encoding Protected Categorical Attributes
by: Mougan, Carlos, et al.
Published: (2022)

Fair Submodular Cover
by: Chen, Wenjing, 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)

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

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

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

Hardness of High-Dimensional Linear Classification
by: Munteanu, Alexander, et al.
Published: (2026)

Learning Intersections of Two Margin Halfspaces under Factorizable Distributions
by: Diakonikolas, Ilias, et al.
Published: (2025)

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

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

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

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

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

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

Optimal Dimension-Free Sampling for Regularized Classification
by: Alishahi, Meysam, et al.
Published: (2026)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
by: Klivans, Adam R., et al.
Published: (2024)

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

Online Classification with Predictions
by: Raman, Vinod, et al.
Published: (2024)

GEFL: Extended Filtration Learning for Graph Classification
by: Zhang, Simon, et al.
Published: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
by: Zhang, Guangyi, et al.
Published: (2026)

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

Low-degree phase transitions for detecting a planted clique in sublinear time
by: Mardia, Jay, et al.
Published: (2024)

Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
by: Krivošija, Amer, et al.
Published: (2025)

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

Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation
by: Munteanu, Alexander, et al.
Published: (2024)

Turnstile $\ell_p$ leverage score sampling with applications
by: Munteanu, Alexander, et al.
Published: (2024)

Scalable Learning of Multivariate Distributions via Coresets
by: Ding, Zeyu, et al.
Published: (2026)

Data subsampling for Poisson regression with pth-root-link
by: Lie, Han Cheng, et al.
Published: (2024)

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)

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

Scalable Learning of Item Response Theory Models
by: Frick, Susanne, et al.
Published: (2024)

Learning-Augmented Online Scheduling with Parsimonious Preemption
by: Blue, Mugen, et al.
Published: (2026)

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