Alert button
Picture for Steffen Staab

Steffen Staab

Alert button

Semantic Map Learning of Traffic Light to Lane Assignment based on Motion Data

Sep 28, 2023
Thomas Monninger, Andreas Weber, Steffen Staab

Understanding which traffic light controls which lane is crucial to navigate intersections safely. Autonomous vehicles commonly rely on High Definition (HD) maps that contain information about the assignment of traffic lights to lanes. The manual provisioning of this information is tedious, expensive, and not scalable. To remedy these issues, our novel approach derives the assignments from traffic light states and the corresponding motion patterns of vehicle traffic. This works in an automated way and independently of the geometric arrangement. We show the effectiveness of basic statistical approaches for this task by implementing and evaluating a pattern-based contribution method. In addition, our novel rejection method includes accompanying safety considerations by leveraging statistical hypothesis testing. Finally, we propose a dataset transformation to re-purpose available motion prediction datasets for semantic map learning. Our publicly available API for the Lyft Level 5 dataset enables researchers to develop and evaluate their own approaches.

* Accepted to the 2023 IEEE International Conference on Intelligent Transportation Systems (ITSC 2023) 
Viaarxiv icon

Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning

Jun 14, 2023
Tim Schneider, Amin Totounferoush, Wolfgang Nowak, Steffen Staab

Symbolic Regression (SR) allows for the discovery of scientific equations from data. To limit the large search space of possible equations, prior knowledge has been expressed in terms of formal grammars that characterize subsets of arbitrary strings. However, there is a mismatch between context-free grammars required to express the set of syntactically correct equations, missing closure properties of the former, and a tree structure of the latter. Our contributions are to (i) compactly express experts' prior beliefs about which equations are more likely to be expected by probabilistic Regular Tree Expressions (pRTE), and (ii) adapt Bayesian inference to make such priors efficiently available for symbolic regression encoded as finite state machines. Our scientific case studies show its effectiveness in soil science to find sorption isotherms and for modeling hyper-elastic materials.

Viaarxiv icon

Shrinking Embeddings for Hyper-Relational Knowledge Graphs

Jun 03, 2023
Bo Xiong, Mojtaba Nayyer, Shirui Pan, Steffen Staab

Figure 1 for Shrinking Embeddings for Hyper-Relational Knowledge Graphs
Figure 2 for Shrinking Embeddings for Hyper-Relational Knowledge Graphs
Figure 3 for Shrinking Embeddings for Hyper-Relational Knowledge Graphs
Figure 4 for Shrinking Embeddings for Hyper-Relational Knowledge Graphs

Link prediction on knowledge graphs (KGs) has been extensively studied on binary relational KGs, wherein each fact is represented by a triple. A significant amount of important knowledge, however, is represented by hyper-relational facts where each fact is composed of a primal triple and a set of qualifiers comprising a key-value pair that allows for expressing more complicated semantics. Although some recent works have proposed to embed hyper-relational KGs, these methods fail to capture essential inference patterns of hyper-relational facts such as qualifier monotonicity, qualifier implication, and qualifier mutual exclusion, limiting their generalization capability. To unlock this, we present \emph{ShrinkE}, a geometric hyper-relational KG embedding method aiming to explicitly model these patterns. ShrinkE models the primal triple as a spatial-functional transformation from the head into a relation-specific box. Each qualifier ``shrinks'' the box to narrow down the possible answer set and, thus, realizes qualifier monotonicity. The spatial relationships between the qualifier boxes allow for modeling core inference patterns of qualifiers such as implication and mutual exclusion. Experimental results demonstrate ShrinkE's superiority on three benchmarks of hyper-relational KGs.

* To appear in ACL 2023 
Viaarxiv icon

Geometric Relational Embeddings: A Survey

Apr 24, 2023
Bo Xiong, Mojtaba Nayyeri, Ming Jin, Yunjie He, Michael Cochez, Shirui Pan, Steffen Staab

Figure 1 for Geometric Relational Embeddings: A Survey
Figure 2 for Geometric Relational Embeddings: A Survey
Figure 3 for Geometric Relational Embeddings: A Survey
Figure 4 for Geometric Relational Embeddings: A Survey

Geometric relational embeddings map relational data as geometric objects that combine vector information suitable for machine learning and structured/relational information for structured/relational reasoning, typically in low dimensions. Their preservation of relational structures and their appealing properties and interpretability have led to their uptake for tasks such as knowledge graph completion, ontology and hierarchy reasoning, logical query answering, and hierarchical multi-label classification. We survey methods that underly geometric relational embeddings and categorize them based on (i) the embedding geometries that are used to represent the data; and (ii) the relational reasoning tasks that they aim to improve. We identify the desired properties (i.e., inductive biases) of each kind of embedding and discuss some potential future work.

* Work in progress 
Viaarxiv icon

HiPrompt: Few-Shot Biomedical Knowledge Fusion via Hierarchy-Oriented Prompting

Apr 12, 2023
Jiaying Lu, Jiaming Shen, Bo Xiong, Wenjing Ma, Steffen Staab, Carl Yang

Medical decision-making processes can be enhanced by comprehensive biomedical knowledge bases, which require fusing knowledge graphs constructed from different sources via a uniform index system. The index system often organizes biomedical terms in a hierarchy to provide the aligned entities with fine-grained granularity. To address the challenge of scarce supervision in the biomedical knowledge fusion (BKF) task, researchers have proposed various unsupervised methods. However, these methods heavily rely on ad-hoc lexical and structural matching algorithms, which fail to capture the rich semantics conveyed by biomedical entities and terms. Recently, neural embedding models have proved effective in semantic-rich tasks, but they rely on sufficient labeled data to be adequately trained. To bridge the gap between the scarce-labeled BKF and neural embedding models, we propose HiPrompt, a supervision-efficient knowledge fusion framework that elicits the few-shot reasoning ability of large language models through hierarchy-oriented prompts. Empirical results on the collected KG-Hi-BKF benchmark datasets demonstrate the effectiveness of HiPrompt.

* In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval (Short-Paper Track), 2023  
Viaarxiv icon

Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs

Mar 21, 2023
Yunjie He, Mojtaba Nayyeri, Bo Xiong, Evgeny Kharlamov, Steffen Staab

Figure 1 for Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs
Figure 2 for Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs
Figure 3 for Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs
Figure 4 for Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs

Answering first-order logical (FOL) queries over knowledge graphs (KG) remains a challenging task mainly due to KG incompleteness. Query embedding approaches this problem by computing the low-dimensional vector representations of entities, relations, and logical queries. KGs exhibit relational patterns such as symmetry and composition and modeling the patterns can further enhance the performance of query embedding models. However, the role of such patterns in answering FOL queries by query embedding models has not been yet studied in the literature. In this paper, we fill in this research gap and empower FOL queries reasoning with pattern inference by introducing an inductive bias that allows for learning relation patterns. To this end, we develop a novel query embedding method, RoConE, that defines query regions as geometric cones and algebraic query operators by rotations in complex space. RoConE combines the advantages of Cone as a well-specified geometric representation for query embedding, and also the rotation operator as a powerful algebraic operation for pattern inference. Our experimental results on several benchmark datasets confirm the advantage of relational patterns for enhancing logical query answering task.

Viaarxiv icon

Explanation Shift: Investigating Interactions between Models and Shifting Data Distributions

Mar 14, 2023
Carlos Mougan, Klaus Broelemann, David Masip, Gjergji Kasneci, Thanassis Thiropanis, Steffen Staab

Figure 1 for Explanation Shift: Investigating Interactions between Models and Shifting Data Distributions
Figure 2 for Explanation Shift: Investigating Interactions between Models and Shifting Data Distributions
Figure 3 for Explanation Shift: Investigating Interactions between Models and Shifting Data Distributions
Figure 4 for Explanation Shift: Investigating Interactions between Models and Shifting Data Distributions

As input data distributions evolve, the predictive performance of machine learning models tends to deteriorate. In practice, new input data tend to come without target labels. Then, state-of-the-art techniques model input data distributions or model prediction distributions and try to understand issues regarding the interactions between learned models and shifting distributions. We suggest a novel approach that models how explanation characteristics shift when affected by distribution shifts. We find that the modeling of explanation shifts can be a better indicator for detecting out-of-distribution model behaviour than state-of-the-art techniques. We analyze different types of distribution shifts using synthetic examples and real-world data sets. We provide an algorithmic method that allows us to inspect the interaction between data set features and learned models and compare them to the state-of-the-art. We release our methods in an open-source Python package, as well as the code used to reproduce our experiments.

* arXiv admin note: text overlap with arXiv:2210.12369 
Viaarxiv icon

Demographic Parity Inspector: Fairness Audits via the Explanation Space

Mar 14, 2023
Carlos Mougan, Laura State, Antonio Ferrara, Salvatore Ruggieri, Steffen Staab

Figure 1 for Demographic Parity Inspector: Fairness Audits via the Explanation Space
Figure 2 for Demographic Parity Inspector: Fairness Audits via the Explanation Space
Figure 3 for Demographic Parity Inspector: Fairness Audits via the Explanation Space
Figure 4 for Demographic Parity Inspector: Fairness Audits via the Explanation Space

Even if deployed with the best intentions, machine learning methods can perpetuate, amplify or even create social biases. Measures of (un-)fairness have been proposed as a way to gauge the (non-)discriminatory nature of machine learning models. However, proxies of protected attributes causing discriminatory effects remain challenging to address. In this work, we propose a new algorithmic approach that measures group-wise demographic parity violations and allows us to inspect the causes of inter-group discrimination. Our method relies on the novel idea of measuring the dependence of a model on the protected attribute based on the explanation space, an informative space that allows for more sensitive audits than the primary space of input data or prediction distributions, and allowing for the assertion of theoretical demographic parity auditing guarantees. We provide a mathematical analysis, synthetic examples, and experimental evaluation of real-world data. We release an open-source Python package with methods, routines, and tutorials.

Viaarxiv icon

Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models

Feb 13, 2023
Cosimo Gregucci, Mojtaba Nayyeri, Daniel Hernández, Steffen Staab

Figure 1 for Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models
Figure 2 for Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models
Figure 3 for Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models
Figure 4 for Link Prediction with Attention Applied on Multiple Knowledge Graph Embedding Models

Predicting missing links between entities in a knowledge graph is a fundamental task to deal with the incompleteness of data on the Web. Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according to geometric criteria. Relations in the graph may follow patterns that can be learned, e.g., some relations might be symmetric and others might be hierarchical. However, the learning capability of different embedding models varies for each pattern and, so far, no single model can learn all patterns equally well. In this paper, we combine the query representations from several models in a unified one to incorporate patterns that are independently captured by each model. Our combination uses attention to select the most suitable model to answer each query. The models are also mapped onto a non-Euclidean manifold, the Poincar\'e ball, to capture structural patterns, such as hierarchies, besides relational patterns, such as symmetry. We prove that our combination provides a higher expressiveness and inference power than each model on its own. As a result, the combined model can learn relational and structural patterns. We conduct extensive experimental analysis with various link prediction benchmarks showing that the combined model outperforms individual models, including state-of-the-art approaches.

* ACM Web Conference 2023 
Viaarxiv icon

SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks

Jan 09, 2023
Thomas Monninger, Julian Schmidt, Jan Rupprecht, David Raba, Julian Jordan, Daniel Frank, Steffen Staab, Klaus Dietmayer

Figure 1 for SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks
Figure 2 for SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks
Figure 3 for SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks
Figure 4 for SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks

Understanding traffic scenes requires considering heterogeneous information about dynamic agents and the static infrastructure. In this work we propose SCENE, a methodology to encode diverse traffic scenes in heterogeneous graphs and to reason about these graphs using a heterogeneous Graph Neural Network encoder and task-specific decoders. The heterogeneous graphs, whose structures are defined by an ontology, consist of different nodes with type-specific node features and different relations with type-specific edge features. In order to exploit all the information given by these graphs, we propose to use cascaded layers of graph convolution. The result is an encoding of the scene. Task-specific decoders can be applied to predict desired attributes of the scene. Extensive evaluation on two diverse binary node classification tasks show the main strength of this methodology: despite being generic, it even manages to outperform task-specific baselines. The further application of our methodology to the task of node classification in various knowledge graphs shows its transferability to other domains.

* IEEE Robotics and Automation Letters (RA-L), 2023  
* Thomas Monninger and Julian Schmidt are co-first authors. The order was determined alphabetically 
Viaarxiv icon