Cover Image

Uncovering Fairness through Data Complexity as an Early Indicator

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ferreira, Juliett Suárez, Slavkovik, Marija, Casillas, Jorge
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Transparency and Proportionality in Post-Processing Algorithmic Bias Correction
by: Ferreira, Juliett Suárez, et al.
Published: (2025)

Am I Being Treated Fairly? A Conceptual Framework for Individuals to Ascertain Fairness
by: Ferreira, Juliett Suárez, et al.
Published: (2025)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

Constructing Decision Trees from Data Streams
by: Pham, Huy, et al.
Published: (2024)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
by: de Wynter, Adrian
Published: (2020)

Discovering Data Structures: Nearest Neighbor Search and Beyond
by: Salemohamed, Omar, et al.
Published: (2024)

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
by: Brita, Catalin E., et al.
Published: (2025)

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

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)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
by: Ganian, Robert, et al.
Published: (2025)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
by: Yao, Jasper
Published: (2025)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
by: Li, Dongyue, et al.
Published: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
by: Guan, Xinyu, et al.
Published: (2025)

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)

Approximate Lifted Model Construction
by: Luttermann, Malte, et al.
Published: (2025)

Online Learning with Probing for Sequential User-Centric Selection
by: Xu, Tianyi, et al.
Published: (2025)

Demand Selection for VRP with Emission Quota
by: Najar, Farid, et al.
Published: (2025)

Provably Learning from Modern Language Models via Low Logit Rank
by: Golowich, Noah, et al.
Published: (2025)

Fast EXP3 Algorithms
by: Sato, Ryoma, et al.
Published: (2025)

Provably Extracting the Features from a General Superposition
by: Liu, Allen
Published: (2025)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
by: Chee, Jerry, et al.
Published: (2025)

Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025)

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
by: Bini, Lorenzo, et al.
Published: (2025)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
by: Liu, Zhouyang, et al.
Published: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
by: McMahan, Jeremy
Published: (2025)

On Tradeoffs in Learning-Augmented Algorithms
by: Benomar, Ziyad, et al.
Published: (2025)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
by: Chen, Wen-Ling, et al.
Published: (2025)

Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
by: Ailon, Nir, et al.
Published: (2025)

Optimal Survival Trees: A Dynamic Programming Approach
by: Huisman, Tim, et al.
Published: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
by: Sun, Yiwen, et al.
Published: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)

Mini-Batch Kernel $k$-means
by: Jourdan, Ben, et al.
Published: (2024)

Model Stealing for Any Low-Rank Language Model
by: Liu, Allen, et al.
Published: (2024)

Block-Diagonal Guided DBSCAN Clustering
by: Zhao, Weibing
Published: (2024)

Contract Scheduling with Distributional and Multiple Advice
by: Angelopoulos, Spyros, et al.
Published: (2024)

SubGen: Token Generation in Sublinear Time and Memory
by: Zandieh, Amir, et al.
Published: (2024)

Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
by: Sharma, Vidya Sagar
Published: (2023)

The sample complexity of multi-distribution learning
by: Peng, Binghui
Published: (2023)