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

3467101134 · May 202619922001200920172026
48 results for exploding variance

A new method reduces variance in training early-stage rankers for large-scale search systems.

problem Training early-stage rankers for large-scale search systems is challenging due to exploding variance in policy gradient methods.
method Proposes credit-assigned policy gradient (CA-PG) to mitigate variance in training early-stage rankers.
result CA-PG significantly reduces variance in training early-stage rankers compared to vanilla policy gradient.

This paper extends de Rham theory of smooth manifolds to exploded manifolds. Included are versions of Stokes' theorem, De Rham cohomology, Poincare duality, and integration along the fiber. The resulting cohomology theory is used to define Gromov Witten invariants of exploded manifolds in a separate paper.

2010-03-09abs ↗pdf ↗

A new gradient estimator reduces variance near boundaries for binary latent variables.

problem Explosive gradient variance near boundaries in binary latent variable models.
method Introduces a new gradient estimator (bitflip-1) and an aggregated estimator (UGC) that uses either bitflip-1 or DisARM for each coordinate.
result UGC has uniformly lower variance than DisARM and achieves optimal optimization objectives.

We consider the off-policy estimation problem of estimating the expected reward of a target policy using samples collected by a different behavior policy. Importance sampling (IS) has been a key technique to derive (nearly) unbiased estimators, but is known to suffer from an excessively high variance in long-horizon pr…

2018-10-29abs ↗pdf ↗

Classical (Itô diffusions) stochastic volatility models are not able to capture the steepness of small-maturity implied volatility smiles. Jumps, in particular exponential Lévy and affine models, which exhibit small-maturity exploding smiles, have historically been proposed to remedy this (see \cite{Tank} for an overvi…

2015-03-27abs ↗pdf ↗

We present a gluing formula for Gromov-Witten invariants in the case of a triple product. This gluing formula is a simple case of a much more general gluing formula proved and stated using exploded manifolds. We present this simple case because it is relatively easy to explain without any knowledge of exploded manifold…

2015-11-03abs ↗pdf ↗

We identify and study two common failure modes for early training in deep ReLU nets. For each we give a rigorous proof of when it occurs and how to avoid it, for fully connected and residual architectures. The first failure mode, exploding/vanishing mean activation length, can be avoided by initializing weights from a …

2018-03-05abs ↗pdf ↗

This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.

problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.

Derives a new formula for optimal stopping problems with exploding derivatives.

problem Optimal stopping problems with complex boundary conditions.
method Develops a change of variable formula for functions with exploding derivatives near a surface.
result Derives a formula similar to Itô's but with less restrictive conditions.

In this paper we investigate the asymptotics of forward-start options and the forward implied volatility smile in the Heston model as the maturity approaches zero. We prove that the forward smile for out-of-the-money options explodes and compute a closed-form high-order expansion detailing the rate of the explosion. Fu…

2013-03-18abs ↗pdf ↗

Linear RNNs exhibit a bias towards shorter memory due to initialization variance.

problem Understanding the performance limitations of RNNs, especially linear ones.
method Kernel regime analysis to show equivalence to 1D-convolutional networks and analyze weightings.
result Linear RNNs with random initialization have a bias towards shorter memory periods.

Deep Learning has revolutionized vision via convolutional neural networks (CNNs) and natural language processing via recurrent neural networks (RNNs). However, success stories of Deep Learning with standard feed-forward neural networks (FNNs) are rare. FNNs that perform well are typically shallow and, therefore cannot …

2017-06-08abs ↗pdf ↗

Enhances learning of structured distributions using nonlinear denoising score matching.

problem Learning structured distributions from noisy data.
method Latent Nonlinear Denoising Score Matching (LNDSM) integrating nonlinear dynamics with VAE-based latent score matching.
result LNDSM achieves superior sample quality and variability compared to structure-agnostic methods.

Improved optimization technique reduces training complexity for non-convex problems.

problem Training non-convex optimization problems with exploding gradients.
method Employed variance reduction technique (SPIDER) with carefully designed learning rate.
result Improved stochastic gradient complexity to O(ε3)O(ε^{-3}) for εε-stationary solutions.

The study provides a comprehensive error analysis for diffusion models.

problem Understanding the accuracy and design of diffusion-based generative models.
method Conducts a non-asymptotic convergence analysis and sampling error analysis for diffusion models.
result Theoretical insights into designing effective training and sampling processes for diffusion models.

We define Gromov--Witten invariants of exploded manifolds. The technical heart of this paper is a construction of a virtual fundamental class [K][\mathcal K] of any Kuranishi category K\mathcal K (which is a simplified, more general version of an embedded Kuranishi structure.) We also show how to integrate differential…

2015-12-17abs ↗pdf ↗

We propose a novel approach to addressing the vanishing (or exploding) gradient problem in deep neural networks. We construct a new architecture for deep neural networks where all layers (except the output layer) of the network are a combination of rotation, permutation, diagonal, and activation sublayers which are all…

2019-11-21abs ↗pdf ↗

Maxout networks study gradients and propose initialization strategies.

problem Complexity in input-output Jacobian distribution complicates stable parameter initialization.
method Obtained bounds on moments of gradients and formulated initialization strategies.
result Parameter initialization strategies improve training of deep maxout networks.

Previously, the exploding gradient problem has been explained to be central in deep learning and model-based reinforcement learning, because it causes numerical issues and instability in optimization. Our experiments in model-based reinforcement learning imply that the problem is not just a numerical issue, but it may …

2019-02-04abs ↗pdf ↗

A new RNN model tackles long-time dependencies with fast, invertible, and memory-efficient hidden states.

problem Challenges in processing sequential inputs with long-time dependencies in RNNs.
method A novel RNN architecture based on a Hamiltonian system of oscillators.
result The proposed RNN mitigates exploding and vanishing gradient problems, providing state-of-the-art performance.

In \cite{FOinteger}, Fukaya and Ono outlined a way of counting pseudo-holomorphic curves in a general compact symplectic manifold to obtain integer valued invariants. This paper contains the details of Fukaya and Ono's suggested construction for any compact symplectic manifold and a large class of exploded manifolds.

2013-09-03abs ↗pdf ↗

The paper examines when NTK theory applies to real finite-width neural networks.

problem Understanding when NTK theory accurately predicts the behavior of finite-width neural networks.
method Empirical study of fully-connected ReLU and sigmoid DNNs with various hyperparameters and depths.
result NTK theory does not always apply to sufficiently deep networks with exploding gradients, and the kernel changes significantly during training.

We prove two tropical gluing formulae for Gromov-Witten invariants of exploded manifolds, useful for calculating Gromov-Witten invariants of a symplectic manifold using a normal-crossing degeneration. The first formula generalizes the symplectic-sum formula for Gromov-Witten invariants. The second formula is stronger, …

2017-03-16abs ↗pdf ↗

New RNN model handles long-term dependencies in irregularly-sampled time series.

problem Handling long-term dependencies in irregularly-sampled time series data.
method Designing ODE-LSTMs that separate memory from continuous-time state.
result ODE-LSTMs outperform other RNN-based models on non-uniformly sampled data with long-term dependencies.

Recurrent Neural Networks (RNN), Long Short-Term Memory Networks (LSTM), and Memory Networks which contain memory are popularly used to learn patterns in sequential data. Sequential data has long sequences that hold relationships. RNN can handle long sequences but suffers from the vanishing and exploding gradient probl…

2019-04-18abs ↗pdf ↗

New method improves DAG learning by using large coefficients for higher-order terms.

problem Recovering DAG structures from observational data is challenging due to combinatorial optimization.
method Proposes truncated matrix power iteration to approximate DAG constraints efficiently.
result Empirically outperforms previous methods by a factor of 3 or more in structural Hamming distance.

Conformally invariant functionals on the space of knots are introduced via extrinsic conformal geometry of the knot and integral geometry on the space of spheres. Our functionals are expressed in terms of a complex-valued 2-form which can be considered as the cross-ratio of a pair of infinitesimal segments of the knot.…

2004-09-21abs ↗pdf ↗

Residual Network (ResNet) is the state-of-the-art architecture that realizes successful training of really deep neural network. It is also known that good weight initialization of neural network avoids problem of vanishing/exploding gradients. In this paper, simplified models of ResNets are analyzed. We argue that good…

2017-09-09abs ↗pdf ↗