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,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920172026
48 results for Low bit representation

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 ↗

Kernel Quantization improves CNN compression without sacrificing performance.

problem Efficiently compressing CNN models without significant performance loss.
method Quantizes convolution kernels as the unit, learning a codebook for low-bit indexes.
result Significant compression ratio achieved with minimal accuracy loss.

The use of low-precision fixed-point arithmetic along with stochastic rounding has been proposed as a promising alternative to the commonly used 32-bit floating point arithmetic to enhance training neural networks training in terms of performance and energy efficiency. In the first part of this paper, the behaviour of …

2018-04-14abs ↗pdf ↗

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.

A new quantization strategy reduces Transformer model size and inference time.

problem Heavy computation load and memory overhead in Transformer models for mobile devices.
method Mixed precision quantization with varying bits per word in embedding blocks.
result 11.8x smaller model size and 3.5x speed up for on-device NMT.

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.

Paper improves DNN accelerator robustness against bit errors with energy savings.

problem Bit errors in quantized DNN weights reduce energy efficiency.
method Combines robust fixed-point quantization, weight clipping, and random bit error training.
result Significantly improves robustness against random bit errors with high energy savings.

New method predicts binary matrix entries using empirical Bayes and low-rank structure.

problem Predicting unobserved entries in binary matrices.
method Empirical Bayes method motivated by Efron--Morris estimator, exploiting low-rank structure.
result Superior performance in predictive accuracy, calibration, and efficiency compared to existing methods.

Training of large-scale deep neural networks is often constrained by the available computational resources. We study the effect of limited precision data representation and computation on neural network training. Within the context of low-precision fixed-point computations, we observe the rounding scheme to play a cruc…

2015-02-09abs ↗pdf ↗

In order to efficiently transmit and store speech signals, speech codecs create a minimally redundant representation of the input signal which is then decoded at the receiver with the best possible perceptual quality. In this work we demonstrate that a neural network architecture based on VQ-VAE with a WaveNet decoder …

2019-10-14abs ↗pdf ↗

Recent machine learning methods use increasingly large deep neural networks to achieve state of the art results in various tasks. The gains in performance come at the cost of a substantial increase in computation and storage requirements. This makes real-time implementations on limited resources hardware a challenging …

2019-02-18abs ↗pdf ↗

State of the art deep learning models have made steady progress in the fields of computer vision and natural language processing, at the expense of growing model sizes and computational complexity. Deploying these models on low power and mobile devices poses a challenge due to their limited compute capabilities and str…

2018-10-25abs ↗pdf ↗

Bayesian Bits unifies quantization and pruning through gradient optimization.

problem Joint mixed precision quantization and pruning for efficient neural networks.
method Gradient-based optimization with a novel bit width decomposition and learnable stochastic gates.
result Bayesian Bits achieves better accuracy vs. efficiency trade-off compared to static bit width networks.

BEGIN network models binary data without parametric assumptions.

problem Conditional independence in non-parametric families of binary data.
method BEGIN network models binary data using sparse linear representations and block factorizations.
result BEGIN network captures conditional independence for arbitrary binary and multinomial variables.

LSQ+ improves quantization of neural nets with Swish activations, achieving state-of-the-art results.

problem Quantization of neural nets with Swish activations, especially negative activations, leads to significant performance loss.
method Introduces learnable scale and offset parameters for asymmetric quantization, and uses MSE-based initialization for quantization parameters.
result Significantly outperforms LSQ for low-bit quantization of neural nets with Swish activations, achieving up to 5.6% gain with W2A2 quantization of EfficientNet-B0.

Binary, or one-bit, representations of data arise naturally in many applications, and are appealing in both hardware implementations and algorithm design. In this work, we study the problem of data classification from binary data and propose a framework with low computation and resource costs. We illustrate the utility…

2017-07-06abs ↗pdf ↗

Improves bit error tolerance in RRAM-based BNNs without overfitting.

problem Bit errors in RRAM-based BNNs reduce accuracy and overfit to training error rates.
method Proposes straight-through gradient approximation and a novel regularizer.
result Improves BNNs' robustness to bit errors without overfitting.

CALDERA compresses large language models by approximating weight matrices with low-rank, low-precision factors.

problem The large sizes of Large Language Models (LLMs) hinder deployment on edge devices.
method CALDERA approximates weight matrices W\mathbf{W} as Q+LR\mathbf{Q} + \mathbf{L}\mathbf{R}, where L\mathbf{L} and R\mathbf{R} are low-rank factors quantized to low precision.
result CALDERA achieves better zero-shot performance than existing techniques, especially with low bit precision.

Although deep neural networks are highly effective, their high computational and memory costs severely challenge their applications on portable devices. As a consequence, low-bit quantization, which converts a full-precision neural network into a low-bitwidth integer version, has been an active and promising research t…

2019-11-21abs ↗pdf ↗

We consider the problem of noisy 1-bit matrix completion under an exact rank constraint on the true underlying matrix MM^*. Instead of observing a subset of the noisy continuous-valued entries of a matrix MM^*, we observe a subset of noisy 1-bit (or binary) measurements generated according to a probabilistic model. W…

2015-02-24abs ↗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 ↗

A new method, REC, compresses images by encoding their latent representations efficiently.

problem Efficiently compressing single images with latent representations.
method Relative Entropy Coding (REC) that directly encodes latent representations with codelength close to relative entropy.
result REC is more efficient for single image compression compared to previous methods and is competitive for lossy compression.

We study an extreme scenario in multi-label learning where each training instance is endowed with a single one-bit label out of multiple labels. We formulate this problem as a non-trivial special case of one-bit rank-one matrix sensing and develop an efficient non-convex algorithm based on alternating power iteration. …

2017-03-17abs ↗pdf ↗

MSD removes dequantization bottleneck in LLM inference by approximating high-precision activations.

problem Dequantization bottleneck in LLM inference on modern AI accelerators.
method MSD decomposes high-precision activations into multiple low-precision components for direct multiplication with quantized weights.
result MSD avoids INT8-to-BF16 weight conversion, reducing dequantization cycles and HBM traffic.

Low-precision computation is often used to lower the time and energy cost of machine learning, and recently hardware accelerators have been developed to support it. Still, it has been used primarily for inference - not training. Previous low-precision training algorithms suffered from a fundamental tradeoff: as the num…

2018-03-09abs ↗pdf ↗

Similar to convolution neural networks, recurrent neural networks (RNNs) typically suffer from over-parameterization. Quantizing bit-widths of weights and activations results in runtime efficiency on hardware, yet it often comes at the cost of reduced accuracy. This paper proposes a quantization approach that increases…

2017-10-20abs ↗pdf ↗

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 ↗

Matrix completion has a long-time history of usage as the core technique of recommender systems. In particular, 1-bit matrix completion, which considers the prediction as a ``Recommended'' or ``Not Recommended'' question, has proved its significance and validity in the field. However, while customers and products aggre…

2019-04-07abs ↗pdf ↗