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

Trend · papers per month

23466992 · Jun 202019922001200920172026
48 results for Exponential Exploding

Solves Multivariate-MAB problem with path planning and Thompson sampling.

problem Exponential exploding issue in multivariate Multi-Armed Bandit (Multivariate-MAB) problem.
method Path planning framework using decision graphs and Thompson sampling for heuristic arm selection.
result Achieves faster convergence speed, better efficient arm allocation, and lower cumulative regret.

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 ↗

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 ↗

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 ↗

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.

Developing active inference agents for edge devices with limited resources.

problem Creating effective active inference agents on edge devices with limited computational resources.
method Introducing a software toolbox to accelerate the development of active inference agents by non-experts.
result Accelerates the democratization of active inference agents for edge devices.

TSGO optimizes gradients in tensor networks to avoid vanishing/exploding issues.

problem Gradient vanishing and exploding problems in deep learning models.
method TSGO rotates parameters towards gradient direction in tangent space of normalized state.
result TSGO naturally determines learning rate based on angle between parameters and gradient.

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.

We prove here a general closed-form expansion formula for forward-start options and the forward implied volatility smile in a large class of models, including the Heston stochastic volatility and time-changed exponential Lévy models. This expansion applies to both small and large maturities and is based solely on the p…

2012-12-04abs ↗pdf ↗

Signature volatility models are analyzed for existence, arbitrage, completeness, and hedging-error decomposition.

problem Existence, arbitrage, completeness, and hedging-error decomposition of signature volatility models.
method Global existence and uniqueness of strong solutions, asset-pricing, market completeness, and hedging-error decomposition derived through structural results.
result Signature volatility models are structurally sound with existence, arbitrage, completeness, and hedging-error decomposition.

We introduce and show the existence of a Hawkes self-exciting point process with exponentially-decreasing kernel and where parameters are time-varying. The quantity of interest is defined as the integrated parameter T10TθtdtT^{-1}\int_0^Tθ_t^*dt, where θtθ_t^* is the time-varying parameter, and we consider the high-frequency…

2016-07-20abs ↗pdf ↗

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 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 ↗

A major challenge in the training of recurrent neural networks is the so-called vanishing or exploding gradient problem. The use of a norm-preserving transition operator can address this issue, but parametrization is challenging. In this work we focus on unitary operators and describe a parametrization using the Lie al…

2016-07-17abs ↗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.

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 ↗

Vanishing nodes cause hidden nodes to behave similarly, complicating deep neural network training.

problem Complicating deep neural network training due to hidden nodes behaving similarly.
method Introduced vanishing node indicator (VNI) to quantify node redundancy and correlated behavior.
result The effective number of nodes vanishes to one as VNI increases, indicating a challenging training scenario.

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.

Hamiltonian RNN controls hidden states gradient for long-term dependencies.

problem Challenges in learning long-term dependencies in RNNs.
method Symplectic discretization of Hamiltonian system to control gradient.
result Hamiltonian RNN outperforms other RNNs without hyperparameter optimization.

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 ↗