Arrow Research search

Author name cluster

Thomas Mortier

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
2 author rows

Possible papers

2

CLeaR Conference 2026 Conference Paper

Causal Importance for Physics-Informed Machine Learning

  • Daniel Fiifi Tawia Hagan
  • Thomas Mortier
  • Cas Decancq
  • Diego G. Miralles

Predictive modelling in complex dynamical systems often relies on machine learning (ML) models trained on correlated and partially redundant predictors. Standard feature importance measures are usually correlation-based and model-specific, providing limited guidance for disentangling mediators, confounders, and true drivers, and generally offering no principled route for causally motivated prediction. Here we bridge these by explicitly importing causal information, derived from the multivariate Liang-Kleeman information flow (LKIF) framework, into ML models. Here, we decompose the differential information flow into four conditioner-importance indices (Mediator Dominance Index, Moderation Gain, Confounding Pressure, and Causal Sufficiency Rate), then we construct a Causal Importance Score (CIS) that summarises the relevance of each conditioner to a given coupling. Finally, we use this CIS as a prior for two complementary ML strategies: (i) a baseline Random Forest (RF), and (ii) a neural network (NN) whose input-layer attention weights are regularised towards CIS-based priors. Using a real-world testbed with four interacting eco-hydrological variables and a target, we show that CIS-regularised NNs can closely align their learned feature usage with the physically motivated causal ranking, while retaining competitive predictive skill. This provides a concrete example of causally informed prediction, where causal diagnostics do not merely interpret an already-trained black box, but actively shape the hypothesis space explored by the model and offer a principled handle on feature selection and dimensionality reduction.

UAI Conference 2022 Conference Paper

Set-valued prediction in hierarchical classification with constrained representation complexity

  • Thomas Mortier
  • Eyke Hüllermeier
  • Krzysztof Dembczynski
  • Willem Waegeman

Set-valued prediction is a well-known concept in multi-class classification. When a classifier is uncertain about the class label for a test instance, it can predict a set of classes instead of a single class. In this paper, we focus on hierarchical multi-class classification problems, where valid sets (typically) correspond to internal nodes of the hierarchy. We argue that this is a very strong restriction, and we propose a relaxation by introducing the notion of representation complexity for a predicted set. In combination with probabilistic classifiers, this leads to a challenging inference problem for which specific combinatorial optimization algorithms are needed. We propose three methods and evaluate them on benchmark datasets: a naïve approach that is based on matrix-vector multiplication, a reformulation as a knapsack problem with conflict graph, and a recursive tree search method. Experimental results demonstrate that the last method is computationally more efficient than the other two approaches, due to a hierarchical factorization of the conditional class distribution.

v2026.09.13