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.

169,042 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for floating point arithmetic

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 ↗

The wide adoption of DNNs has given birth to unrelenting computing requirements, forcing datacenter operators to adopt domain-specific accelerators to train them. These accelerators typically employ densely packed full precision floating-point arithmetic to maximize performance per area. Ongoing research efforts seek t…

2018-04-04abs ↗pdf ↗

Deep neural networks (DNN) are powerful models for many pattern recognition tasks, yet their high computational complexity and memory requirement limit them to applications on high-performance computing platforms. In this paper, we propose a new method to evaluate DNNs trained with 32bit floating point (float32) accura…

2018-10-23abs ↗pdf ↗

Researchers find floating point errors can mislead neural network verifiers.

problem Floating point arithmetic inaccuracies mislead neural network verifiers.
method Efficiently searches inputs and constructs neural network architectures to exploit verification errors.
result Floating point errors can systematically mislead neural network verifiers.

Deep neural networks struggle with numerical instability during training.

problem Numerical instability in gradient descent training of deep neural networks.
method Analysis of floating-point arithmetic and gradient descent in ReLU neural networks.
result It is highly unlikely for ReLU networks to maintain a superlinear number of affine pieces during training.

SIMD operations boost Bayesian computations up to 6x faster.

problem Expensive Bayesian computations are computationally intensive and parallelizable.
method Demonstrated the utility of SIMD operations for Bayesian applications using standard libraries.
result Up to 6x improvement in floating point arithmetic performance.

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 ↗

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.

Researchers show NN-based communication algorithms can be implemented on hardware without significant performance loss.

problem Reducing complexity and improving performance of NN-based communication algorithms for practical hardware implementation.
method Implementation of NN-based algorithms in fixed-point arithmetic with quantized weights on specialized hardware (FPGAs, ASICs).
result It is possible to implement NN-based algorithms in fixed-point arithmetic with quantized weights on hardware without significant performance loss.

We characterize the price of an Asian option, a financial contract, as a fixed-point of a non-linear operator. In recent years, there has been interest in incorporating changes of regime into the parameters describing the evolution of the underlying asset price, namely the interest rate and the volatility, to model sud…

2015-10-28abs ↗pdf ↗

Paper proposes training deep neural networks with 8-bit floating point precision.

problem Challenges in training deep neural networks at 8-bit precision due to higher precision and dynamic range requirements.
method Proposes a method to train deep neural networks using 8-bit floating point for weights, activations, errors, and gradients. Introduces an enhanced loss scaling method and stochastic rounding technique.
result Demonstrates state-of-the-art accuracy across multiple datasets and workloads compared to full precision baseline.

Kernel methods are widespread in machine learning; however, they are limited by the quadratic complexity of the construction, application, and storage of kernel matrices. Low-rank matrix approximation algorithms are widely used to address this problem and reduce the arithmetic and storage cost. However, we observed tha…

2015-05-03abs ↗pdf ↗

Cheetah framework optimizes DNNs for edge devices using low-precision formats.

problem Reducing DNN model size for edge devices while maintaining accuracy.
method Mixed low-precision hardware and software co-design framework using posit and other formats.
result 16-bit posits outperform 16-bit floating point in training, and [5..8]-bit posits improve inference performance.

We consider the problem of estimating the arithmetic average of a finite collection of real vectors stored in a distributed fashion across several compute nodes subject to a communication budget constraint. Our analysis does not rely on any statistical assumptions about the source of the vectors. This problem arises as…

2016-11-22abs ↗pdf ↗

StatQAT optimizes quantization for deep networks, reducing computational cost and memory usage.

problem Optimal quantization parameters selection for deep neural networks with diverse data distributions.
method Statistical error analysis framework for uniform and floating-point quantization, iterative and analytic quantizers designed for arbitrary and Gaussian-like distributions.
result Improved accuracy and stability in training low-precision neural networks.

New method for pricing discrete Asian and Lookback options under Heston model.

problem Efficient pricing of discrete Asian and Lookback options under Heston model.
method Data-driven approach using artificial neural networks and stochastic collocation points.
result High accuracy and significant computational time reduction compared to classical methods.

For a convex body on the Euclidean unit sphere the spherical convex floating body is introduced. The asymptotic behavior of the volume difference of a spherical convex body and its spherical floating body is investigated. This gives rise to a new spherical area measure, the floating area. Remarkably, this floating area…

2014-11-27abs ↗pdf ↗

Asymptotic results for weighted floating bodies are established and used to obtain new proofs for the existence of floating areas on the sphere and in hyperbolic space and to establish the existence of floating areas in Hilbert geometries. Results on weighted best and random approximation and the new approach to floati…

2016-11-13abs ↗pdf ↗

G-Net constructs binary neural networks with high accuracy using randomized binary embeddings.

problem Creating high-accuracy binary neural networks with theoretical guarantees.
method Proposes a novel floating-point G-Net family with randomized binary embeddings and theoretical accuracy guarantees.
result Empirically, G-Net achieves almost 30% higher accuracy on CIFAR-10 compared to prior HDC models.

We carry out a systematic investigation on floating bodies in real space forms. A new unifying approach not only allows us to treat the important classical case of Euclidean space as well as the recent extension to the Euclidean unit sphere, but also the new extension of floating bodies to hyperbolic space. Our main re…

2016-06-24abs ↗pdf ↗

The study analyzes convergence of adaptive optimizers under low-precision training.

problem Understanding why low-precision training remains effective for large models.
method Developed a theoretical framework for analyzing convergence of adaptive optimizers under floating-point quantization.
result Adaptive optimizers retain convergence rates close to full-precision methods under logarithmic mantissa scaling.

This paper explains how low-precision arithmetic causes loss spikes in deep learning models.

problem Loss spikes during long-term training of deep neural networks.
method Analyzes the impact of floating-point precision limits on gradient updates and feature means.
result Numerical Feature Inflation (NFI) explains loss spikes and rapid parameter norm growth.

With ever-increasing computational demand for deep learning, it is critical to investigate the implications of the numeric representation and precision of DNN model weights and activations on computational efficiency. In this work, we explore unconventional narrow-precision floating-point representations as it relates …

2018-08-07abs ↗pdf ↗

Study counts and equidistributes rational points in quaternionic Heisenberg groups.

problem Counting and equidistribution of rational points in quaternionic Heisenberg groups.
method Arithmetic group actions on quaternionic hyperbolic spaces, Mertens counting formula, Neville equidistribution theorem.
result Proved Mertens counting formula and Neville equidistribution theorem for rational points over definite quaternion algebras.

We establish a connection between capillary floating in neutral equilibrium and the billiard ball problem. This allows us to reduce the question of floating in neutral equilibrium at any orientation with a prescribed contact angle for infinite homogeneous cylinders to a question about billiard caustics for their orthog…

2010-12-11abs ↗pdf ↗