VLDB 2026 Research / reviewers in the wild / expert
Matteo Ceriscioli
dblp:429/7114
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0002-5013-1239ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 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
3 papers |
Probabilistic and Bayesian machine learning · 49% Knowledge representation and reasoning · 29% Multi-agent systems · 10% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning |
2.9 | 3 | 2026 | Discovering Linear Non-Gaussian Models for All Categories of Missing Data (Student Abstract) · AAAI 2026 Eliciting Causal Knowledge from Agents · AAAI 2026 Agents Robust to Distribution Shifts Learn Causal World Models Even Under Mediation · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery |
2.0 | 2 | 2026 | Discovering Linear Non-Gaussian Models for All Categories of Missing Data (Student Abstract) · AAAI 2026 Eliciting Causal Knowledge from Agents · AAAI 2026 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
linear non-gaussian acyclic model |
1.0 | 1 | 2026 | Discovering Linear Non-Gaussian Models for All Categories of Missing Data (Student Abstract) · AAAI 2026 |
Machine learning › Probabilistic and Bayesian machine learning
missing data |
1.0 | 1 | 2026 | Discovering Linear Non-Gaussian Models for All Categories of Missing Data (Student Abstract) · AAAI 2026 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal model
causal world model |
0.9 | 1 | 2025 | Agents Robust to Distribution Shifts Learn Causal World Models Even Under Mediation · NeurIPS 2025 |
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift |
0.9 | 1 | 2025 | Agents Robust to Distribution Shifts Learn Causal World Models Even Under Mediation · NeurIPS 2025 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable markov decision process |
0.3 | 1 | 2025 | Agents Robust to Distribution Shifts Learn Causal World Models Even Under Mediation · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
observational data · 1.0interventional data · 1.0imputation · 1.0functional causal model · 1.0causal discovery algorithms · 1.0LiNGAM · 1.0optimal policy oracles · 0.9causal inference · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Eliciting Causal Knowledge from AgentsabstractCausal discovery is the task of learning a causal model from a source of information. Traditionally, the community has focused on algorithms that infer causal models from observational and/or interventional data, while alternative approaches have been only marginally explored. The proposed work aims to contribute to the theoretical foundations connecting agent-based systems with causal modeling, and to identify conditions under which newly developed causal discovery algorithms can be applied to elicit causal knowledge from agents. Matteo Ceriscioli |
AAAI | 1 |
| 2026 | Discovering Linear Non-Gaussian Models for All Categories of Missing Data (Student Abstract)abstractCausal discovery is the task of learning causal models, encoding causal relationships, from a source of information, such as a dataset containing observational data. While many algorithms have been developed to discover causal models under varied sets of assumptions, the case in which the dataset is affected by missing data remains significantly underexplored. Naively applying standard causal discovery algorithms to listwise, test-wise, or regression-wise deleted datasets, or imputing the missing data, can introduce spurious associations between variables and bias function estimation in functional causal models. This issue arises when the data is missing at random or not at random. It ultimately invalidates the theoretical guarantees of these algorithms and prevents finding the true underlying causal model, even in the large-sample limit. An established family of causal models is the Linear Non-Gaussian Acyclic Model (LiNGAM), which assumes linear functional relationships and non-Gaussian independent noise terms. We propose a new causal discovery algorithm for LiNGAM, capable of recovering the underlying causal structure and providing unbiased estimates of the model’s parameters, even when the data is affected by MNAR missingness. Matteo Ceriscioli, Shohei Shimizu, Karthika Mohan |
AAAI | 1 |
| 2025 | Agents Robust to Distribution Shifts Learn Causal World Models Even Under MediationabstractIn this work, we prove that agents capable of adapting to distribution shifts must have learned the causal model of their environment even in the presence of mediation. This term describes situations where an agent's actions affect its environment, a dynamic common to most real-world settings. For example, a robot in an industrial plant might interact with tools, move through space, and transform products to complete its task. We introduce an algorithm for eliciting causal knowledge from robust agents using optimal policy oracles, with the flexibility to incorporate prior causal knowledge. We further demonstrate its effectiveness in mediated single-agent scenarios and multi-agent environments. We identify conditions under which the presence of a single robust agent is sufficient to recover the full causal model and derive optimal policies for other agents in the same environment. Finally, we show how to apply these results to sequential decision-making tasks modeled as Partially Observable Markov Decision Processes (POMDPs). Matteo Ceriscioli, Karthika Mohan |
NeurIPS | 1 |