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

Trend · papers per month

12.5%25.0%37.5%50.0% · Jan 199419922001200920172026
48 results for precision 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 ↗

Low-precision training reduces computational cost and produces efficient models. Recent research in developing new low-precision training algorithms often relies on simulation to empirically evaluate the statistical effects of quantization while avoiding the substantial overhead of building specific hardware. To suppor…

2019-10-09abs ↗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.

The paper addresses numerical integration issues in SV models, proposing a fast regime switching algorithm.

problem Numerical integration challenges in SV models, especially with high precision and low computational time.
method Proposes a fast regime switching algorithm to determine when higher precision arithmetic is needed.
result Shows that numerical quadratures need to be carefully chosen based on model parameters and parameter values.

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 ↗

Löbell polyhedra have small systoles and are quasi-arithmetic.

problem Finding compact hyperbolic polyhedra with small systoles.
method Elementary and conceptual means to observe systole behavior, number theoretic invariants to refine results.
result Löbell polyhedra give examples of closed hyperbolic 3-manifolds with arbitrarily small systole and are quasi-arithmetic.

It is a longstanding problem to determine the precise relationship between the geodesic length spectrum of a hyperbolic manifold and its commensurability class. A well known result of Reid, for instance, shows that the geodesic length spectrum of an arithmetic hyperbolic surface determines the surface's commensurabilit…

2017-02-26abs ↗pdf ↗

The study identifies flat manifolds with unique cusp cross-sections in arithmetic hyperbolic manifolds.

problem Characterizing flat manifolds that have unique cusp cross-sections in arithmetic hyperbolic manifolds.
method Algebraic characterization of cusp cross-sections in arithmetic hyperbolic manifolds.
result Construction of flat manifolds with unique cusp cross-sections and proof of their existence in all dimensions n32n \geq 32.

We formulate a conjecture that arithmetic locally symmetric manifolds have simple homotopy type, and prove it for the non-compact case. More precisely, we show that, for any symmetric space S of non-compact type without Euclidean de Rham factors, there are constants a=a(S) and d=d(S) such that any non-compact arithmeti…

2001-11-26abs ↗pdf ↗

The purpose of the paper is to introduce some conjectures regarding the analytic continuation and the arithmetic properties of quantum invariants of knotted objects. More precisely, we package the perturbative and nonperturbative invariants of knots and 3-manifolds into two power series of type P and NP, convergent in …

2007-11-12abs ↗pdf ↗

A new deep learning method using Boolean logic reduces training and inference energy.

problem High computational and energy costs in deep learning training and inference.
method Introduces Boolean weights and inputs for efficient training using Boolean logic.
result Achieves full-precision accuracy in ImageNet classification and surpasses state-of-the-art results in semantic segmentation.

In this article we verify an orbifold version of a conjecture of Nimershiem from 1998. Namely, for every flat nn-manifold MM, we show that the set of similarity classes of flat metrics on MM which occur as a cusp cross-section of a hyperbolic (n+1)(n+1)-orbifold is dense in the space of similarity classes of flat metri…

2006-06-20abs ↗pdf ↗

Our main result is that for all sufficiently large x0>0x_0>0, the set of commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds with fixed invariant trace field kk and systole bounded below by x0x_0 has density one within the set of all commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds wit…

2015-04-20abs ↗pdf ↗

Constructs hyperbolic reflection groups with 3D limit sets.

problem Existence of convex cocompact groups with specific limit sets.
method Inputting a simplicial complex into a construction process yields a hyperbolic reflection group.
result Answers Kapovich's question affirmatively by creating a thin subgroup of an arithmetic lattice.

The study analyzes numerical stability in large language models using mixed-precision arithmetic.

problem Numerical stability of large language models using low-precision arithmetic.
method Developed a mixed-precision analysis of transformer inference, deriving bounds for condition numbers and forward error.
result Established that numerical stability is determined by the interplay between weight magnitude and the growth of the residual stream.

Researchers calculate cohomological dimensions of manifold configuration spaces, proving arithmeticity and providing bounds.

problem Calculating the cohomological dimensions of configuration spaces of manifolds.
method Defined a reduced Chevalley Eilenberg complex and provided precise formulas and bounds.
result Arithmeticity of cohomological dimensions in configuration spaces of manifolds with non-trivial co-dimension one cohomology groups.

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 ↗

The reduced norm-one group G of a central simple algebra is an inner form of the special linear group, and an involution on the algebra induces an automorphism of G. We study the action of such automorphisms in the cohomology of arithmetic subgroups of G. The main result is a precise formula for Lefschetz numbers of au…

2013-02-05abs ↗pdf ↗

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.

New meta-learning method improves domain generalization by balancing parameters closer to domain centroids.

problem Improving domain generalization by reducing overfitting to specific domains.
method Arithmetic meta-learning with arithmetic-weighted gradients to balance parameters closer to domain centroids.
result Experimental validation of improved domain generalization performance.

Currently, deep neural networks are deployed on low-power portable devices by first training a full-precision model using powerful hardware, and then deriving a corresponding low-precision model for efficient inference on such systems. However, training models directly with coarsely quantized weights is a key step towa…

2017-06-07abs ↗pdf ↗

CoT enhances transformer accuracy on serial tasks by enabling serial computation.

problem Improving accuracy of large language models on inherently serial problems.
method Integrating a chain of thought (CoT) into decoder-only transformers to enable serial computation.
result Constant-depth transformers with CoT can solve problems in AC^0, surpassing TC^0 without CoT.

In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…

2014-01-29abs ↗pdf ↗

In this paper a new intrinsic geometric characterization of the symmetric square of a curve and of the ordinary product of two curves is given. More precisely it is shown that the existence on a surface of general type S of irregularity q of an effective divisor D having self-intersection D^2>0 and arithmetic genus q i…

2010-08-10abs ↗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 ↗

Develops arithmetic PDE geometry concepts like curvature and cohomology.

problem Creating a geometry framework for arithmetic PDEs.
method Introducing arithmetic analogues of Levi-Civita and Chern connections, then developing curvature and characteristic classes.
result Arithmetic analogues of curvature and characteristic classes have been developed.

New geometric invariant limits the number of semi-arithmetic groups.

problem Understanding the structure of semi-arithmetic Fuchsian groups.
method Introducing a new geometric invariant called stretch and using the arithmetic Margulis lemma.
result There exist only finitely many conjugacy classes of semi-arithmetic groups with bounded arithmetic dimension, stretch, and coarea.

Stochastic gradient descent (SGD) is a ubiquitous algorithm for a variety of machine learning problems. Researchers and industry have developed several techniques to optimize SGD's runtime performance, including asynchronous execution and reduced precision. Our main result is a martingale-based analysis that enables us…

2015-06-22abs ↗pdf ↗

Arithmetic Dijkgraaf-Witten theory constructs analogues in Chern-Simons TQFT.

problem Developing arithmetic analogues in Chern-Simons TQFT.
method Constructing arithmetic analogues of Chern-Simons 1-cocycle, prequantization bundle, and Chern-Simons functional.
result Decomposition and gluing formulas for arithmetic Chern-Simons invariants and arithmetic Dijkgraaf-Witten partition functions.

In this article, we prove that every arithmetic locally symmetric orbifold of classical type without Euclidean or compact factors has arbitrarily long arithmetic progressions in its primitive length spectrum. Moreover, we show the stronger property that every primitive length occurs in arbitrarily long arithmetic progr…

2016-02-04abs ↗pdf ↗

New method constructs non-arithmetic hyperbolic orbifolds from complex arithmetic ball quotients.

problem Creating non-arithmetic lattices in projective orthogonal groups.
method Using anti-holomorphic involutions on complex arithmetic ball quotients, gluing fixed loci along geodesic subspaces.
result Explicit calculation of the volume of constructed non-arithmetic orbifolds.

We show that the non-arithmetic lattices in PO(n,1) of Belolipetsky and Thomson (2011), obtained as fundamental groups of closed hyperbolic manifolds with short systole, are quasi-arithmetic in the sense of Vinberg, and, by contrast, the well-known non-arithmetic lattices of Gromov and Piatetski-Shapiro are not quasi-a…

2014-12-16abs ↗pdf ↗

The paper explores subspaces in hyperbolic lattices and their arithmetic properties.

problem Arithmeticity criterion for hyperbolic lattices and suborbifolds.
method Analysis of totally geodesic suborbifolds and Vinberg's commensurability invariants.
result Arithmeticity of hyperbolic orbifolds is linked to the existence of infinitely many fc-subspaces.

Define an arithmetic variety to be the quotient of a bounded symmetric domain by an arithmetic group. An arithmetic variety is algebraic, and the theorem in question states that when one applies an automorphism of the field of complex numbers to the coefficients of an arithmetic variety the resulting variety is again a…

2001-06-23abs ↗pdf ↗