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% · Dec 199319922001200920172026
48 results for Precision Reduction

Proposes rounding method for precise treatment effect estimation under budget constraints.

problem Resource-constrained experimental design for precise treatment effect estimation.
method Dependent randomized rounding procedure to convert assignment probabilities into binary treatment decisions.
result Improved estimator precision through variance reduction and efficient inference.

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 ↗

The high computational and parameter complexity of neural networks makes their training very slow and difficult to deploy on energy and storage-constrained computing systems. Many network complexity reduction techniques have been proposed including fixed-point implementation. However, a systematic approach for designin…

2018-12-31abs ↗pdf ↗

A mathematical model describes deforming manifolds with precise vectors and fields.

problem Modeling and describing the deformation of complex manifolds in practical applications.
method Proposes a modified differential dynamic model with constraints on spatial and temporal continuity, presenting deforming vector and field.
result Demonstrates the effectiveness of an autonomous deforming field in data dimension reduction tasks.

We study reduction of generalized complex structures. More precisely, we investigate the following question. Let JJ be a generalized complex structure on a manifold MM, which admits an action of a Lie group GG preserving JJ. Assume that M0M_0 is a GG-invariant smooth submanifold and the GG-action on M0M_0 is prop…

2005-09-18abs ↗pdf ↗

Develops precise expressions for random projections for better machine learning tasks.

problem Improving the accuracy of dimensionality reduction in machine learning tasks.
method Exploits recent developments in spectral analysis of random matrices to derive accurate expressions for random projection matrices.
result Provides precise expressions that reflect the practical performance of sketching methods, including Gaussian and Rademacher sketches.

Paper proposes a method to use in silico experiments with foundation models to reduce sample size.

problem Costly and uncertain randomized experiments.
method Integrates predictions from multiple foundation models with experimental data.
result Estimator offers substantial precision gains, equivalent to a 20% reduction in sample size.

We give a systematic treatment of the stability theory for action of a real reductive Lie group G on a topological space. More precisely, we introduce an abstract setting for actions of non-compact real reductive Lie groups on topological spaces that admit functions similar to the Kempf-Ness function. The point of this…

2016-10-17abs ↗pdf ↗

There is tremendous interest in precision medicine as a means to improve patient outcomes by tailoring treatment to individual characteristics. An individualized treatment rule formalizes precision medicine as a map from patient information to a recommended treatment. A treatment rule is defined to be optimal if it max…

2017-11-28abs ↗pdf ↗

The paper proves a new version of dimensional reduction in cohomological Donaldson-Thomas theory.

problem Proving a new version of dimensional reduction in cohomological Donaldson-Thomas theory.
method Using cohomological Donaldson-Thomas theory and loop stacks of 0-shifted symplectic stacks.
result Shows the BPS cohomology of loop stacks admits a description analogous to orbifold cohomology.

Paper interprets UMAP and t-SNE as probabilistic MAP inference.

problem Understanding and interpreting UMAP and t-SNE.
method Interprets UMAP and t-SNE as MAP inference methods corresponding to a probabilistic model of the graph Laplacian.
result Shows UMAP and t-SNE can be understood as probabilistic inference methods.

We study finite dimensional almost and quasi-effective prolongations of nilpotent Z-graded Lie algebras, especially focusing on those having a decomposable reductive structural subalgebra. Our assumptions generalize effectiveness and algebraicity and are appropriate to obtain Levi-Malčev and Levi-Chevalley decompositio…

2019-10-16abs ↗pdf ↗

EMPIR combines low and full precision DNNs to enhance robustness against adversarial attacks.

problem Vulnerability of DNNs to adversarial attacks that misclassify inputs with small perturbations.
method Ensemble of quantized DNN models with different numerical precisions.
result EMPIR ensembles increase adversarial robustness by 42.6% on average across different tasks.

We study the accuracy of estimating the covariance and the precision matrix of a DD-variate sub-Gaussian distribution along a prescribed subspace or direction using the finite sample covariance. Our results show that the estimation accuracy depends almost exclusively on the components of the distribution that correspo…

2019-09-26abs ↗pdf ↗

In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a cyclic sliding (which is a particular kind of conjugation) affects the normal f…

2010-06-11abs ↗pdf ↗

There exist three main approaches to reduction associated to canonical Lie group actions on a symplectic manifold, namely, foliation reduction, introduced by Cartan, Marsden-Weinstein reduction, and optimal reduction, introduced by the authors. When the action is free, proper, and admits a momentum map these three appr…

2005-01-07abs ↗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.

Improved EXACT strategy reduces GNN memory consumption and runtime.

problem Efficiently training large-scale GNNs with reduced memory usage.
method Block-wise quantization of intermediate activation maps with improved variance minimization.
result Further reduction in memory consumption (>15%) and runtime speedup (5%) with similar performance trade-offs.

We study the regular conditional law of mixed Gaussian Volterra processes under the influence of model disturbances. More precisely, we study prediction of Gaussian Volterra processes driven by a Brownian motion in a case where the Brownian motion is not observable, but only a noisy version is observed. As an applicati…

2019-04-22abs ↗pdf ↗

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 ↗

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 ↗

We present a theoretical analysis and empirical evaluations of a novel set of techniques for computational cost reduction of classifiers that are based on learned transform and soft-threshold. By modifying optimization procedures for dictionary and classifier training, as well as the resulting dictionary entries, our t…

2015-04-26abs ↗pdf ↗

Paper speeds up GP inference by reducing precision matrix computation.

problem High computational complexity in computing kernel precision matrices.
method Splitting precision matrix into Hankel-Toeplitz matrices and computing only unique entries.
result Precision matrix computation reduced from O(NM2)\mathcal{O}(NM^2) to O(NM)\mathcal{O}(NM).

Paper reduces hyperparameters in mixed-categorical Gaussian processes for green aircraft optimization.

problem High-dimensional mixed-categorical Gaussian processes with many hyperparameters.
method Innovative dimension reduction algorithm using partial least squares regression.
result Significant reduction in fuel consumption (439 kg) for a green aircraft.

Rollings of reductive homogeneous spaces are studied using intrinsic curves.

problem Investigate rollings of reductive homogeneous spaces without slip and twist.
method An intrinsic point of view, considering rollings as curves in the configuration space QQ tangent to a certain distribution.
result Explicit solutions for rollings of m\mathfrak{m} over G/HG / H are obtained for specific cases.

We consider the problem of high-dimensional classification between the two groups with unequal covariance matrices. Rather than estimating the full quadratic discriminant rule, we propose to perform simultaneous variable selection and linear dimension reduction on original data, with the subsequent application of quadr…

2017-11-13abs ↗pdf ↗

RMFGP combines multi-fidelity models for efficient uncertainty quantification.

problem Efficiently infer quantities of interest with limited high-fidelity data.
method Rotated multi-fidelity Gaussian process with dimension reduction and Bayesian active learning.
result RMFGP model improves accuracy and efficiency in high-dimensional problems.

Adaptive Prespecification improves precision in randomized trials.

problem Selecting optimal covariates for precision in randomized trials.
method Adaptive Prespecification using V-fold cross-validation and influence curve-squared loss function.
result Substantial gains in precision, equivalent to 20-43% reductions in sample size for the same power.

The paper develops stability criteria for real reductive Lie groups acting on manifolds.

problem Analyzing stability of real reductive Lie group actions on manifolds.
method Introduced a gradient map and maximal weight function to characterize stability conditions.
result Characterized stability, semistability, and polystability using numerical criteria.

Let (X,T1,0X)(X, T^{1,0}X) be a compact connected orientable CR manifold of dimension 2n+12n+1 with non-degenerate Levi curvature. Assume that XX admits a connected compact Lie group action GG. Under certain natural assumptions about the group action GG, we show that the GG-invariant Szegö kernel for (0,q)(0,q) forms is a comp…

2017-02-16abs ↗pdf ↗

Given any representation V of a complex linear reductive Lie group G_0, we show that a larger semi-simple Lie group G with g=g_0 + V + V* + ..., exists precisely when V has a finite number of G_0-orbits. In particular, V admits an open G_0-orbit. Furthermore, this corresponds to an augmentation of the Dynkin diagram of…

2008-12-05abs ↗pdf ↗

This paper investigates the use of multiple directions of stratification as a variance reduction technique for Monte Carlo simulations of path-dependent options driven by Gaussian vectors. The precision of the method depends on the choice of the directions of stratification and the allocation rule within each strata. S…

2010-04-28abs ↗pdf ↗

ReduNet optimizes data compression by maximizing rate reduction in deep networks.

problem Optimizing deep networks for high-dimensional multi-class data.
method Maximizing rate reduction through iterative gradient ascent, leading to a multi-layer deep network.
result ReduNet achieves optimal linear discriminative representation and is more efficient in the spectral domain.

New method reduces deep learning training costs by approximating vector-jacobian products.

problem Efficiently training deep neural networks with reduced computational and memory costs.
method Randomized, unbiased approximations of vector-jacobian products during backpropagation.
result Validated potential for reducing deep learning training costs through unbiased estimates.

The universal sl_2 invariant of string links has a universality property for the colored Jones polynomial of links, and takes values in the h-adic completed tensor powers of the quantized enveloping algebra of sl_2. In this paper, we exhibit explicit relationships between the universal sl_2 invariant and Milnor invaria…

2014-05-13abs ↗pdf ↗

In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…

2018-09-28abs ↗pdf ↗