Saved in:
Bibliographic Details
Main Authors: Schrödter, Karsten, Stenkamp, Jan, Herrmann, Nina, Gieseke, Fabian
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.05172
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910042420150272
author Schrödter, Karsten
Stenkamp, Jan
Herrmann, Nina
Gieseke, Fabian
author_facet Schrödter, Karsten
Stenkamp, Jan
Herrmann, Nina
Gieseke, Fabian
contents The growing demand for machine learning applications in the context of the Internet of Things calls for new approaches to optimize the use of limited compute and memory resources. Despite significant progress that has been made w.r.t. reducing model sizes and improving efficiency, many applications still require remote servers to provide the required resources. However, such approaches rely on transmitting data from edge devices to remote servers, which may not always be feasible due to bandwidth, latency, or energy constraints. We propose a task-specific, trainable feature quantization layer that compresses the input features of a neural network. This can significantly reduce the amount of data that needs to be transferred from the device to a remote server. In particular, the layer allows each input feature to be quantized to a user-defined number of bits, enabling a simple on-device compression at the time of data collection. The layer is designed to approximate step functions with sigmoids, enabling trainable quantization thresholds. By concatenating outputs from multiple sigmoids, introduced as bitwise soft quantization, it achieves trainable quantized values when integrated with a neural network. We compare our method to full-precision inference as well as to several quantization baselines. Experiments show that our approach outperforms standard quantization methods, while maintaining accuracy levels close to those of full-precision models. In particular, depending on the dataset, compression factors of $5\times$ to $16\times$ can be achieved compared to $32$-bit input without significant performance loss.
format Preprint
id arxiv_https___arxiv_org_abs_2603_05172
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Trainable Bitwise Soft Quantization for Input Feature Compression
Schrödter, Karsten
Stenkamp, Jan
Herrmann, Nina
Gieseke, Fabian
Machine Learning
The growing demand for machine learning applications in the context of the Internet of Things calls for new approaches to optimize the use of limited compute and memory resources. Despite significant progress that has been made w.r.t. reducing model sizes and improving efficiency, many applications still require remote servers to provide the required resources. However, such approaches rely on transmitting data from edge devices to remote servers, which may not always be feasible due to bandwidth, latency, or energy constraints. We propose a task-specific, trainable feature quantization layer that compresses the input features of a neural network. This can significantly reduce the amount of data that needs to be transferred from the device to a remote server. In particular, the layer allows each input feature to be quantized to a user-defined number of bits, enabling a simple on-device compression at the time of data collection. The layer is designed to approximate step functions with sigmoids, enabling trainable quantization thresholds. By concatenating outputs from multiple sigmoids, introduced as bitwise soft quantization, it achieves trainable quantized values when integrated with a neural network. We compare our method to full-precision inference as well as to several quantization baselines. Experiments show that our approach outperforms standard quantization methods, while maintaining accuracy levels close to those of full-precision models. In particular, depending on the dataset, compression factors of $5\times$ to $16\times$ can be achieved compared to $32$-bit input without significant performance loss.
title Trainable Bitwise Soft Quantization for Input Feature Compression
topic Machine Learning
url https://arxiv.org/abs/2603.05172