Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,786 papers · 148 categories

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920172026
48 results for 8-bit Integers

This work proposes a complete 8-bit quantization framework for large-scale deep neural networks.

problem Training large-scale deep neural networks with high performance and low memory footprint.
method WAGEUBN framework that quantizes all data paths including weights, activations, gradients, errors, updates, and batch normalization.
result Achieves competitive accuracy on the ImageNet dataset using only 8-bit integers.

This paper evaluates quantization techniques for deep learning inference.

problem Reducing the size and improving inference of deep neural networks.
method Review and empirical evaluation of quantization parameters for various neural network models.
result 8-bit quantization maintains accuracy within 1% of floating-point models.

Improved neural quantization reduces accuracy loss to less than 1% with 4-bit weights.

problem Reducing accuracy loss in neural quantization below 8-bits.
method Layer-wise calibration and integer programming to optimize bit-width allocation.
result Less than 1% accuracy degradation with 4-bit weights and activations.

Improved deep learning model deployment on tiny MCUs with mixed-precision quantization.

problem Memory limitations prevent accurate deployment of DNN models on tiny MCUs.
method Automated mixed-precision quantization using Reinforcement Learning for MCU constraints.
result Mixed-precision models achieve high accuracy with uniform quantization policies.

Improved machine translation with INT8 hardware using a novel training method.

problem Training accurate machine translation models with limited hardware precision.
method Convert all Transformer matrix multiplications to 8-bit integer (INT8) without sacrificing accuracy.
result INT8 Transformer models achieve BLEU scores 99.3% to 100% relative to FP32 models.

FullyQT quantizes Transformer models to 8-bit precision without sacrificing translation quality.

problem Reducing computational costs of neural machine translation methods without performance loss.
method Proposes FullyQT, an all-inclusive quantization strategy for the Transformer.
result Achieves state-of-the-art quantization results, maintaining or improving translation quality.

Reduced precision computation for deep neural networks is one of the key areas addressing the widening compute gap driven by an exponential growth in model size. In recent years, deep learning training has largely migrated to 16-bit precision, with significant gains in performance and energy efficiency. However, attemp…

2019-05-29abs ↗pdf ↗

The state-of-the-art hardware platforms for training Deep Neural Networks (DNNs) are moving from traditional single precision (32-bit) computations towards 16 bits of precision -- in large part due to the high energy efficiency and smaller bit storage associated with using reduced-precision representations. However, un…

2018-12-19abs ↗pdf ↗

VoiceFilter-Lite separates speech from background in real-time for on-device speech recognition.

problem Separate speech from background in real-time for on-device speech recognition.
method Asymmetric loss, adaptive runtime suppression, quantization to 8-bit.
result VoiceFilter-Lite achieves real-time speech separation and maintains speech recognition performance.

Quantized Neural Networks (QNNs) are often used to improve network efficiency during the inference phase, i.e. after the network has been trained. Extensive research in the field suggests many different quantization schemes. Still, the number of bits required, as well as the best quantization scheme, are yet unknown. O…

2018-05-25abs ↗pdf ↗

WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.

problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.

We introduce a data-free quantization method for deep neural networks that does not require fine-tuning or hyperparameter selection. It achieves near-original model performance on common computer vision architectures and tasks. 8-bit fixed-point quantization is essential for efficient inference on modern deep learning …

2019-06-11abs ↗pdf ↗

Recently, the posit numerical format has shown promise for DNN data representation and compute with ultra-low precision ([5..8]-bit). However, majority of studies focus only on DNN inference. In this work, we propose DNN training using posits and compare with the floating point training. We evaluate on both MNIST and F…

2019-07-30abs ↗pdf ↗

In this paper, we firstly introduce a method to efficiently implement large-scale high-dimensional convolution with realistic memristor-based circuit components. An experiment verified simulator is adapted for accurate prediction of analog crossbar behavior. An improved conversion algorithm is developed to convert conv…

2018-09-14abs ↗pdf ↗

Low precision operations can provide scalability, memory savings, portability, and energy efficiency. This paper proposes SWALP, an approach to low precision training that averages low-precision SGD iterates with a modified learning rate schedule. SWALP is easy to implement and can match the performance of full-precisi…

2019-04-26abs ↗pdf ↗

Memory-augmented neural networks (MANNs) refer to a class of neural network models equipped with external memory (such as neural Turing machines and memory networks). These neural networks outperform conventional recurrent neural networks (RNNs) in terms of learning long-term dependency, allowing them to solve intrigui…

2017-11-10abs ↗pdf ↗

GCWSNet improves neural network training speed and accuracy with power transformation.

problem Training deep neural networks efficiently and accurately.
method Developed GCWS for hashing powered-GMM kernel, enabling power transformation on data.
result GCWSNet often improves classification accuracy and converges faster with one epoch.

Paper applies FloatSD8 to LSTM networks, reducing complexity and power.

problem Training and inference complexity of LSTM networks.
method Applied FloatSD8 for weights, 8-bit quantization for gradients/activations, reduced arithmetic precision.
result Successfully trained LSTM models with reduced complexity and preserved accuracy.

New q-deformed integers help compute Jones polynomials efficiently.

problem Computing Jones polynomials of rational links efficiently.
method Defining q-deformed integers from pairs of coprime integers and using them to compute Jones polynomials.
result Efficient algorithm for computing Jones polynomials of rational links.

Paper proposes a method to speed up DNNs by quantizing Winograd/Toom-Cook convolutions.

problem Speeding up convolution computations in DNNs with reduced time consumption and improved accuracy.
method Application of base change technique for quantized Winograd-aware training model.
result 8-bit quantized network achieves nearly the same accuracy as direct quantized convolution with minimal additional operations.

Generalized Steinberg module presentation for Gaussian and Eisenstein integers.

problem Presenting Steinberg modules for specific number rings.
method Generalization of Bykovskii's presentation to Gaussian and Eisenstein integers.
result Generalization does not yield a presentation for all Euclidean number rings.

Efficient Winograd convolution for INT8 networks using RNS.

problem Difficulty in applying Winograd algorithm to low-precision quantized networks.
method Extends Winograd algorithm to Residue Number System (RNS) for efficient INT8 convolution.
result Arithmetic complexity reduction up to 7.03x with performance improvement up to 2.30x-4.69x.

Surgery obstructions extended to integer homology spheres using Heegaard Floer homology.

problem Obstructing knots in integer homology spheres using surgery.
method Extending Heegaard Floer homology obstructions to all integer homology spheres for both positive and negative surgeries.
result Deduced a lower bound on b2(W)b_2(W) for smooth cobordism between integer homology spheres.

IDF++ improves integer discrete flows for lossless compression.

problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.

We use Nathanson's gg-adic representation of integers to relate metric properties of Cayley graphs of the integers with respect to various infinite generating sets SS to problems in additive number theory. If SS consists of all powers of a fixed integer gg, we find explicit formulas for the smallest positive intege…

2017-11-02abs ↗pdf ↗

New method for probabilistic modeling of integer submodular functions.

problem Lack of probabilistic modeling for integer submodular functions.
method Proposed Generalized Multilinear Extension and block-coordinate ascent algorithm.
result Demonstrated effectiveness and viability on real-world datasets.

Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size.As a result, there is a need for compression techniques that can significantly compress RNNs without negatively impacting task accuracy. This paper introduces a method to compress RNNs for resource constrained e…

2019-06-07abs ↗pdf ↗

Neural networks with integer weights approximate continuous functions efficiently.

problem Approximating continuous functions using neural networks with integer weights.
method Integrates superexpressive activation functions and integer weights.
result Convergence rate of order n2β2β+dlog2nn^{\frac{-2β}{2β+d}}\log_2n for neural network regression.

The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we show that the stable commutator length of elements in a surgery family is a ratio …

2010-11-05abs ↗pdf ↗

The article calculates a multiplying factor to convert rational Vassiliev invariants to integer-valued ones.

problem Converting rational valued Vassiliev invariants to integer-valued ones.
method Calculates the minimal multiplying factor λ needed for rational Vassiliev invariants to become integer-valued.
result Obtains a set of integer-valued Vassiliev invariants.

Improved RTM uses integer weights to reduce computation and increase interpretability.

problem Lack of interpretability in nonlinear regression models.
method Integer weighted RTM clauses, combined with a novel learning scheme.
result Significantly reduced computation cost with improved accuracy.

Paper develops machine learning algorithms to learn optimal integer weights for clinical risk scores.

problem Deriving optimal integer weights for clinical risk scores without computational burden.
method Flexible greedy optimization strategy to directly optimize a value function.
result Constructed an integer-weighted comorbidity score for measuring post-discharge mortality risk.