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

Trend · papers per month

110220329439 · Jun 202019922001200920172026
48 results for Dynamic Initial Margin

Paper uses Chebyshev Tensors for accurate dynamic sensitivities and ISDA SIMM computation.

problem Computing dynamic sensitivities and initial margin for financial instruments.
method Uses Chebyshev Tensors in Monte Carlo simulations to compute dynamic sensitivities and ISDA SIMM.
result High accuracy and computational gains for FX swaps and Spread Options.

This work reduces DIM computation costs by training neural networks on single MC paths.

problem Training neural networks for Dynamic Initial Margin (DIM) computation in counterparty credit risk.
method Constructing a training dataset with noisy but unbiased DIM samples from single MC paths, employing a multi-output neural network structure.
result The approach reduces dataset generation cost to a single MC execution and validates its general applicability and efficiency.

We present two methods, based on Chebyshev tensors, to compute dynamic sensitivities of financial instruments within a Monte Carlo simulation. These methods are implemented and run in a Monte Carlo engine to compute Dynamic Initial Margin as defined by ISDA (SIMM). We show that the levels of accuracy, speed and impleme…

2018-08-24abs ↗pdf ↗

The paper tackles fVaR prediction methods in finance.

problem Predicting future values at risk (fVaR) in finance.
method Various methods including Nested MC-empirical quantile, percentiles from distributions, quantile regressions, and limited inner simulations.
result Improved methods for predicting fVaRs, including those that are computationally efficient.

In a matter-filled spacetime, perhaps with positive cosmological constant, a stable marginally outer trapped 2-sphere must satisfy a certain area inequality. Namely, as discussed in the paper, its area must be bounded above by 4π/c4π/c, where c>0c > 0 is a lower bound on a natural energy-momentum term. We then consider th…

2015-05-29abs ↗pdf ↗

Initial margin requirements are becoming an increasingly common feature of derivative markets. However, while the valuation of derivatives under collateralisation (Piterbarg 2010, Piterbarg2012), under counterparty risk with unsecured funding costs (FVA) (Burgard2011, Burgard2011, Burgard2013) and in the presence of re…

2014-05-02abs ↗pdf ↗

Constructs initial data leading to apparent horizons and tests Penrose Inequality.

problem Testing Penrose Inequality in dynamical spacetimes.
method Scale critical initial data for Einstein vacuum system, constructing Cauchy data.
result Penrose Inequality holds in an open region of the future of initial data.

AIS uses a suboptimal extended target distribution, which this paper improves using SGM.

problem Improving the efficiency of Annealed Importance Sampling for marginal likelihood estimation.
method Leveraging score-based generative modeling to approximate the optimal extended target distribution.
result Demonstrated novel, differentiable AIS procedures on synthetic and real-world data.

Proposes a method to optimize neural network initialization using marginal likelihood maximization.

problem Optimizing hyperparameters for neural network initialization.
method Leverages the connection between neural networks and Gaussian processes to infer optimal hyperparameters.
result Marginal likelihood maximization provides near-optimal prediction performance on MNIST classification tasks.

New MKABSDEs help calculate initial margins in financial contracts.

problem Calculating initial margins in financial contracts with dependencies.
method Introduced MKABSDEs, provided existence and uniqueness, applied to CVaR, used deterministic and Monte-Carlo methods for numerical approximations.
result MKABSDEs provide a new way to solve for initial margins in financial contracts.

We introduce a natural generalization of marginally outer trapped surfaces, called immersed marginally outer trapped surfaces, and prove that three dimensional asymptotically flat initial data sets either contain such surfaces or are diffeomorphic to R^3. We establish a generalization of the Penrose singularity theorem…

2012-04-01abs ↗pdf ↗

We show that any vacuum initial data set containing a marginally outer trapped surface S and satisfying a "no KIDs" condition can be perturbed near S so that S becomes strictly outer trapped in the new vacuum initial data set. This, together with the results in [9], gives a precise sense in which generic initial data c…

2013-08-28abs ↗pdf ↗

Rigidity results for initial data sets related to the positive mass theorem.

problem Rigidity of initial data sets in general relativity.
method Establishing conditions for weak outermost marginally outer trapped surfaces and rigidity results for Riemannian manifolds.
result Marginally outer trapped surfaces are weakly outermost under certain conditions.

Paper proves rigidity of initial data sets with boundary and capillary MOTS.

problem Rigidity of initial data sets with boundary and capillary MOTS.
method Estimates area of MOTS, proves rigidity for 3D, extends to high dimensions using Yamabe constant.
result Rigidity results for initial data sets with boundary and capillary MOTS.

We introduce a dynamic model of the default waterfall of derivatives CCPs and propose a risk sensitive method for sizing the initial margin (IM), and the default fund (DF) and its allocation among clearing members. Using a Markovian structure model of joint credit migrations, our evaluation of DF takes into account the…

2018-03-06abs ↗pdf ↗

New method detects metastable basins in high dimensions using trajectory sampling.

problem Identifying distinct basins in high-dimensional Markov processes.
method Discriminative approach based on marginal trajectory distribution comparison.
result Bayes-optimal classifier achieves high accuracy distinguishing between basins.

Study shows directional convergence for neural networks under spherical symmetry.

problem Learning linear predictors with neural networks under spherically symmetric data.
method Analysis of gradient flow and gradient descent for two-layer and deep linear networks.
result Directional convergence guarantees with exact convergence rate for specific network architectures.

New analysis shows temperature guarantees generalization in stochastic training.

problem Analyzing the generalization gap in stochastic training algorithms.
method Analyzing Langevin dynamics with positive temperature and bounding the generalization gap.
result Bounding the generalization gap by √(βE[L(θ_0)] + log(1/δ))/√N with probability 1-δ.

Study learns dynamics of linear systems from multiple short trajectories.

problem Learning dynamics of autonomous linear systems from multiple short trajectories.
method Finite sample analysis for stable and unstable systems, adjusting trajectory length for marginally stable systems.
result Learning rate of O(1N)\mathcal{O}(\frac{1}{\sqrt{N}}) for both stable and unstable systems.

Study on neuron dynamics for XOR classification with zero-margin.

problem Understanding neural network training dynamics in zero-margin classification problems.
method Analysis of Gaussian XOR problem, focusing on neuron block dynamics and generalization without margin assumptions.
result Neurons cluster into four directions and block-level signals evolve coherently, essential for reliable prediction in the Gaussian setting.

We embed KKT points in neural networks of different sizes.

problem Classifying data using homogeneous neural networks.
method Introducing KKT point embedding principle and proving it for different network types.
result KKT points of a smaller network can be mapped to those of a larger network via linear transformations.

Theoretical justification for deep networks' performance with regularization techniques.

problem Understanding the performance of deep networks trained with the square loss.
method Analysis of gradient flow and theoretical justification of regularization techniques.
result Convergence to solutions with smaller Frobenius norms leads to better classification error bounds.

Study stability and rigidity of axisymmetric marginally outer trapped surfaces.

problem Stability and rigidity of axisymmetric marginally outer trapped surfaces.
method Refined results from initial data sets with Killing vector fields, using new foliation lemma.
result Conditions for the stability of axisymmetric MOTS and new foliation lemma.

We develop theory and applications of forward characteristic processes in discrete time following a seminal paper of Jan Kallsen and Paul Krühner. Particular emphasis is placed on the dynamics of volatility surfaces which can be easily formulated and implemented from the chosen discrete point of view. In mathematical t…

2014-09-05abs ↗pdf ↗

In a diffusion process on a network, how many nodes are expected to be influenced by a set of initial spreaders? This natural problem, often referred to as influence estimation, boils down to computing the marginal probability that a given node is active at a given time when the process starts from specified initial co…

2019-12-29abs ↗pdf ↗

New method reconstructs non-equilibrium stochastic systems from data.

problem Reconstructing non-equilibrium stochastic systems from ensemble measurements.
method Schrödinger bridge problem with multivariate Ornstein-Uhlenbeck process.
result Simulation-free algorithm achieves higher accuracy than competing methods.

New Langevin dynamics samples from entropy-regularized optimal transport.

problem Sampling from entropy-regularized optimal transport.
method Introduced analogous diffusion dynamics constrained to Π(μ,ν)Π(μ,ν).
result Long-time limit is the unique solution of an entropic optimal transport problem.

In this paper we extend the existing literature on xVA along three directions. First, we enhance current BSDE-based xVA frameworks to include initial margin in presence of defaults. Next, we solve the consistency problem that arises when the front-office desk of the bank uses trade-specific discount curves (CSA discoun…

2019-05-27abs ↗pdf ↗

Gradient descent and SGD achieve low test error in specific network weight regimes.

problem Optimizing two-layer ReLU networks with standard initialization.
method Gradient flow and stochastic gradient descent, analyzing margins and weight norms.
result Gradient descent and SGD can achieve globally maximal margins under certain constraints.

This article prices OTC derivatives with either an exogenously determined initial margin profile or endogenously approximated initial margin. In the former case, margin valuation adjustment (MVA) is defined as the liability-side discounted expected margin profile, while in the latter, an extended partial differential e…

2015-12-23abs ↗pdf ↗

The paper calibrates geophysical predictions using marginal distributions and machine learning.

problem Sensitivity to initial conditions in geophysical systems leads to large deviations in long-term forecasts.
method The method introduces a calibration algorithm based on normalization and Kernelized Stein Discrepancy (KSD) to enhance ML predictions.
result The method improves the fidelity of ML predictions to known physical distributions, ensuring consistency with non-local statistical structures.

Boosting is one of the most successful ideas in machine learning. The most well-accepted explanations for the low generalization error of boosting algorithms such as AdaBoost stem from margin theory. The study of margins in the context of boosting algorithms was initiated by Schapire, Freund, Bartlett and Lee (1998) an…

2019-09-27abs ↗pdf ↗