Arrow Research search

Author name cluster

Patrick Betz

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.

4 papers
2 author rows

Possible papers

4

ECAI Conference 2025 Conference Paper

Disentangling Exploration of Large Language Models by Optimal Exploitation

  • Tim Grams
  • Patrick Betz
  • Sascha Marton
  • Stefan Lüdtke
  • Christian Bartelt

Exploration is a crucial skill for in-context reinforcement learning in unknown environments. However, it remains unclear if large language models can effectively explore a partially hidden state space. This work isolates exploration as the sole objective, tasking an agent with gathering information that enhances future returns. Within this framework, we argue that measuring agent returns is not sufficient for a fair evaluation. Hence, we decompose missing rewards into their exploration and exploitation components based on the optimal achievable return. Experiments with various models reveal that most struggle to explore the state space, and weak exploration is insufficient. Nevertheless, we found a positive correlation between exploration performance and reasoning capabilities. Our decomposition can provide insights into differences in behaviors driven by prompt engineering, offering a valuable tool for refining performance in exploratory tasks.

IJCAI Conference 2024 Conference Paper

PyClause - Simple and Efficient Rule Handling for Knowledge Graphs

  • Patrick Betz
  • Luis Galárraga
  • Simon Ott
  • Christian Meilicke
  • Fabian Suchanek
  • Heiner Stuckenschmidt

Rule mining finds patterns in structured data such as knowledge graphs. Rules can predict facts, help correct errors, and yield explainable insights about the data. However, existing rule mining implementations focus exclusively on mining rules -- and not on their application. The PyClause library offers a rich toolkit for the application of the mined rules: from explaining facts to predicting links, scoring rules, and deducing query results. The library is easy to use and can handle substantial data loads.

IJCAI Conference 2022 Conference Paper

Adversarial Explanations for Knowledge Graph Embeddings

  • Patrick Betz
  • Christian Meilicke
  • Heiner Stuckenschmidt

We propose a novel black-box approach for performing adversarial attacks against knowledge graph embedding models. An adversarial attack is a small perturbation of the data at training time to cause model failure at test time. We make use of an efficient rule learning approach and use abductive reasoning to identify triples which are logical explanations for a particular prediction. The proposed attack is then based on the simple idea to suppress or modify one of the triples in the most confident explanation. Although our attack scheme is model independent and only needs access to the training data, we report results on par with state-of-the-art white-box attack methods that additionally require full access to the model architecture, the learned embeddings, and the loss functions. This is a surprising result which indicates that knowledge graph embedding models can partly be explained post hoc with the help of symbolic methods.

NeSy Conference 2021 Conference Paper

Backpropagating through Markov Logic Networks

  • Patrick Betz
  • Mathias Niepert
  • Pasquale Minervini
  • Heiner Stuckenschmidt

We integrate Markov Logic networks with deep learning architectures operating on high-dimensional and noisy feature inputs. Instead of relaxing the discrete components into smooth functions, we propose an approach that allows us to backpropagate through standard statistical relational learning components using perturbation-based differentiation. The resulting hybrid models are shown to outperform models solely relying on deep learning based function fitting. We find that using noise perturbations is required to allow the proposed hybrid models to robustly learn from the training data.