FWFelix Weitkämper

Felix Weitkämper

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Felix Weitkämper has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Causal Structure Learning Assumptions Shape Counterfactual Safety: Expert-Guided Constraints vs. Data-Driven DAGs with Probabilistic Logic Twin Networks

    by Héctor Avilés, Ingridh Gracia, Rafael Kiesel, Verónica Rodríguez, Rubén Machucho, Alberto Reyes, Marco Negrete, Gabriel Ramírez, Nicolás Luévano, Myriam Pequeño, et al.

    We investigate how causal DAG learning algorithms and structural assumptions influence counterfactual decision safety. Four structure learning regimes are compared: expert-guided edge-constrained HC+BIC, unconstrained HC+BIC, MMPC+HC+BIC, and the PC-Stable algorithm. Evaluation is conducted using a leave-one-state-out protocol over a fully enumerated state–action space in a controlled offline autonomous driving setting. The environment is characterized by seven Boolean state variables and six actions, allowing us to disentangle the effects of learning strategies on counterfactual decisions. All models are implemented as probabilistic logic twin networks (PLTNs), with additional sensitivity analysis across parameter configurations. The learning regimes produce markedly different counterfactual decisions. Edge-constrained HC+BIC recommends a diverse set of safe actions, while unconstrained HC+BIC yields fewer but consistently safe alternatives. MMPC+HC+BIC frequently fails to identify safe actions, often associated with weak connectivity of the outcome variable. PC-Stable produces varied recommendations but may include unsafe actions, which is linked to incorrect edge orientations between actions and outcomes. These findings show that structure learning choices and prior knowledge influence counterfactual decisions through the learned structure, affecting the identification of safe alternatives in safety-critical applications.

  • reems: Estimating Effective Migration Surfaces from Single Nucleotide Polymorphism Data

    by Felix Weitkämper, Grace Zawadi

    Wrapper and plotting utilities for the spatial population genetics tool 'EEMS' (Estimated Effective Migration Surfaces) for SNP (Single Nucleotide Polymorphism) data, originally provided as a command-line tool written in 'C++' together with an accompanying 'R' package for plotting the output of the 'EEMS' tool itself (). There are four main motivations for offering this to 'R' users as a package. Firstly, to remove the installation and configuration burden for the 'EEMS' command-line tool, which relies on manually installed 'Boost' and 'Eigen' system libraries and configuring their location; secondly, to streamline the workflow by having a singe environment (the 'R' system) for the entire analysis rather than a file-based command-line executable whose output files are then to be imported and analysed by a separate 'R' script; thirdly, to make the input formats compatible with other, 'R'-based spatial population genetics tools such as the 'ConStruct' package; and lastly, to allow for easily running several chains in parallel and combining them for plotting and further analysis. The package also adds more intuitive, streamlined tooling around creating more complex habitats. The method of estimating effective migration surfaces was first described by Petkova, D., Novembre, J. & Stephens, M. (2016) .

  • Open Access

    A general approach to asymptotic elimination of aggregation functions and generalized quantifiers

    by Vera Koponen, Felix Weitkämper

    We consider a logic with truth values in the unit interval and which uses aggregation functions instead of quantifiers, and we describe a general approach to asymptotic elimination of aggregation functions and, indirectly, of asymptotic elimination of Mostowski style generalized quantifiers, since such can be expressed by using aggregation functions. The notion of “local continuity” of an aggregation function, which we make precise in two (related) ways, plays a central role in this approach.


  • Open Access

    “What if?” in Boolean Bayesian Networks

    by Kilian Rückschloß, Felix Weitkämper

    Counterfactual reasoning describes the ability to consider alternative outcomes – to answer questions such as “What if I had been nicer? Would more students have attended my lecture?” Counterfactuals arise in a wide range of applications; for instance, ethical notions such as responsibility, blame, and harm can be defined in counterfactual terms. Pearl’s standard approach to evaluating counterfactuals requires a fully specified causal model. Such models are difficult to specify, and counterfactual reasoning remains underdetermined when only a probability distribution or a Bayesian network is given. This work proposes a novel approach to counterfactual reasoning in Boolean Bayesian networks. Drawing inspiration from Lewis’s account of counterfactuals and the principle of maximum entropy, it argues that a rational agent should assess counterfactuals by explaining the network through a causal model derived from solving an optimization problem. This problem is formulated in terms of distances between actual and alternative realities, and each counterfactual corresponds to one such problem. The main result identifies a unique causal model that simultaneously solves all of these optimization problems. This provides a principled justification for counterfactual reasoning based solely on a Boolean Bayesian network, without requiring the full specification of a causal model.

  • Open Access

    IS THERE A COUNTABLE OMEGA-UNIVERSAL LOGIC?

    by Alexander C. Paseau, Felix Weitkämper

    Some informal arguments are valid, others are invalid. A core application of logic is to tell us which is which by capturing these validity facts. Philosophers and logicians have explored how well a host of logics carry out this role, familiar examples being propositional, first-order and second-order logic. Since natural language and standard logics are countable, a natural question arises: is there a countable logic guaranteed to capture the validity patterns of any language fragment? That is, is there a countable omega-universal logic? Our article philosophically motivates this question, makes it precise, and then answers it. It is a self-contained, concise sequel to ‘Capturing Consequence’ by A.C. Paseau (RSL vol. 12, 2019).

  • Open Access

    Scaling the weight parameters in Markov logic networks and relational logistic regression models

    by Felix Q. Weitkämper

    Extrapolation with domain size has received plenty of attention recently, both in its own right and as part of the broader issue of scaling inference and learning to large domains. We consider Markov logic networks and relational logistic regression as two fundamental representation formalisms in statistical relational artificial intelligence that use weighted formulas in their specification. However, Markov logic networks are based on undirected graphs, while relational logistic regression is based on directed acyclic graphs. We show that when scaling the weight parameters with the domain size, the asymptotic behaviour of a relational logistic regression model is transparently controlled by the parameters, and we supply an algorithm to compute asymptotic probabilities. We show using two examples that this is not true for Markov logic networks. We also discuss using several examples, mainly from the literature, how the application context can help the user to decide when such scaling is appropriate and when using the raw unscaled parameters might be preferable.


  • Open Access

    Editorial

    by Hykel Hosni, Paolo Baldi, Lorenzo Casini, Juergen Landes, Felix Weitkaemper, Sarah Wieten, Jon Williamson

    The Editorial Team welcomes readerst to The Reasoner new home.

  • Open Access

    On the relative asymptotic expressivity of inference frameworks

    by Vera Koponen, Felix Weitkämper

    We consider logics with truth values in the unit interval $[0,1]$. Such logics are used to define queries and to define probability distributions. In this context the notion of almost sure equivalence of formulas is generalized to the notion of asymptotic equivalence. We prove two new results about the asymptotic equivalence of formulas where each result has a convergence law as a corollary. These results as well as several older results can be formulated as results about the relative asymptotic expressivity of inference frameworks. An inference framework $\mathbf{F}$ is a class of pairs $(\mathbb{P}, L)$, where $\mathbb{P} = (\mathbb{P}_n : n = 1, 2, 3, \ldots)$, $\mathbb{P}_n$ are probability distributions on the set $\mathbf{W}_n$ of all $\sigma$-structures with domain $\{1, \ldots, n\}$ (where $\sigma$ is a first-order signature) and $L$ is a logic with truth values in the unit interval $[0, 1]$. An inference framework $\mathbf{F}'$ is asymptotically at least as expressive as an inference framework $\mathbf{F}$ if for every $(\mathbb{P}, L) \in \mathbf{F}$ there is $(\mathbb{P}', L') \in \mathbf{F}'$ such that $\mathbb{P}$ is asymptotically total variation equivalent to $\mathbb{P}'$ and for every $\varphi(\bar{x}) \in L$ there is $\varphi'(\bar{x}) \in L'$ such that $\varphi'(\bar{x})$ is asymptotically equivalent to $\varphi(\bar{x})$ with respect to $\mathbb{P}$. This relation is a preorder. If, in addition, $\mathbf{F}$ is at least as expressive as $\mathbf{F}'$ then we say that $\mathbf{F}$ and $\mathbf{F}'$ are asymptotically equally expressive. Our third contribution is to systematize the new results of this paper and several previous results in order to get a preorder on a number of inference systems that are of relevance in the context of machine learning and artificial intelligence.