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

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for Numeric exploding

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.

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.

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 ↗

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 ↗

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.

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 ↗

The paper stabilizes invertible neural networks by using Gaussian mixture models.

problem Invertible neural networks can have exploding Lipschitz constants, leading to numerical errors.
method The authors use Gaussian mixture models to stabilize the latent distribution of invertible neural networks.
result Numerical simulations confirm that this modification improves sampling quality in multimodal applications.

Quasi-Gaussian HJM models are a popular approach for modeling the dynamics of the yield curve. This is due to their low dimensional Markovian representation, which greatly simplifies their numerical implementation. We present a qualitative study of the solutions of the quasi-Gaussian log-normal HJM model. Using a small…

2019-08-19abs ↗pdf ↗

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.

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.

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 study the explosion of the solutions of the SDE in the quasi-Gaussian HJM model with a CEV-type volatility. The quasi-Gaussian HJM models are a popular approach for modeling the dynamics of the yield curve. This is due to their low dimensional Markovian representation which simplifies their numerical implementation …

2019-08-19abs ↗pdf ↗

Convolutional neural network is an important model in deep learning. To avoid exploding/vanishing gradient problems and to improve the generalizability of a neural network, it is desirable to have a convolution operation that nearly preserves the norm, or to have the singular values of the transformation matrix corresp…

2019-06-12abs ↗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.

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 ↗

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 ↗

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.

Recurrent Neural Networks (RNNs) are powerful models that achieve exceptional performance on several pattern recognition problems. However, the training of RNNs is a computationally difficult task owing to the well-known "vanishing/exploding" gradient problem. Algorithms proposed for training RNNs either exploit no (or…

2015-11-04abs ↗pdf ↗

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 ↗

Sparked by Alòs, León, and Vives (2007); Fukasawa (2011, 2017); Gatheral, Jaisson, and Rosenbaum (2018), so-called rough stochastic volatility models such as the rough Bergomi model by Bayer, Friz, and Gatheral (2016) constitute the latest evolution in option price modeling. Unlike standard bivariate diffusion models s…

2018-10-08abs ↗pdf ↗

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 ↗

One of the difficulties of training deep neural networks is caused by improper scaling between layers. Scaling issues introduce exploding / gradient problems, and have typically been addressed by careful scale-preserving initialization. We investigate the value of preserving scale, or isometry, beyond the initial weigh…

2016-04-26abs ↗pdf ↗

Scaling ResNets requires careful consideration of the layer depth and output scaling factors.

problem Avoiding vanishing or exploding gradients in deep ResNets as depth increases.
method Probabilistic analysis and continuous-time limit interpretation of ResNets.
result The optimal scaling factor is αL=1Lα_L = \frac{1}{\sqrt{L}} for standard i.i.d. initializations.

AuON is a linear-time optimizer that improves upon Muon's performance without approximate orthogonal matrices.

problem High memory and computational costs of orthogonal momentum updates.
method AuON uses normalized nonlinear scaling and a 'emergency brake' to handle exploding attention logits.
result AuON achieves strong performance without approximate orthogonal matrices, preserving structural alignment and reconditioning.