VLDB 2026 Research / reviewers in the wild / expert
Alexander Theus
dblp:316/4576
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0003-3633-5243ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 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
2 papers |
Deep learning architectures and training · 49% Efficient and distributed learning · 38% Optimization for machine learning · 13% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training › loss landscape › mode connectivity
linear mode connectivity |
0.9 | 1 | 2025 | Generalized Linear Mode Connectivity for Transformers · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
loss landscape |
0.9 | 1 | 2025 | Generalized Linear Mode Connectivity for Transformers · NeurIPS 2025 |
Machine learning › Deep learning architectures and training › symmetry-aware learning
permutation invariance |
0.9 | 1 | 2025 | Generalized Linear Mode Connectivity for Transformers · NeurIPS 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | Towards Meta-Pruning via Optimal Transport · ICLR 2024 |
Machine learning › Efficient and distributed learning
model merging |
0.8 | 1 | 2024 | Towards Meta-Pruning via Optimal Transport · ICLR 2024 |
Machine learning › Optimization for machine learning
optimal transport |
0.8 | 1 | 2024 | Towards Meta-Pruning via Optimal Transport · ICLR 2024 |
Machine learning › Efficient and distributed learning › model compression › pruning
structured pruning |
0.8 | 1 | 2024 | Towards Meta-Pruning via Optimal Transport · ICLR 2024 |
Machine learning › Deep learning architectures and training
transformer |
0.3 | 1 | 2025 | Generalized Linear Mode Connectivity for Transformers · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
orthogonal transformation · 0.9neuron reordering · 0.9invertible maps · 0.9optimal transport · 0.8model fusion · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Generalized Linear Mode Connectivity for TransformersabstractUnderstanding the geometry of neural network loss landscapes is a central question in deep learning, with implications for generalization and optimization. A striking phenomenon is $\textit{linear mode connectivity}$ (LMC), where independently trained models can be connected by low- or zero-barrier paths, despite appearing to lie in separate loss basins. However, this is often obscured by symmetries in parameter space—such as neuron permutations—which make functionally equivalent models appear dissimilar. Prior work has predominantly focused on neuron reordering through permutations, but such approaches are limited in scope and fail to capture the richer symmetries exhibited by modern architectures such as Transformers. In this work, we introduce a unified framework that captures four symmetry classes—permutations, semi-permutations, orthogonal transformations, and general invertible maps—broadening the set of valid reparameterizations and subsuming many previous approaches as special cases. Crucially, this generalization enables, for the first time, the discovery of low- and zero-barrier linear interpolation paths between independently trained Vision Transformers and GPT-2 models. Furthermore, our framework extends beyond pairwise alignment, to multi-model and width-heterogeneous settings, enabling alignment across architectures of different sizes. These results reveal deeper structure in the loss landscape and underscore the importance of symmetry-aware analysis for understanding model space geometry. Alexander Theus, Alessandro Cabodi, Sotiris Anagnostidis, Antonio Orvieto, Sidak Pal Singh, Valentina Boeva |
NeurIPS | 1 |
| 2024 | Towards Meta-Pruning via Optimal TransportabstractStructural pruning of neural networks conventionally relies on identifying and discarding less important neurons, a practice often resulting in significant accuracy loss that necessitates subsequent fine-tuning efforts. This paper introduces a novel approach named Intra-Fusion, challenging this prevailing pruning paradigm.
Unlike existing methods that focus on designing meaningful neuron importance metrics, Intra-Fusion redefines the overlying pruning procedure.
Through utilizing the concepts of model fusion and Optimal Transport, we leverage an agnostically given importance metric to arrive at a more effective sparse model representation.
Notably, our approach achieves substantial accuracy recovery without the need for resource-intensive fine-tuning, making it an efficient and promising tool for neural network compression.
Additionally, we explore how fusion can be added to the pruning process to significantly decrease the training time while maintaining competitive performance. We benchmark our results for various networks on commonly used datasets such as CIFAR-10, CIFAR-100, and ImageNet. More broadly, we hope that the proposed Intra-Fusion approach invigorates exploration into a fresh alternative to the predominant compression approaches.
Our code is available [here](https://github.com/alexandertheus/Intra-Fusion). Alexander Theus, Olin Geimer, Friedrich Wicke, Thomas Hofmann 0001, Sotiris Anagnostidis, Sidak Pal Singh |
ICLR | 1 |
| 2022 | HyText - A Scene-Text Extraction Method for Video Retrieval
Alexander Theus, Luca Rossetto, Abraham Bernstein |
MMM (2) | 1 |