Proposes FairDRL-ST for fair spatio-temporal mobility prediction.
problem Fairness concerns in spatio-temporal AI applications.
method Disentangled representation learning, adversarial learning.
result Achieves fairness in spatio-temporal mobility prediction without performance loss.
The paper explores fair treatment in financial exchanges, finding unbounded fairness unrealistic and proposing ε-fairness as a solution.
problem Ensuring fair treatment of all competing participants in financial exchanges.
method Investigation of unbounded temporal fairness, analysis of real-world incidents, introduction of ε-fairness.
result Unbounded temporal fairness is unrealistic in FIFO markets, and ε-fairness provides a viable alternative.
Fairness in machine learning has predominantly been studied in static classification settings without concern for how decisions change the underlying population over time. Conventional wisdom suggests that fairness criteria promote the long-term well-being of those groups they aim to protect. We study how static fairne…
Develops causal framework for fair survival analysis in healthcare.
problem Fairness in survival analysis for high-stakes domains like healthcare.
method Causal framework using graphical models, conditional survival function, and Causal Reduction Theorem.
result Decomposes disparities in survival into direct, indirect, and spurious pathways.
Since many critical decisions impacting human lives are increasingly being made by algorithms, it is important to ensure that the treatment of individuals under such algorithms is demonstrably fair under reasonable notions of fairness. One compelling notion proposed in the literature is that of individual fairness (IF)…
New datasets improve fairness research by revealing UCI Adult's limitations.
problem Limitations of UCI Adult dataset in fairness research.
method Reconstructed a superset of UCI Adult data from US Census sources.
result New datasets reveal trade-offs between fairness criteria and performance.
This paper tackles fair same-day delivery service by optimizing regional service rates.
problem Fairness in same-day delivery service for different neighborhoods.
method Partition service area into regions, use multi-objective Markov decision process and deep Q-learning.
result Our approach maximizes fairness across all regions while maintaining overall service rate.
While historically, economists have been primarily occupied with analyzing the behaviour of the markets, electronic trading gave rise to a new class of unprecedented problems associated with market fairness, transparency and manipulation. These problems stem from technical shortcomings that are not accounted for in the…
Study optimizes health incentives to balance efficiency and fairness.
problem Designing health incentives to balance efficiency and fairness.
method Inverse behavioral optimization framework integrating QALY-based incentives and adaptive learning.
result Modern health systems operate near an efficiency-saturated frontier, with small fairness adjustments yielding diminishing returns.
The paper introduces return parity for fairness in MDPs, addressing delayed and adverse effects.
problem Fairness in MDPs for dynamic domains with delayed and adverse effects.
method Proposes return parity, decomposes return disparity, and develops algorithms for state visitation distributional alignment.
result The proposed algorithms can successfully close the disparity gap while maintaining policy performance.
This paper proposes a new framework for financial risk that considers predictability rather than volatility.
problem Volatility's limitations as a risk measure, especially in complex strategies and non-stationary markets.
method Developed a new paradigm based on stochastic processes and the Multifractional Process with Random Exponent (MPRE) framework.
result A formal definition of 'fair volatility' that aligns with market efficiency and provides a measure of market inefficiency.
CCI combines Bayesian and gradient boosting to create fair, reliable credit risk scores.
problem Tackles high-stakes lending decisions with changing data distributions and fairness constraints.
method Combines Bayesian neural risk scorer and fairness-constrained gradient boosting with shift-aware fusion.
result CCI achieves best trade-off between discrimination, calibration, stability, and fairness.
A new method aligns convolution filters for temporal sequences using Dynamic Time Warp.
problem Improving deep learning models' ability to handle temporal sequence data.
method Integrates Dynamic Time Warp algorithm into 1-D convolution layers for better alignment of input and filter.
result Exceeds or matches standard 1-D convolution layers in time series classification tasks.
TimeGraph creates synthetic datasets for robust time-series causal discovery.
problem Lack of reliable synthetic benchmark datasets for robust time-series causal discovery.
method Developed comprehensive synthetic datasets with temporal properties, including trends, seasonality, and noise.
result Demonstrated significant variations in algorithm performance under realistic temporal conditions.
Two simple methods learn fair metrics from data to improve fairness in ML tasks.
problem Lack of widely accepted fair metrics for many ML tasks hinders individual fairness adoption.
method Presented two simple ways to learn fair metrics from various data types.
result Fair training with learned metrics improves fairness on three ML tasks.
New concept of within-group fairness improves AI fairness without sacrificing accuracy.
problem Fairness issues in AI models treating individuals in the same sensitive group unfairly.
method Introducing within-group fairness, proposing mathematical definitions, and developing learning algorithms.
result Improves within-group fairness without sacrificing accuracy and between-group fairness.
A new fairness metric for decision-making algorithms, conditioning on known fair variables.
problem Fairness issues in decision-making systems.
method Conditional fairness metric, Derivable Conditional Fairness Regularizer (DCFR), adversarial representation.
result Traditional fairness notations are special cases of the new conditional fairness notation.
Fair Mixup improves fairness in classifiers by interpolating between groups.
problem Ensuring fairness in classifiers during training and evaluation.
method Fair Mixup uses interpolation of samples between groups to enforce fairness constraints.
result Fair Mixup ensures better generalization of fairness in various benchmarks.
Paper proposes a modified fairness constraint to address shortcomings of counterfactual fairness.
problem Counterfactual fairness is not a necessary condition for algorithmic fairness.
method Analyzed hypothetical scenario and explicated discrimination to develop causal relevance fairness.
result Causal relevance fairness is a modified constraint that circumvents shortcomings of counterfactual fairness.
DFL framework improves action and outcome fairness in policy learning.
problem Fairness in policy learning, especially action and outcome fairness.
method Integrates action and outcome fairness into a multi-objective optimization problem using a lexicographic weighted Tchebyshev method.
result DFL framework improves both action and outcome fairness with minimal value reduction.
The paper explores fairness in multi-component recommender systems.
problem How to ensure fairness in recommender systems composed of multiple models.
method Study of fairness ranking metrics, theoretical analysis, and empirical evaluation.
result Fairness in recommendation systems can be achieved by improving individual components.
The paper connects counterfactual fairness to robust prediction and group fairness using causal context.
problem The challenge of ensuring fairness in AI systems when counterfactuals cannot be directly observed.
method Using causal context to bridge counterfactual fairness, robust prediction, and group fairness.
result Counterfactual fairness is equivalent to group fairness metrics in specific contexts.
New fairness notion helps identify fair auditors for evaluating decision-support systems.
problem Identifying fair auditors to evaluate decision-support systems for bias.
method Introducing a non-comparative fairness notion based on desired system properties.
result The proposed fairness notion provides guarantees in terms of comparative fairness.
Introduces principal fairness for fair decision-making.
problem Discrimination among similarly affected individuals.
method Uses principal stratification from causal inference.
result Explicitly accounts for decision impacts, not just protected attributes.
FCA improves fair clustering by optimizing utility and fairness.
problem Balancing fairness and utility in clustering.
method FCA alternates between aligning data and optimizing cluster centers in an aligned space.
result FCA achieves a superior trade-off between fairness and utility.
Fair MP-Boost improves fairness and interpretability in boosting methods.
problem Improving fairness and interpretability in boosting methods.
method Fair MP-Boost uses adaptive sampling of minipatches to balance accuracy and fairness.
result Fair MP-Boost enhances fairness and accuracy while providing interpretable feature importance.
New framework for fair ranking with noisy protected attributes.
problem Errors in socially-salient attributes undermine fairness guarantees.
method Modeling perturbations in protected attributes and incorporating probabilistic information.
result Framework provides provable guarantees on fairness and utility.
Algorithm samples fair rankings to ensure individual fairness while maintaining group fairness.
problem Fair ranking tasks with group fairness constraints and uncertainty in item utilities.
method Efficient algorithm that samples rankings from an individually-fair distribution ensuring group fairness.
result Expected utility of output ranking is at least α times optimal fair solution, where α depends on utilities and constraints.
The paper explores fairness in credit scoring using machine learning.
problem The lack of research on fair machine learning in credit scoring.
method Revisits statistical fairness criteria, catalogs algorithmic options, and empirically compares fairness processors.
result Multiple fairness criteria can be approximately satisfied at once, and fair processors deliver a good balance between profit and fairness.
Proposes a method to achieve quantile fairness in predictions.
problem Lack of research on quantile fairness in socially sensitive domains.
method Introduces a framework to learn a real-valued quantile function under Demographic Parity fairness.
result Demonstrates superior empirical performance and uncovering fairness-accuracy trade-offs.
Proposes FACT, a diagnostic for understanding group fairness trade-offs.
problem Group fairness notions often conflict with each other, requiring a cost in model performance.
method Characterizes trade-offs via the fairness-confusion tensor and optimizes accuracy and fairness objectives.
result Demonstrates the use of FACT on synthetic and real datasets to understand accuracy-fairness trade-offs.
Proposes individual fairness for clustering, making data points prefer their own cluster.
problem No fair clustering for clustering data points.
method Introduces a new fairness notion for clustering and studies its feasibility and heuristics.
result Individual fairness for clustering is NP-hard in general but feasible for one-dimensional data.
Unified approach for fair classification with overlapping groups.
problem Ensuring fairness across multiple overlapping groups in prediction problems.
method Probabilistic population analysis leading to Bayes-optimal classifier, unifying existing methods.
result Outperforms baselines in fairness-performance tradeoff on real datasets.
Algorithmic fairness, and in particular the fairness of scoring and classification algorithms, has become a topic of increasing social concern and has recently witnessed an explosion of research in theoretical computer science, machine learning, statistics, the social sciences, and law. Much of the literature considers…
Develops a fair relational model learning algorithm.
problem Fairness in machine learning models for relational data.
method Fair-A3SL, a fairness-aware structure learning algorithm for relational structures.
result Demonstrates effectiveness in learning fair, interpretable, and expressive structures.
A new method SLIDE ensures fairness in AI models.
problem Ensuring fairness in AI models while maintaining computational feasibility.
method Proposes a new surrogate fairness constraint SLIDE.
result SLIDE ensures fairness in AI models asymptotically and converges fast.
This paper improves fairness in recommendation systems by learning individual preferences across multiple dimensions.
problem Fairness in recommender systems, especially in areas with social impact.
method Opportunistic multi-aspect re-ranking approach that learns individual preferences and enhances provider fairness.
result Achieves a better trade-off between accuracy and fairness across multiple fairness dimensions.
A new algorithm COVA-FC improves subgroup-fair clustering efficiency.
problem Challenges in making cluster assignments independent of sensitive attributes in subgroups.
method Defining a subgroup-fairness gap, deriving a covariance-based surrogate, and introducing a continuous relaxation for efficient optimization.
result COVA-FC achieves competitive cost-fairness trade-offs and improves computational efficiency.
FaiREE provides fair classification with guarantees for small datasets.
problem Fairness in classification often requires large sample sizes and distributional assumptions.
method FaiREE offers finite-sample and distribution-free fairness guarantees.
result FaiREE achieves optimal accuracy and satisfies various fairness notions.
New method certifies individual fairness in representations.
problem Ensuring fairness in data representations without sacrificing utility.
method Mapping similar individuals to close latent representations to certify individual fairness.
result Certifies individual fairness for existing and new data points.
Algorithm identifies intended fairness constraints from expert demonstrations for fair clustering.
problem Fair clustering challenges due to incomplete fairness constraints.
method Algorithm identifies fairness metric from expert demonstrations and generates clusters.
result Algorithm identifies and generates fair clusters from limited expert demonstrations.
Study develops a new method for creating fair models.
problem Ensuring equal outcomes for different protected groups.
method Introduces a new group-fair constraint based on transport maps.
result Develops a novel algorithm FTM for training group-fair models.
SenSeI ensures fair models by enforcing invariance on sensitive groups.
problem Ensuring fair machine learning models that respect sensitive groups.
method Designing a transport-based regularizer to enforce invariance on sensitive sets.
result Certifiably fair ML models trained using SenSeI achieve improved fairness metrics.
Framework detects and ranks suspicious market manipulation using temporal convolutions and expert assessment.
problem Detecting and deterring rogue agents in financial markets.
method Weakly supervised learning, expert assessment, similarity search.
result Promising preliminary results in detecting and ranking suspicious market manipulation.
In this paper, we study counterfactual fairness in text classification, which asks the question: How would the prediction change if the sensitive attribute referenced in the example were different? Toxicity classifiers demonstrate a counterfactual fairness issue by predicting that "Some people are gay" is toxic while "…
New algorithm tackles subgroup fairness in AI with multiple sensitive attributes.
problem Heavy computational burdens and data sparsity in subgroup fairness for multiple sensitive attributes.
method Doubly Regressing Adversarial learning (DRAF) for subgroup fairness, focusing on subgroups with sufficient sample sizes and marginal fairness.
result DRAF algorithm reduces a surrogate fairness gap for supIPM with less computation than directly reducing supIPM.
FIFA improves fairness in imbalanced datasets by encouraging both classification and fairness generalization.
problem Imbalanced datasets lead to poor fairness generalization in classifiers.
method FIFA: Imbalance-Fairness-Aware approach that encourages both classification and fairness generalization.
result FIFA improves fairness generalization on real-world datasets.
New welfare-based fairness notions align with existing error rate balance and predictive parity.
problem Aligning fairness notions with welfare-based criteria.
method Discussing and establishing conditions for envy freeness and prejudice freeness.
result Envy freeness and prejudice freeness are equivalent to error rate balance and predictive parity.