Norwegian version of this page

CaReLearner Causal Reasoning with Logical Interpretable Learning

Duration
–
Project type
Research project

Project description

Researchers are gathering increasing evidence that machine learning models based on correlation are fragile. These models do not distinguish between correlation and causation. As such, they provide limited insight and cannot reason about the effects of actions. The traditional fields of logic, causal reasoning, and deep learning have struggled for decades to learn large-scale causal models. Each approach faces significant challenges. The CaReLearner project aims to develop a unified approach to address the core challenges of each paradigm.

The project builds on the Tsetlin Machine and tackles the unresolved learning challenge in logic, the scalability challenge in causal reasoning, and the correlation dependence in deep learning. This will enable large-scale causal and counterfactual reasoning. It involves linking images, time series, tabular data, and text across time and space to handle complex multimodal datasets from knowledge-intensive application domains. A medical dataset will be used to validate the extent to which the learned models capture causal mechanisms through multimodal observations assessed by domain experts.

In the first phase of the project, we have initiated research in three directions:

  1. Multimodal Tsetlin Machines that combine text and images;
  2. Scalable learning of Bayesian networks from data; and
  3. Modeling and analysis of how the Tsetlin Machine captures uncertainty.

Participants

Publications

  • Jeeru, Sindhusha; Omslandseter, Rebekka Olsson; Andersen, Per-Arne; Morrison, Aiden James; Sokolova, Nadezda & Granmo, Ole-Christoffer [Show all 7 contributors for this article] (2025). MixCTME: A Mixture of Convolutional Tsetlin Machine Experts Using Diverse Spectrogram Visualizations for Jamming Signal Classification. IEEE Internet of Things Journal. ISSN 2327-4662. 12(22), p. 47667–47678. doi: 10.1109/jiot.2025.3606366. Full text in Research Archive
  • Granmo, Ole-Christoffer; Andersen, Per-Arne; Lei, Jiao; Zhang, Xuan; Blakely, Christian Dallas & Berge, Geir Thore [Show all 7 contributors for this article] (2023). Learning Minimalistic Tsetlin Machine Clauses with Markov Boundary-Guided Pruning, 2023 International Symposium on the Tsetlin Machine (ISTM). IEEE (Institute of Electrical and Electronics Engineers). ISSN 9798350344776. doi: 10.1109/ISTM58889.2023.10454914. Full text in Research Archive

View all works in NVA

Funding

Funded by The Research Council of Norway

Project number: 335700

Published Feb. 27, 2025 12:40 PM - Last modified Aug. 22, 2025 12:56 PM