arXiv subjects

Jiří Němeček

Publications and source records attributed to Jiří Němeček.

4 recordsLinked to original sources

arXiv2026

Intersectional Fairness via Mixed-Integer Optimization

The deployment of Artificial Intelligence in high-risk domains, such as finance and healthcare, necessitates models that are both fair and transparent. While regulatory frameworks, including the EU's AI Act, mandate bias mitigation, they are deliberately vague about the definition of bias. In line with existing research, we argue that true fairness requires addressing bias at the intersections of protected groups. We propose a unified framework that leverages Mixed-Integer Optimization (MIO) to train intersectionally fair and intrinsically interpretable classifiers. We prove the equivalence of two measures of intersectional fairness (MSD and SPSF) in detecting the most unfair subgroup and empirically demonstrate that our MIO-based algorithm improves performance in finding bias. We train high-performing, interpretable classifiers that bound intersectional bias below an acceptable threshold, offering a robust solution for regulated industries and beyond.

cs.LG↗

arXiv2026

Tractable Probabilistic Models for Investment Planning

Investment planning in power utilities, such as generation and transmission expansion, requires decisions under substantial uncertainty over decade--long horizons for policies, demand, renewable availability, and outages, while maintaining reliability and computational tractability. Conventional approaches approximate uncertainty using finite scenario sets (modeled as a mixture of Diracs in statistical theory terms), which can become computationally intensive as scenario detail increases and provide limited probabilistic resolution for reliability assessment. We propose an alternative based on tractable probabilistic models, using sum--product networks (SPNs) to represent high--dimensional uncertainty in a compact, analytically tractable form that supports exact probabilistic queries (e.g., likelihoods, marginals, and conditionals). This framework enables the direct embedding of chance constraints into mixed--integer linear programming (MILP) models for investment planning to evaluate reliability events and enforce probabilistic feasibility requirements without enumerating large scenario trees. We demonstrate the approach on a representative planning case study and report reliability--cost trade--offs and computational behavior relative to standard scenario--based formulations.

cs.LG↗

arXiv2025

Plausible Counterfactual Explanations of Recommendations

Explanations play a variety of roles in various recommender systems, from a legally mandated afterthought, through an integral element of user experience, to a key to persuasiveness. A natural and useful form of an explanation is the Counterfactual Explanation (CE). We present a method for generating highly plausible CEs in recommender systems and evaluate it both numerically and with a user study.

cs.LG↗

arXiv2025

Bias Detection via Maximum Subgroup Discrepancy

Bias evaluation is fundamental to trustworthy AI, both in terms of checking data quality and in terms of checking the outputs of AI systems. In testing data quality, for example, one may study the distance of a given dataset, viewed as a distribution, to a given ground-truth reference dataset. However, classical metrics, such as the Total Variation and the Wasserstein distances, are known to have high sample complexities and, therefore, may fail to provide a meaningful distinction in many practical scenarios. In this paper, we propose a new notion of distance, the Maximum Subgroup Discrepancy (MSD). In this metric, two distributions are close if, roughly, discrepancies are low for all feature subgroups. While the number of subgroups may be exponential, we show that the sample complexity is linear in the number of features, thus making it feasible for practical applications. Moreover, we provide a practical algorithm for evaluating the distance based on Mixed-integer optimization (MIO). We also note that the proposed distance is easily interpretable, thus providing clearer paths to fixing the biases once they have been identified. Finally, we describe a natural general bias detection framework, termed MSDD distances, and show that MSD aligns well with this framework. We empirically evaluate MSD by comparing it with other metrics and by demonstrating the above properties of MSD on real-world datasets.

cs.LG↗