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

95190284379 · Jun 202019922001200920172026
48 results for vanishing relative error

The paper provides theoretical guarantees for optimized sampling in compressed sensing, showing error vanishes with more measurements.

problem Theoretical and practical improvements in compressed sensing with optimized sampling schemes.
method Theoretical analysis and empirical experiments with optimized sampling schemes for subsampled unitary matrices.
result The error caused by measurement noise vanishes with an increasing number of measurements for optimized sampling schemes, assuming Gaussian noise.

Develops a method to estimate rare-event probabilities under distributional uncertainty.

problem Distributional uncertainty limits the effectiveness of rare-event simulation techniques.
method Wasserstein distributionally robust rare-event simulation (DRIS) framework.
result DRIS achieves vanishing relative error in estimating rare-event probabilities.

SS-GEN simulates rare events in heavy and light-tailed data.

problem Estimating probabilities of extreme events in multivariate data.
method Self-Similar Generative Estimation (SS-GEN) decomposes tail distribution into radial and angular components.
result SS-GEN generates representative extreme scenarios and estimates rare-event probabilities beyond observed data.

We define a relative entropy for two expanding solutions to mean curvature flow of hypersurfaces, asymptotic to the same cone at infinity. Adapting work of White and using recent results of Bernstein and Bernstein-Wang, we show that expanders with vanishing relative entropy are unique in a generic sense. This also impl…

2018-12-20abs ↗pdf ↗

Study the properties of SGD in non-vanishing learning rate regime.

problem Understanding the noise and fluctuation in SGD with finite learning rates.
method Derive exact solvable results for discrete-time SGD in quadratic loss functions.
result Fluctuation caused by discrete-time dynamics is larger than continuous-time theory predicts.

Local vanishing theorems for complex spaces with smooth boundaries.

problem Vanishing of cohomology groups for complex spaces with smooth boundaries.
method Local vanishing theorem for Dolbeault cohomology groups.
result Vanishing of L2L^2 and L2,locL^{2,\mathrm{loc}} Dolbeault cohomology groups for q>0q>0.

Let M be a smooth 4-manifold which admits a relatively minimal hyperelliptic genus h Lefschetz fibration over the 2-sphere. If all of the vanishing cycles for this fibration are nonseparating curves, then we show that M is a 2-fold cover of a 2-sphere bundle over the 2-sphere, branched over an embedded surface. If the …

1998-11-15abs ↗pdf ↗

A new framework evaluates HTE estimators using relative error.

problem Lack of robust evaluation methods for HTE estimators.
method Proposes a relative error-based evaluation framework and neural network architecture to estimate nuisance parameters and robustly compare HTE estimators.
result Demonstrates reliable comparisons and improved HTE estimation through the proposed framework and learning algorithm.

In the differential geometry of certain F-structures, the role of W-curvature tensor is very well known. A detailed study of this tensor has been made on the spacetime of general relativity. The spacetimes satisfying Einstein field equations with vanishing W-tensor have been considered and the existence of Killing and …

2015-05-03abs ↗pdf ↗

We consider relative normalizations of ruled surfaces with non-vanishing Gaussian curvature KK in the Euclidean space R3\mathbb{R} ^{3}, which are characterized by the support functions (α)q=Kα^{\left( α\right) }q=\left \vert K\right \vert ^α for αRα\in \mathbb{R} (Manhart's relative normalizations). All ruled surfaces for…

2015-10-30abs ↗pdf ↗

We consider the Laplace normal vector field of relatively normalized ruled surfaces with non-vanishing Gaussian curvature in the three-dimensional Euclidean space R3\mathbb{R}^{3}. We determine all ruled surfaces and all relative normalizations for which the Laplace normal image degenerates into a point or into a curve…

2015-10-28abs ↗pdf ↗

In regression settings where explanatory variables have very low correlations and there are relatively few effects, each of large magnitude, we expect the Lasso to find the important variables with few errors, if any. This paper shows that in a regime of linear sparsity---meaning that the fraction of variables with a n…

2015-11-05abs ↗pdf ↗

In this paper, we discuss the relative KK-stability and the modified KK-energy associated to the Calabi's extremal metric on toric manifolds. We give a sufficient condition in the sense of convex polytopes associated to toric manifolds for both the relative KK-stability and the properness of modified KK-energy. In …

2006-03-09abs ↗pdf ↗

MGDL refines deep neural networks by training grades sequentially, improving stability.

problem Training deep neural networks is challenging due to nonconvex optimization landscapes.
method MGDL trains deep networks grade by grade, freezing previously learned grades and training new ones to fit residuals.
result MGDL guarantees vanishing error in a fixed-width multigrade ReLU architecture.

Paper establishes bounds for RNN-TPPs, showing four-layer networks can achieve vanishing errors.

problem Understanding theoretical limits of RNN-TPPs.
method Characterized RNN complexity, constructed neural approximations, applied truncation technique.
result Four-layer RNN-TPPs can achieve vanishing generalization errors.

Study shows how leveraging hierarchical similarity graphs improves matrix completion in recommender systems.

problem Improving matrix completion in recommender systems using hierarchical similarity graphs.
method Characterizes the optimal sample complexity using hierarchical stochastic block models and low-rank rating matrices.
result Exploiting hierarchical structure of social graphs significantly reduces the number of observed entries needed for accurate matrix completion.

In this paper we prove a strengthening of a theorem of Chang, Weinberger and Yu on obstructions to the existence of positive scalar curvature metrics on compact manifolds with boundary. They construct a relative index for the Dirac operator, which lives in a relative K-theory group, measuring the difference between the…

2018-11-20abs ↗pdf ↗

Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing ideals plays a critical role. However, such an approximation also gives rise to a…

2019-01-25abs ↗pdf ↗

We show that any degree at least gg polynomial in descendant or tautological classes vanishes on Mg,nM_{g,n} when g2g\ge 2. This generalizes a result of Looijenga and proves a version of Getzler's conjecture. The method we use is the study of the relative Gromov-Witten invariants of P1P^1 relative 2 points combined with…

1999-08-13abs ↗pdf ↗

In this work we study Berwald spacetimes and their vacuum dynamics, where the latter are based on a Finsler generalization of the Einstein's equations derived from an action on the unit tangent bundle. In particular, we consider a specific class of spacetimes which are non-flat generalizations of the very special relat…

2018-04-25abs ↗pdf ↗

Vanishing gradients hinder reinforcement finetuning of language models.

problem Vanishing gradients impede the optimization of language models using reinforcement finetuning.
method The study identifies vanishing gradients as a fundamental optimization obstacle in reinforcement finetuning and proposes an initial supervised finetuning phase to mitigate this issue.
result An initial supervised finetuning phase is crucial for successful reinforcement finetuning of language models, as it helps prevent vanishing gradients and maximizes rewards.

We apply the Cartan equivalence method to the study of real analytic second order ODEs under the local real analytic diffeomorphism of $\C^2$ which are area-preserving. This enables us to give a characterization of the second order ODEs which are equivalent to y=0y^{\prime\prime}=0 under such transformations. Moreover w…

2012-10-10abs ↗pdf ↗

This work tightens generalization error bounds using Wasserstein distance.

problem Improving expected generalization error bounds in machine learning.
method Introduces bounds based on Wasserstein distance for various settings.
result New, tighter bounds based on relative entropy and other information measures.

This work bounds the generalization error of private algorithms for discrete data.

problem Bounding the generalization error of private algorithms for discrete data.
method Information-theoretic approach using relative entropy and the method of types.
result Explicit upper bounds on the generalization error of stable private algorithms for discrete data.

New approach uses Gaussian processes to learn and track complex systems with guaranteed accuracy.

problem Inaccurate first principle models for complex systems due to data complexity.
method Bayesian prediction error bound for Gaussian process regression, derived from kernel-based data density.
result Achieves vanishing tracking error with increasing data density, providing time-varying accuracy guarantees.

Study on symmetric operators on non-compact manifolds, focusing on their index modulo 2.

problem Investigating elliptic operators with a specific symmetry and their index modulo 2.
method Analysis of Callias-type operators on non-compact manifolds, establishing mod 2 versions of index theorems.
result Established mod 2 versions of the Gromov-Lawson relative index theorem, Callias index theorem, and Boutet de Monvel's index theorem for Toeplitz operators.

Relative Thom polynomials for maps around boundaries established.

problem Understanding singularities in maps around boundaries.
method Introducing and analyzing Thom polynomials relative to prescribed maps around boundaries, establishing structure theorems and correction terms.
result Unified framework for invariants of immersions and singularities of their extensions.

We conduct mathematical analysis on the effect of batch normalization (BN) on gradient backpropogation in residual network training, which is believed to play a critical role in addressing the gradient vanishing/explosion problem, in this work. By analyzing the mean and variance behavior of the input and the gradient i…

2018-12-02abs ↗pdf ↗

In this paper, we investigate analytical and geometric properties of certain non-compact boundary-manifolds, namely manifolds of bounded geometry. One result are strong Bochner type vanishing results for the L^2-cohomology of these manifolds: if e.g. a manifold admits a metric of bounded geometry which outside a compac…

1998-10-17abs ↗pdf ↗