Oscar Artur Bernd Berg
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Oscar Artur Bernd Berg has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Axel Jantsch
Institute of Computer Technology, TU Wien, 1040 Vienna, Austria
3 shared publications - Eiraj Saqib
Department of Computer and Electrical Engineering, Mid Sweden University, Sundsvall, Sweden
3 shared publications - Irida Shallari
Department of Computer and Electrical Engineering, Mid Sweden University, Sundsvall, Sweden
3 shared publications - Isaac Sánchez Leal
Department of Computer and Electrical Engineering, Mid Sweden University, Sundsvall, Sweden
3 shared publications - Silvia Krug
Institut fr Mikroelektronik- und Mechatronik-Systeme gemeinntzige GmbH (IMMS GmbH), Ilmenau, Germany
3 shared publications - Mattias O’ Nils
Department of Computer and Electrical Engineering, Mid Sweden University, Sundsvall, Sweden
2 shared publications
Latest Publications
- Open Access
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
BranchySplit: Dynamic Partitioning and Early Exits for Accelerated Edge Inference
Deploying deep neural networks (DNNs) in real-time, resource-constrained edge environments remains a significant challenge due to the increasing depth and computational demand of state-of-the-art models. While state-of-the-art split computing and early-exit architectures independently offer solutions to reduce inference latency and offloading overhead, they are rarely integrated in a unified framework. This paper introduces BranchySplit, a novel architecture that combines dynamic state-of-the-art split computing with early exit mechanisms to accelerate inference in edge-cloud systems. Our method employs a shared dynamic autoencoder to support multiple partitioning points, enabling runtime adaptability based on varying system conditions. By integrating early exit branches at intermediate layers, the model can terminate inference early when confidence is sufficient, further reducing computation and communication. Extensive experiments on Caltech-256 and Tiny-ImageNet dataset using four backbone models (VGG-16, ResNet-50, Efficientformerv2-S2, and ConvNeXT-small) show that our approach consistently outperforms the traditional split computing approaches, achieving up to 2.7x latency speed-up compared to an all-in-server solution, while maintaining comparable or even improved accuracy. In addition, our proposed dynamic compression pipeline achieves a higher speed-up compared to the pipeline in similar work, i.e. SPINN, with up to 10x for ResNet50 on caltech-256. These results demonstrate the efficacy of BranchySplit in enabling low-latency, resource-efficient vision inference in heterogeneous edge-cloud settings.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessBranchySplit: Dynamic Partitioning and Early Exits for Accelerated Edge Inference
Deploying deep neural networks (DNNs) in real-time, resource-constrained edge environments remains a significant challenge due to the increasing depth and computational demand of state-of-the-art models. While state-of-the-art split computing and early-exit architectures independently offer solutions to reduce inference latency and offloading overhead, they are rarely integrated in a unified framework. This paper introduces BranchySplit, a novel architecture that combines dynamic state-of-the-art split computing with early exit mechanisms to accelerate inference in edge-cloud systems. Our method employs a shared dynamic autoencoder to support multiple partitioning points, enabling runtime adaptability based on varying system conditions. By integrating early exit branches at intermediate layers, the model can terminate inference early when confidence is sufficient, further reducing computation and communication. Extensive experiments on Caltech-256 and Tiny-ImageNet dataset using four backbone models (VGG-16, ResNet-50, Efficientformerv2-S2, and ConvNeXT-small) show that our approach consistently outperforms the traditional split computing approaches, achieving up to 2.7x latency speed-up compared to an all-in-server solution, while maintaining comparable or even improved accuracy. In addition, our proposed dynamic compression pipeline achieves a higher speed-up compared to the pipeline in similar work, i.e. SPINN, with up to 10x for ResNet50 on caltech-256. These results demonstrate the efficacy of BranchySplit in enabling low-latency, resource-efficient vision inference in heterogeneous edge-cloud settings.
- Open Access
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 103640-103648
TCL: Time-Dependent Clustering Loss for Optimizing Post-Training Feature Map Quantization for Partitioned DNNs
This paper introduces an enhanced approach for deploying deep learning models on resource-constrained IoT devices by combining model partitioning, autoencoder-based compression, quantization with Time Dependent Clustering Loss (TCL) regularization, and lossless compression, to reduce communication overhead, minimizing latency while maintaining accuracy. The autoencoder compresses feature maps at the partitioning point before quantization, effectively reducing data size and preserving accuracy. TCL regularization clusters activations at the partitioning point to align with quantization levels, minimizing quantization error and ensuring accuracy even with extreme low-bitwidth quantization. Our method is evaluated on classification models (ResNet-50, EfficientNetV2-S) and an object detection model (YOLOv10n) using the TinyImageNet-200 and Pascal VOC datasets. Deployed on Raspberry Pi 4 B and GPU, each model is tested across various partitioning points, quantization bit-widths (1-bit, 2-bit, and 3-bit), communication datarate (1MB/s to 10MB/s), and LZMA lossless compression. For a partitioned ResNet-50 after the convolutional stem block, the speed-up against a server solution is 2.33× and 1.85x compared to the all-in-node solution, with only a minimal accuracy drop of less than one percentage points. The proposed framework offers a scalable solution for deploying high-performance AI models on IoT devices, extending the feasibility of real-time inference in resource-constrained environments.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 103640-103648
Open AccessTCL: Time-Dependent Clustering Loss for Optimizing Post-Training Feature Map Quantization for Partitioned DNNs
This paper introduces an enhanced approach for deploying deep learning models on resource-constrained IoT devices by combining model partitioning, autoencoder-based compression, quantization with Time Dependent Clustering Loss (TCL) regularization, and lossless compression, to reduce communication overhead, minimizing latency while maintaining accuracy. The autoencoder compresses feature maps at the partitioning point before quantization, effectively reducing data size and preserving accuracy. TCL regularization clusters activations at the partitioning point to align with quantization levels, minimizing quantization error and ensuring accuracy even with extreme low-bitwidth quantization. Our method is evaluated on classification models (ResNet-50, EfficientNetV2-S) and an object detection model (YOLOv10n) using the TinyImageNet-200 and Pascal VOC datasets. Deployed on Raspberry Pi 4 B and GPU, each model is tested across various partitioning points, quantization bit-widths (1-bit, 2-bit, and 3-bit), communication datarate (1MB/s to 10MB/s), and LZMA lossless compression. For a partitioned ResNet-50 after the convolutional stem block, the speed-up against a server solution is 2.33× and 1.85x compared to the all-in-node solution, with only a minimal accuracy drop of less than one percentage points. The proposed framework offers a scalable solution for deploying high-performance AI models on IoT devices, extending the feasibility of real-time inference in resource-constrained environments.
- Open Access
- 6 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Efficient Inference of parallel partitioned hybrid-Vision Transformers
- 6 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessEfficient Inference of parallel partitioned hybrid-Vision Transformers