VLDB 2026 Research / reviewers in the wild / expert
Zohreh Shams
dblp:153/5557
· DBLP profile ↗
20ranked-venue papers
8as first author
9since 2021 · last 2025
0000-0002-0143-798XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 16 · 7 first-author · 7 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author · 2 since 2021Theory of computation · 3 · 3 first-authorHuman-computer interaction and ubiquitous computing · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 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
10 papers |
Trustworthy machine learning · 78% Knowledge representation and reasoning · 10% Reinforcement learning · 5% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Human-computer interaction and pervasive computing
2 papers |
Human-AI interaction · 100% | |
| Theoretical computer science
2 papers |
Automated reasoning and model checking · 67% Logic in computer science · 33% |
Topics — the 20 heaviest of 24, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
3.5 | 5 | 2025 | Avoiding Leakage Poisoning: Concept Interventions Under Distribution Shifts · ICML 2025 Workshop on Human-Interpretable AI · KDD 2024 Learning to Receive Help: Intervention-Aware Concept Embedding Models · NeurIPS 2023 |
Machine learning › Trustworthy machine learning › interpretability
concept-based explanation |
1.2 | 2 | 2023 | Towards Robust Metrics for Concept Representation Evaluation · AAAI 2023 Concept Embedding Models: Beyond the Accuracy-Explainability Trade-Off · NeurIPS 2022 |
Machine learning › Trustworthy machine learning › interpretability
concept bottleneck model |
1.2 | 2 | 2023 | Learning to Receive Help: Intervention-Aware Concept Embedding Models · NeurIPS 2023 Concept Embedding Models: Beyond the Accuracy-Explainability Trade-Off · NeurIPS 2022 |
Machine learning › Trustworthy machine learning › interpretability
concept-based models |
0.9 | 1 | 2025 | Avoiding Leakage Poisoning: Concept Interventions Under Distribution Shifts · ICML 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.9 | 1 | 2025 | Avoiding Leakage Poisoning: Concept Interventions Under Distribution Shifts · ICML 2025 |
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift |
0.9 | 1 | 2025 | Avoiding Leakage Poisoning: Concept Interventions Under Distribution Shifts · ICML 2025 |
Machine learning › Trustworthy machine learning › fairness
bias mitigation |
0.8 | 1 | 2024 | Efficient Bias Mitigation Without Privileged Information · ECCV (72) 2024 |
Machine learning › Trustworthy machine learning
fairness |
0.8 | 1 | 2024 | Efficient Bias Mitigation Without Privileged Information · ECCV (72) 2024 |
Machine learning › Reinforcement learning
policy learning |
0.7 | 1 | 2023 | Learning to Receive Help: Intervention-Aware Concept Embedding Models · NeurIPS 2023 |
Bioinformatics and computational biology
cancer genomics |
0.6 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Bioinformatics and computational biology
gene expression analysis |
0.6 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Bioinformatics and computational biology › statistical genetics
phenotype prediction |
0.6 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology |
0.3 | 1 | 2018 | iCon: A Diagrammatic Theorem Prover for Ontologies · KR 2018 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › ontology
ontology reasoning |
0.3 | 1 | 2018 | iCon: A Diagrammatic Theorem Prover for Ontologies · KR 2018 |
Automated reasoning and model checking
theorem proving |
0.3 | 1 | 2018 | iCon: A Diagrammatic Theorem Prover for Ontologies · KR 2018 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
argumentation |
0.2 | 1 | 2016 | Normative Practical Reasoning via Argumentation and Dialogue · IJCAI 2016 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
normative reasoning |
0.2 | 1 | 2015 | Normative Practical Reasoning: An Argumentation-Based Approach · IJCAI 2015 |
Machine learning › Graph learning
graph neural network |
0.2 | 1 | 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases · Bioinform. 2022 |
Logic in computer science › knowledge representation and reasoning
description logic |
0.1 | 1 | 2018 | iCon: A Diagrammatic Theorem Prover for Ontologies · KR 2018 |
Natural language and speech › Question answering and dialogue systems
dialogue |
0.1 | 1 | 2016 | Normative Practical Reasoning via Argumentation and Dialogue · IJCAI 2016 |
Methods — techniques the papers use, named apart from their topics
intervention trajectory sampling · 1.3end-to-end training · 1.3topological clustering · 1.1protein-protein interaction network · 1.1inductive bias · 1.1concept intervention · 0.9MixCEM · 0.9disentanglement metrics · 0.7concept embedding · 0.6argumentation frameworks · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Avoiding Leakage Poisoning: Concept Interventions Under Distribution ShiftsabstractIn this paper, we investigate how concept-based models (CMs) respond to out-of-distribution (OOD) inputs. CMs are interpretable neural architectures that first predict a set of high-level concepts (e.g., "stripes", "black") and then predict a task label from those concepts. In particular, we study the impact of concept interventions (i.e., operations where a human expert corrects a CM’s mispredicted concepts at test time) on CMs’ task predictions when inputs are OOD. Our analysis reveals a weakness in current state-of-the-art CMs, which we term leakage poisoning, that prevents them from properly improving their accuracy when intervened on for OOD inputs. To address this, we introduce MixCEM, a new CM that learns to dynamically exploit leaked information missing from its concepts only when this information is in-distribution. Our results across tasks with and without complete sets of concept annotations demonstrate that MixCEMs outperform strong baselines by significantly improving their accuracy for both in-distribution and OOD samples in the presence and absence of concept interventions. Mateo Espinosa Zarlenga, Gabriele Dominici, Pietro Barbiero, Zohreh Shams, Mateja Jamnik |
ICML | 4 |
| 2024 | Efficient Bias Mitigation Without Privileged Information
Mateo Espinosa Zarlenga, Swami Sankaranarayanan, Jerone Theodore Alexander Andrews, Zohreh Shams, Mateja Jamnik, Alice Xiang |
ECCV (72) | 4 |
| 2024 | Workshop on Human-Interpretable AIabstractThis workshop aims to spearhead research on Human-Interpretable Artificial Intelligence (HI-AI) by providing: (i) a general overview of the key aspects of HI-AI, in order to equip all researchers with the necessary background and set of definitions; (ii) novel and interesting ideas coming from both invited talks and top paper contributions; (iii) the chance to engage in dialogue with prominent scientists during poster presentations and coffee breaks. The workshop welcomes contributions covering novel interpretable-by-design or post-hoc approaches, as well as theoretical analysis of existing works. Additionally, we accept visionary contributions speculating on the future potential of this field. Finally, we welcome contributions from related fields such as Ethical AI, Knowledge-driven Machine learning, Human-machine Interaction, but also applications in Medicine and Industry, and analyses from Regulatory experts. Gabriele Ciravegna, Mateo Espinosa Zarlenga, Pietro Barbiero, Francesco Giannini, Zohreh Shams, Damien Garreau, Mateja Jamnik, Tania Cerquitelli |
KDD | 5 |
| 2023 | Towards Robust Metrics for Concept Representation EvaluationabstractRecent work on interpretability has focused on concept-based explanations, where deep learning models are explained in terms of high-level units of information, referred to as concepts. Concept learning models, however, have been shown to be prone to encoding impurities in their representations, failing to fully capture meaningful features of their inputs. While concept learning lacks metrics to measure such phenomena, the field of disentanglement learning has explored the related notion of underlying factors of variation in the data, with plenty of metrics to measure the purity of such factors. In this paper, we show that such metrics are not appropriate for concept learning and propose novel metrics for evaluating the purity of concept representations in both approaches. We show the advantage of these metrics over existing ones and demonstrate their utility in evaluating the robustness of concept representations and interventions performed on them. In addition, we show their utility for benchmarking state-of-the-art methods from both families and find that, contrary to common assumptions, supervision alone may not be sufficient for pure concept representations. Mateo Espinosa Zarlenga, Pietro Barbiero, Zohreh Shams, Dmitry Kazhdan, Umang Bhatt, Adrian Weller, Mateja Jamnik |
AAAI | 3 |
| 2023 | Learning to Receive Help: Intervention-Aware Concept Embedding ModelsabstractConcept Bottleneck Models (CBMs) tackle the opacity of neural architectures by constructing and explaining their predictions using a set of high-level concepts. A special property of these models is that they permit concept interventions, wherein users can correct mispredicted concepts and thus improve the model's performance. Recent work, however, has shown that intervention efficacy can be highly dependent on the order in which concepts are intervened on and on the model's architecture and training hyperparameters. We argue that this is rooted in a CBM's lack of train-time incentives for the model to be appropriately receptive to concept interventions. To address this, we propose Intervention-aware Concept Embedding models (IntCEMs), a novel CBM-based architecture and training paradigm that improves a model's receptiveness to test-time interventions. Our model learns a concept intervention policy in an end-to-end fashion from where it can sample meaningful intervention trajectories at train-time. This conditions IntCEMs to effectively select and receive concept interventions when deployed at test-time. Our experiments show that IntCEMs significantly outperform state-of-the-art concept-interpretable models when provided with test-time concept interventions, demonstrating the effectiveness of our approach. Mateo Espinosa Zarlenga, Katie Collins, Krishnamurthy Dvijotham, Adrian Weller, Zohreh Shams, Mateja Jamnik |
NeurIPS | 5 |
| 2023 | Human Visual Consistency-Checking in the Real World OntologiesabstractSolving complex consistency checking tasks in natural languages is hard and requires sophisticated specialist expertise. The similar task of finding bugs in information systems can be large-scale and is often conducted with some visualisation of the data. Visualisation, therefore, could also be a useful tool when consistency checking in real world applications, such as in the case of ontology engineering. Previous experiments suggest that node-link visualisation, such as SOVA, are more effective than node-link-region visualisation, such as concept diagrams, in consistency checking tasks. In this study, we found that this tendency was not affected even in an alternative setting where multiple concept diagrams were used. Our findings have implications for the way in which information is presented visually: single (merged) visualisations are effective for these types of tasks. Yuri Sato 0001, Gem Stapleton, Mateja Jamnik, Zohreh Shams, Andrew Blake 0002 |
VL/HCC | 4 |
| 2022 | Evaluating Colour in Concept Diagrams
Sean McGrath 0002, Andrew Blake 0002, Gem Stapleton, Anestis Touloumis, Peter Chapman, Mateja Jamnik, Zohreh Shams |
Diagrams | 7 |
| 2022 | Concept Embedding Models: Beyond the Accuracy-Explainability Trade-OffabstractDeploying AI-powered systems requires trustworthy models supporting effective human interactions, going beyond raw prediction accuracy. Concept bottleneck models promote trustworthiness by conditioning classification tasks on an intermediate level of human-like concepts. This enables human interventions which can correct mispredicted concepts to improve the model's performance. However, existing concept bottleneck models are unable to find optimal compromises between high task accuracy, robust concept-based explanations, and effective interventions on concepts---particularly in real-world conditions where complete and accurate concept supervisions are scarce. To address this, we propose Concept Embedding Models, a novel family of concept bottleneck models which goes beyond the current accuracy-vs-interpretability trade-off by learning interpretable high-dimensional concept representations. Our experiments demonstrate that Concept Embedding Models (1) attain better or competitive task accuracy w.r.t. standard neural models without concepts, (2) provide concept representations capturing meaningful semantics including and beyond their ground truth labels, (3) support test-time concept interventions whose effect in test accuracy surpasses that in standard concept bottleneck models, and (4) scale to real-world conditions where complete concept supervisions are scarce. Mateo Espinosa Zarlenga, Pietro Barbiero, Gabriele Ciravegna, Giuseppe Marra, Francesco Giannini, Michelangelo Diligenti, Zohreh Shams, Frédéric Precioso, Stefano Melacci, Adrian Weller, Pietro Liò, Mateja Jamnik |
NeurIPS | 7 |
| 2022 | Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biasesabstractMOTIVATION: Gene expression data are commonly used at the intersection of cancer research and machine learning for better understanding of the molecular status of tumour tissue. Deep learning predictive models have been employed for gene expression data due to their ability to scale and remove the need for manual feature engineering. However, gene expression data are often very high dimensional, noisy and presented with a low number of samples. This poses significant problems for learning algorithms: models often overfit, learn noise and struggle to capture biologically relevant information. In this article, we utilize external biological knowledge embedded within structures of gene interaction graphs such as protein-protein interaction (PPI) networks to guide the construction of predictive models. RESULTS: We present Gene Interaction Network Constrained Construction (GINCCo), an unsupervised method for automated construction of computational graph models for gene expression data that are structurally constrained by prior knowledge of gene interaction networks. We employ this methodology in a case study on incorporating a PPI network in cancer phenotype prediction tasks. Our computational graphs are structurally constructed using topological clustering algorithms on the PPI networks which incorporate inductive biases stemming from network biology research on protein complex discovery. Each of the entities in the GINCCo computational graph represents biological entities such as genes, candidate protein complexes and phenotypes instead of arbitrary hidden nodes of a neural network. This provides a biologically relevant mechanism for model regularization yielding strong predictive performance while drastically reducing the number of model parameters and enabling guided post-hoc enrichment analyses of influential gene sets with respect to target phenotypes. Our experiments analysing a variety of cancer phenotypes show that GINCCo often outperforms support vector machine, Fully Connected Multi-layer Perceptrons (MLP) and Randomly Connected MLPs despite greatly reduced model complexity. AVAILABILITY AND IMPLEMENTATION: https://github.com/paulmorio/gincco contains the source code for our approach. We also release a library with algorithms for protein complex discovery within PPI networks at https://github.com/paulmorio/protclus. This repository contains implementations of the clustering algorithms used in this article. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Paul Scherer, Maja Trebacz, Nikola Simidjievski, Ramón Viñas 0001, Zohreh Shams, Helena Andrés-Terré, Mateja Jamnik, Pietro Liò |
Bioinform. | 5 |
| 2020 | MARLeME: A Multi-Agent Reinforcement Learning Model Extraction LibraryabstractMulti-Agent Reinforcement Learning (MARL) encompasses a powerful class of methodologies that have been applied in a wide range of fields. An effective way to further empower these methodologies is to develop approaches and tools that could expand their interpretability and explainability. In this work, we introduce MARLeME: a MARL model extraction library, designed to improve explainability of MARL systems by approximating them with symbolic models. Symbolic models offer a high degree of interpretability, well-defined properties, and verifiable behaviour. Consequently, they can be used to inspect and better understand the underlying MARL systems and corresponding MARL agents, as well as to replace all/some of the agents that are particularly safety and security critical. In this work, we demonstrate how MARLeME can be applied to two well-known case studies (Cooperative Navigation and RoboCup Takeaway), using extracted models based on Abstract Argumentation. Dmitry Kazhdan, Zohreh Shams, Pietro Liò |
IJCNN | 2 |
| 2020 | Argumentation-Based Reasoning about Plans, Maintenance Goals, and NormsabstractIn a normative environment, an agent’s actions are directed not only by its goals but also by the norms activated by its actions and those of other actors. The potential for conflict between agent goals and norms makes decision making challenging, in that it requires looking ahead to consider the longer-term consequences of which goal to satisfy or which norm to comply with in face of conflict. We therefore seek to determine the actions an agent should select at each point in time, taking account of its temporal goals, norms, and their conflicts. We propose a solution in which a normative planning problem is the basis for practical reasoning based on argumentation. Various types of conflict within goals, within norms, and between goals and norms are identified based on temporal properties of these entities. The properties of the best plan(s) with respect to goal achievement and norm compliance are mapped to arguments, followed by mapping their conflicts to attack between arguments, all of which are used to identify why a plan is justified. Zohreh Shams, Marina De Vos, Nir Oren, Julian A. Padget |
ACM Trans. Auton. Adapt. Syst. | 1 |
| 2018 | Deductive reasoning about expressive statements using external graphical representations
Yuri Sato 0001, Gem Stapleton, Mateja Jamnik, Zohreh Shams |
CogSci | 4 |
| 2018 | Accessible Reasoning with Diagrams: From Cognition to Automation
Zohreh Shams, Yuri Sato 0001, Mateja Jamnik, Gem Stapleton |
Diagrams | 1 |
| 2018 | iCon: A Diagrammatic Theorem Prover for Ontologies
Zohreh Shams, Mateja Jamnik, Gem Stapleton, Yuri Sato 0001 |
KR | 1 |
| 2017 | Reasoning with Concept Diagrams About Antipatterns in Ontologies
Zohreh Shams, Mateja Jamnik, Gem Stapleton, Yuri Sato 0001 |
CICM | 1 |
| 2017 | How Network-based and set-based visualizations aid consistency checking in ontologiesabstractOntologies describe complex world knowledge in that they consist of hierarchical relations, such as is-a, which can be expressed by quantifiers or sets, and various binary relations, which can be expressed by links or networks. Should hierarchical relations be distinguished from other binary relations as essentially different ones in building cognitively accessible systems of ontologies? In this study, two kinds of ontology visualizations, a network-based visualization (SOVA) and a set-based visualization (concept diagrams), are empirically compared in the case of consistency checking. Participants were presented with one diagram and then asked to answer the question of whether the meaning of the diagram was contradictory. Our results showed that SOVA is more effective than concept diagrams, suggesting that to represent hierarchical and binary relations of ontologies in a way based on networks suits human cognition when checking ontologies' consistencies. Yuri Sato 0001, Gem Stapleton, Mateja Jamnik, Zohreh Shams, Andrew Blake 0002 |
VINCI | 4 |
| 2017 | Practical reasoning with norms for autonomous software agents
Zohreh Shams, Marina De Vos, Julian A. Padget, Wamberto Weber Vasconcelos |
Eng. Appl. Artif. Intell. | 1 |
| 2016 | Normative Practical Reasoning via Argumentation and Dialogue
Zohreh Shams, Marina De Vos, Nir Oren, Julian A. Padget |
IJCAI | 1 |
| 2016 | A Two-Phase Dialogue Game for Skeptical Preferred Semantics
Zohreh Shams, Nir Oren |
JELIA | 1 |
| 2015 | Normative Practical Reasoning: An Argumentation-Based Approach
Zohreh Shams |
IJCAI | 1 |