Demo Data from EDBT 2026 / reviewers in the wild / expert
Jiri Nemecek 0002
dblp:225/7288-2
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0005-0585-1642ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
2 papers |
Trustworthy machine learning · 73% Probabilistic and Bayesian machine learning · 22% Learning theory · 5% | |
| Theoretical computer science
2 papers |
Mathematical optimization · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › integer programming
mixed-integer optimization |
1.1 | 2 | 2025 | Generating Likely Counterfactuals Using Sum-Product Networks · ICLR 2025 Bias Detection via Maximum Subgroup Discrepancy · KDD (2) 2025 |
Machine learning › Trustworthy machine learning › fairness › bias evaluation
bias detection |
0.9 | 1 | 2025 | Bias Detection via Maximum Subgroup Discrepancy · KDD (2) 2025 |
Machine learning › Trustworthy machine learning › interpretability
counterfactual explanation |
0.9 | 1 | 2025 | Generating Likely Counterfactuals Using Sum-Product Networks · ICLR 2025 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
distribution distance estimation |
0.9 | 1 | 2025 | Bias Detection via Maximum Subgroup Discrepancy · KDD (2) 2025 |
Machine learning › Trustworthy machine learning
fairness |
0.9 | 1 | 2025 | Bias Detection via Maximum Subgroup Discrepancy · KDD (2) 2025 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | Generating Likely Counterfactuals Using Sum-Product Networks · ICLR 2025 |
Machine learning › Learning theory
sample complexity |
0.3 | 1 | 2025 | Bias Detection via Maximum Subgroup Discrepancy · KDD (2) 2025 |
Machine learning › Trustworthy machine learning › fairness › fairness evaluation
subgroup discrepancy |
0.3 | 1 | 2025 | Bias Detection via Maximum Subgroup Discrepancy · KDD (2) 2025 |
Machine learning › Probabilistic and Bayesian machine learning › tractable probabilistic model
sum-product networks |
0.3 | 1 | 2025 | Generating Likely Counterfactuals Using Sum-Product Networks · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
mixed-integer optimization · 3.5maximum subgroup discrepancy · 1.7sum-product networks · 0.9sum-product network · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Generating Likely Counterfactuals Using Sum-Product NetworksabstractThe need to explain decisions made by AI systems is driven by both recent regulation and user demand. The decisions are often explainable only post hoc. In counterfactual explanations, one may ask what constitutes the best counterfactual explanation. Clearly, multiple criteria must be taken into account, although "distance from the sample" is a key criterion. Recent methods that consider the plausibility of a counterfactual seem to sacrifice this original objective. Here, we present a system that provides high-likelihood explanations that are, at the same time, close and sparse. We show that the search for the most likely explanations satisfying many common desiderata for counterfactual explanations can be modeled using Mixed-Integer Optimization (MIO). We use a Sum-Product Network (SPN) to estimate the likelihood of a counterfactual. To achieve that, we propose an MIO formulation of an SPN, which can be of independent interest. The source code with examples is available at https://github.com/Epanemu/LiCE. Jiri Nemecek 0002, Tomás Pevný, Jakub Marecek |
ICLR | 1 |
| 2025 | Bias Detection via Maximum Subgroup DiscrepancyabstractBias 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 Mixedinteger 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. Jiri Nemecek 0002, Mark Kozdoba, Illia Kryvoviaz, Tomás Pevný, Jakub Marecek |
KDD (2) | 1 |