Julius von Rohrscheidt

dblp:330/4381 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Graph learning · 34% Representation and self-supervised learning · 16% Trustworthy machine learning · 9%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text representation
contextualized word embeddings
0.912025
Less is More: Local Intrinsic Dimensions of Contextual Language Models · NeurIPS 2025
Machine learning › Transfer learning and domain adaptation
fine-tuning
0.912025
Less is More: Local Intrinsic Dimensions of Contextual Language Models · NeurIPS 2025
Machine learning › Graph learning
graph neural network
0.912025
Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms · ICML 2025
Machine learning › Graph learning
graph representation learning
0.912025
Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms · ICML 2025
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning
intrinsic dimension
0.912025
Less is More: Local Intrinsic Dimensions of Contextual Language Models · NeurIPS 2025
Machine learning › Trustworthy machine learning
language model interpretability
0.912025
Less is More: Local Intrinsic Dimensions of Contextual Language Models · NeurIPS 2025
Machine learning › Graph learning › graph neural network
node classification
0.912025
Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms · ICML 2025
Machine learning › Deep learning architectures and training
training dynamics
0.912025
Less is More: Local Intrinsic Dimensions of Contextual Language Models · NeurIPS 2025
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › intrinsic dimension
intrinsic dimension estimation
0.712023
Topological Singularity Detection at Multiple Scales · ICML 2023
Machine learning › Learning theory › inductive bias
manifold hypothesis
0.712023
Topological Singularity Detection at Multiple Scales · ICML 2023
Robotics › Motion planning and robot control
singularity analysis
0.712023
Topological Singularity Detection at Multiple Scales · ICML 2023
Machine learning › Graph learning
topological data analysis
0.712023
Topological Singularity Detection at Multiple Scales · ICML 2023

Methods — techniques the papers use, named apart from their topics

rotation-invariant metric · 0.9local intrinsic dimension estimation · 0.9euler characteristic transform · 0.9topological framework · 0.7euclidicity score · 0.7
YearPublicationVenuePosition
2025 Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms
abstract
The Euler Characteristic Transform (ECT) is an efficiently computable geometrical-topological invariant that characterizes the global shape of data. In this paper, we introduce the local Euler Characteristic Transform ($\ell$-ECT), a novel extension of the ECT designed to enhance expressivity and interpretability in graph representation learning. Unlike traditional Graph Neural Networks (GNNs), which may lose critical local details through aggregation, the $\ell$-ECT provides a lossless representation of local neighborhoods. This approach addresses key limitations in GNNs by preserving nuanced local structures while maintaining global interpretability. Moreover, we construct a rotation-invariant metric based on $\ell$-ECTs for spatial alignment of data spaces. Our method demonstrates superior performance compared to standard GNNs on various benchmarking node classification tasks, while also offering theoretical guarantees of its effectiveness.
Julius von Rohrscheidt, Bastian Rieck
ICML1
2025 Less is More: Local Intrinsic Dimensions of Contextual Language Models
abstract
Understanding the internal mechanisms of large language models (LLMs) remains a challenging and complex endeavor. Even fundamental questions, such as how fine-tuning affects model behavior, often require extensive empirical evaluation. In this paper, we introduce a novel perspective based on the geometric properties of contextual latent embeddings to study the effects of training and fine-tuning. To that end, we measure the local dimensions of a contextual language model's latent space and analyze their shifts during training and fine-tuning. We show that the local dimensions provide insights into the model's training dynamics and generalization ability. Specifically, the mean of the local dimensions predicts when the model’s training capabilities are exhausted, as exemplified in a dialogue state tracking task, overfitting, as demonstrated in an emotion recognition task, and grokking, as illustrated with an arithmetic task. Furthermore, our experiments suggest a practical heuristic: reductions in the mean local dimension tend to accompany and predict subsequent performance gains. Through this exploration, we aim to provide practitioners with a deeper understanding of the implications of fine-tuning on embedding spaces, facilitating informed decisions when configuring models for specific applications. The results of this work contribute to the ongoing discourse on the interpretability, adaptability, and generalizability of LLMs by bridging the gap between intrinsic model mechanisms and geometric properties in the respective embeddings.
Benjamin Matthias Ruppik, Julius von Rohrscheidt, Carel van Niekerk, Michael Heck, Renato Vukovic, Shutong Feng, Hsien-Chin Lin, Nurul Lubis, Bastian Rieck, Marcus Zibrowius, Milica Gasic
NeurIPS2
2023 Topological Singularity Detection at Multiple Scales
abstract
The manifold hypothesis, which assumes that data lies on or close to an unknown manifold of low intrinsic dimension, is a staple of modern machine learning research. However, recent work has shown that real-world data exhibits distinct non-manifold structures, i.e. singularities, that can lead to erroneous findings. Detecting such singularities is therefore crucial as a precursor to interpolation and inference tasks. We address this issue by developing a topological framework that (i) quantifies the local intrinsic dimension, and (ii) yields a Euclidicity score for assessing the ’manifoldness’ of a point along multiple scales. Our approach identifies singularities of complex spaces, while also capturing singular structures and local geometric complexity in image data.
Julius von Rohrscheidt, Bastian Rieck
ICML1