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

Trend · papers per month

336698131 · May 202619922001200920172026
48 results for floating surfaces

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 ↗

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 ↗

Study spherical convex bodies using LpL_p-floating areas and curvature entropy.

problem Analogous isoperimetric inequalities for spherical convex bodies.
method Introduced LpL_p-floating areas and curvature entropy for spherical convex bodies.
result Established isoperimetric inequalities and dual isoperimetric inequalities.

New surface area measures defined for ball-convex bodies, leading to entropy and inequalities.

problem Defining and analyzing surface area measures for ball-convex bodies.
method Introducing LpL_p relative surface areas, proving invariance and inequalities, and using geometric interpretations.
result Established inequalities and a new notion of entropy for ball-convex bodies.

Floating geodesic planes in Hitchin manifolds have fractal closures with non-integer dimensions.

problem Rigidity of geodesic planes in Hitchin manifolds.
method Constructing a specific surface group and analyzing its action on the Hitchin manifold.
result Existence of floating geodesic planes in Hitchin manifolds with fractal closures.

Study on curvature measures in non-Euclidean spaces linked to Euclidean geometry.

problem Investigating curvature measures in spherical, hyperbolic, and de Sitter spaces.
method Establishing a unifying framework for curvature measures in real-analytic spaces of constant curvature.
result Floating bodies and duality in non-Euclidean spaces are connected to curvature measures in Euclidean space.

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 ↗

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 ↗

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 ↗

Paper examines floating exercise boundaries for American options in time-inhomogeneous models.

problem Floating exercise boundaries in time-inhomogeneous models with negative interest rates or yields.
method Semi-analytical approach for pricing American options.
result Specialized pricing methodologies are required for models with floating exercise boundaries.

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.

New illumination bodies defined for ball-convex shapes, proving convexity and establishing surface area measures.

problem Characterizing properties of ball-convex shapes.
method Introducing illumination bodies and weighted illumination bodies, proving convexity, and establishing surface area measures.
result Illumination bodies are convex and provide surface area measures for ball-convex shapes.

We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and combinatorial structure. Our results are applied in spherical and hyperbolic space. This…

2018-05-29abs ↗pdf ↗

Commissioned by MIT's in-house artist Jane Philbrick, we evolve an abstract 2D surface (resembling Marta Pan's 1961 "Sculpture Flottante I") under mean curvature, all the while calculating the eigenmodes and eigenvalues of the Laplace-Beltrami operator on the resulting shapes. These are then synthesized into a sound-wa…

2012-01-23abs ↗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 ↗

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 ↗

Geometric mechanics approach to constrained and floating multibody systems using Hamel's equations.

problem Analytical mechanics of constrained and floating multibody systems.
method Geometric approach using bundle structures and connections, with Hamel's equations as a universal non-holonomic formulation.
result Achieved intrinsic splitting and inertial decoupling of reduced Euler-Lagrange equations.

Proposes standards for evaluating online machine learning methods in evolving data streams.

problem Difficulty in evaluating online machine learning methods under realistic conditions.
method Proposes comprehensive evaluation standards, performance measures, and evaluation strategies.
result Provides a new Python framework (float) for modular integration of libraries and custom code.

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.

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 ↗

This paper presents the first comprehensive empirical study demonstrating the efficacy of the Brain Floating Point (BFLOAT16) half-precision format for Deep Learning training across image classification, speech recognition, language modeling, generative networks and industrial recommendation systems. BFLOAT16 is attrac…

2019-05-29abs ↗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 ↗

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.

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.

Floating Content (FC) is a communication paradigm for the local dissemination of contextualized information through D2D connectivity, in a way which minimizes the use of resources while achieving some specified performance target. Existing approaches to FC dimensioning are based on unrealistic system assumptions that m…

2018-10-24abs ↗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 ↗

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 ↗

We propose K-TanH, a novel, highly accurate, hardware efficient approximation of popular activation function TanH for Deep Learning. K-TanH consists of parameterized low-precision integer operations, such as, shift and add/subtract (no floating point operation needed) where parameters are stored in very small look-up t…

2019-09-17abs ↗pdf ↗