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.
The paper identifies saddlepoints in unsupervised auto-encoding neural nets.
Proposes a new sampling policy for ranking and selection problems.
We discuss the use of saddlepoint methods in the analysis of portfolios, with particular reference to credit portfolios. The objective is to proceed from a model of the loss distribution, given through probabilities, correlations and the like, to an analytical approximation of the distribution. Once this is done we sho…
Study improves BN TTA under distribution shift using higher-order asymptotics.
Deep generative models can learn to generate realistic-looking images, but many of the most effective methods are adversarial and involve a saddlepoint optimization, which requires a careful balancing of training between a generator network and a critic network. Maximum mean discrepancy networks (MMD-nets) avoid this i…
In this paper we prove an approximate formula expressed in terms of elementary functions for the implied volatility in the Heston model. The formula consists of the constant and first order terms in the large maturity expansion of the implied volatility function. The proof is based on saddlepoint methods and classical …
The Lugannani-Rice formula is a saddlepoint approximation method for estimating the tail probability distribution function, which was originally studied for the sum of independent identically distributed random variables. Because of its tractability, the formula is now widely used in practical financial engineering as …
We propose a new Quantization algorithm for the approximation of inhomogeneous random walks, which are the key terms for the valuation of CDO-tranches in latent factor models. This approach is based on a dual quantization operator which posses an intrinsic stationarity and therefore automatically leads to a second orde…
Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.
Determinantal Point Processes (DPPs) are popular models for point processes with repulsion. They appear in numerous contexts, from physics to graph theory, and display appealing theoretical properties. On the more practical side of things, since DPPs tend to select sets of points that are some distance apart (repulsion…
Quantum field theory connects deep neural networks to criticality.