Demo Data from EDBT 2026 / reviewers in the wild / expert
Uranik Berisha
dblp:408/1997
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none
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 · 2 · 2 first-author · 2 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 |
Efficient and distributed learning · 76% Deep learning architectures and training · 19% Image recognition and object detection · 6% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
1.7 | 2 | 2025 | Variance-Based Pruning for Accelerating and Compressing Trained Networks · ICCV 2025 Efficient Data Driven Mixture-of-Expert Extraction from Trained Networks · CVPR 2025 |
Machine learning › Efficient and distributed learning › model compression › pruning › DNN pruning
one-shot pruning |
0.9 | 1 | 2025 | Variance-Based Pruning for Accelerating and Compressing Trained Networks · ICCV 2025 |
Machine learning › Efficient and distributed learning › model compression › pruning
structured pruning |
0.9 | 1 | 2025 | Variance-Based Pruning for Accelerating and Compressing Trained Networks · ICCV 2025 |
Machine learning › Deep learning architectures and training › transformer › efficient transformer
vision transformer efficiency |
0.9 | 1 | 2025 | Efficient Data Driven Mixture-of-Expert Extraction from Trained Networks · CVPR 2025 |
Computer vision › Image recognition and object detection
image classification |
0.3 | 1 | 2025 | Variance-Based Pruning for Accelerating and Compressing Trained Networks · ICCV 2025 |
Methods — techniques the papers use, named apart from their topics
fine-tuning · 1.7expert subnetwork extraction · 0.9activation statistics · 0.9activation clustering · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Data Driven Mixture-of-Expert Extraction from Trained NetworksabstractVision Transformers (ViTs) have emerged as the state-of-the-art models in various Computer Vision (CV) tasks, but their high computational and resource demands pose significant challenges. While Mixture-of-Experts (MoE) can make these models more efficient, they often require costly retraining or even training from scratch. Recent developments aim to reduce these computational costs by leveraging pretrained networks. These have been shown to produce sparse activation patterns in the Multi-Layer Perceptrons (MLPs) of the encoder blocks, allowing for conditional activation of only relevant subnetworks for each sample.Building on this idea, we propose a new method to construct MoE variants from pretrained models. Our approach extracts expert subnetworks from the model’s MLP layers post-training in two phases. First, we cluster output activations to identify distinct activation patterns. In the second phase, we use these clusters to extract the corresponding subnetworks responsible for producing them. On ImageNet-1k recognition tasks, we demonstrate that these extracted experts can perform surprisingly well out of the box and require only minimal fine-tuning to regain 98% of the original performance, all while reducing MACs and model size, by up to 36% and 32% respectively. Uranik Berisha, Jens Mehnert, Alexandru Condurache |
CVPR | 1 |
| 2025 | Variance-Based Pruning for Accelerating and Compressing Trained NetworksabstractIncreasingly expensive training of ever larger models such as Vision Transfomers motivate reusing the vast library of already trained state-of-the-art networks. However, their latency, high computational costs and memory demands pose significant challenges for deployment, especially on resource-constrained hardware. While structured pruning methods can reduce these factors, they often require costly retraining, sometimes for up to hundreds of epochs, or even training from scratch to recover the lost accuracy resulting from the structural modifications. Maintaining the provided performance of trained models after structured pruning and thereby avoiding extensive retraining remains a challenge. To solve this, we introduce Variance-Based Pruning, a simple and structured one-shot pruning technique for efficiently compressing networks, with minimal finetuning. Our approach first gathers activation statistics, which are used to select neurons for pruning. Simultaneously the mean activations are integrated back into the model to preserve a high degree of performance. On ImageNet-1k recognition tasks, we demonstrate that directly after pruning DeiT-Base retains over 70% of its original performance and requires only 10 epochs of fine-tuning to regain 99% of the original accuracy while simultaneously reducing MACs by 35% and model size by 36%, thus speeding up the model by 1.44x. The code is available at: https://github.com/boschresearch/variance-based-pruning Uranik Berisha, Jens Mehnert, Alexandru Condurache |
ICCV | 1 |