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

130260389519 · Jun 202019922001200920172026
48 results for numerical condition

New boundary condition for Black-Scholes equations in strict local martingale models.

problem Computing prices of European options with underlying asset as a strict local martingale.
method Numerical procedure using finite difference methods with a new boundary condition at infinity.
result The minimal solution, satisfying a discrete maximum principle, is the correct derivative price.

Paper introduces a differentiable regularizer for condition number to improve neural network stability.

problem Maintaining numerical stability in neural networks to ensure reliable and performant models.
method Introduces a novel differentiable regularizer for the condition number of weight matrices.
result Derives a differentiable formula for the gradient of the regularizer, promoting matrices with low condition numbers.

A Neural Network (NN) based numerical method is formulated and implemented for solving Boundary Value Problems (BVPs) and numerical results are presented to validate this method by solving Laplace equation with Dirichlet boundary condition and Poisson's equation with mixed boundary conditions. The principal advantage o…

2019-09-24abs ↗pdf ↗

NGRC shows numerical instabilities with short lags and high-degree polynomials.

problem Numerical instabilities in NGRC feature matrix.
method Combining numerical linear algebra and dynamical systems theory, we study feature matrix conditioning. We evaluate different numerical algorithms for solving the regularized least-squares problem.
result SVD-based training achieves accurate forecasts without regularization, preferable for short lags and high-degree polynomials.

This paper simplifies conditional Sobol' indices calculation using PCE bases.

problem Computational inefficiency and lack of consistency in evaluating conditional Sobol' indices.
method Analytical extraction of conditional Sobol' indices via basis decomposition of PCE expansions.
result Derives closed-form expressions for conditional Sobol' indices.

The paper proves a numerical condition for solving complex Hessian quotient equations with Calabi symmetry.

problem Solvability of complex Hessian quotient equations with specific symmetry.
method Proving a numerical condition and proposing a conjecture on existence of kk-subharmonic representatives.
result Numerical condition ensures solvability of complex Hessian quotient equations.

The paper defines and proves conditions for numerical semistability of smooth toric varieties.

problem Understanding the numerical semistability of smooth toric varieties.
method Analyzing the Chow/Hurwitz forms and applying toric degenerations.
result A necessary and sufficient condition for a smooth toric variety to be numerically semistable.

Optimal insurance policy for exponential utility maximization with convex premium calculation.

problem Maximizing terminal wealth utility with exponential utility function and convex premium formula.
method Necessary condition for optimal indemnity, numerical algorithm to compute it, convergence proof.
result Numerical algorithm converges to unique optimal indemnity.

Improves numerical solution of ill-conditioned linear systems for machine learning.

problem Wastefulness and instability in solving ill-conditioned linear systems.
method autonugget combines Richardson extrapolation to determine the solution of the ill-conditioned system, improving accuracy over a single nugget.
result Improves accuracy of numerical solution of ill-conditioned linear systems.

The ratio of two probability densities can be used for solving various machine learning tasks such as covariate shift adaptation (importance sampling), outlier detection (likelihood-ratio test), and feature selection (mutual information). Recently, several methods of directly estimating the density ratio have been deve…

2009-12-15abs ↗pdf ↗

The pricing of Bermudan options amounts to solving a dynamic programming principle, in which the main difficulty, especially in high dimension, comes from the conditional expectation involved in the computation of the continuation value. These conditional expectations are classically computed by regression techniques o…

2019-07-15abs ↗pdf ↗

We provide notions of numerical effectiveness and numerical flatness for Higgs vector bundles on compact Kähler manifolds in terms of fibre metrics. We prove several properties of bundles satisfying such conditions and in particular we show that numerically flat Higgs bundles have vanishing Chern classes, and that they…

2006-05-25abs ↗pdf ↗

This paper numerically computes the topological and smooth invariants of Eschenburg spaces with small fourth cohomology group, following Kruggel's determination of the Kreck-Stolz invariants of Eschenburg spaces that satisfy condition C. The GNU GMP arbitrary-precision library is utilised.

2009-09-21abs ↗pdf ↗

Researchers extend CCVaR to multivariate data using Archimedean copulas.

problem No multivariate extension for CCVaR when dependence is given by Archimedean copulas.
method Derive an almost closed-form expression for CCVaR under an Archimedean copula, examine coherence conditions, and conduct numerical experiments.
result An almost closed-form expression for CCVaR under an Archimedean copula is derived.

In this paper, we study numerically flat holomorphic vector bundles over a compact non-Kähler manifold (X,ω)(X, ω) with the Hermitian metric ωω satisfying the Gauduchon and Astheno-Kähler conditions. We prove that numerically flatness is equivalent to numerically effectiveness with vanishing first Chern number, semistabl…

2019-01-15abs ↗pdf ↗

Study Chen's flow of curves in two settings: closed circles and lines, identifying geometric conditions for global behavior.

problem Understanding the global behavior of Chen's flow of curves in two settings.
method Investigated two settings: closed immersed ω-circles and immersed lines with a cocompactness condition. Analyzed geometric conditions and curvature effects.
result Identified conditions ensuring the flow shrinks every initial curve to a point, including a rescaling method.

Paper tackles conditional expectation estimation using compactification operators.

problem Estimating conditional expectations from product of two random variables.
method Operator theoretic approach using kernel integral operators in reproducing kernel Hilbert space.
result Solutions allow numerical approximation and convergence of data-driven implementations.

Deep learning improves probabilistic PPDE solution accuracy.

problem Approximating solutions to path-dependent PDEs with limited basis selection.
method Deep learning for conditional expectation estimation with error bounds.
result Deep learning yields more accurate PPDE solutions, especially in high dimensions.

Study numerical methods for singular FBSDEs with degenerate forward component.

problem Numerical approximation of singular fully coupled FBSDEs with degenerate forward component and non-smooth terminal condition.
method Splitting approach to treat diffusion and transport parts separately.
result The splitting method converges with rate 1/2 under structural condition.

We consider the numerical stability of the parameter recovery problem in Linear Structural Equation Model ($\LSEM$) of causal inference. A long line of work starting from Wright (1920) has focused on understanding which sub-classes of $\LSEM$ allow for efficient parameter recovery. Despite decades of study, this questi…

2019-05-16abs ↗pdf ↗

We consider the problem of pricing basket options in a multivariate Black Scholes or Variance Gamma model. From a numerical point of view, pricing such options corresponds to moderate and high dimensional numerical integration problems with non-smooth integrands. Due to this lack of regularity, higher order numerical i…

2016-07-19abs ↗pdf ↗

A new method speeds up option pricing under Heston's stochastic volatility model.

problem Speeding up option pricing under the Heston model.
method Iterative splitting method applied to a two-dimensional PDE.
result The iterative splitting method provides more accurate option prices and Greeks compared to traditional methods.

Improved subgradient method tackles ill-conditioned composite optimization problems.

problem Slow convergence of subgradient method for composite optimization problems.
method Preconditioned subgradient method with Levenberg-Marquardt approach.
result Linear convergence rate for composite optimization problems under mild conditions.

The paper explores risk-minimization for exponential additive models, providing mathematical expressions and numerical examples.

problem Risk-minimization in incomplete markets for exponential additive models.
method Derive explicit mathematical expressions for local risk-minimization strategies in exponential additive models.
result Provide necessary conditions for deriving expressions and confirm integrability conditions for specific models.

Locally-verifiable conditions ensure exactness of spline discrete de Rham complex.

problem Ensuring cohomological equivalence of spline discrete complex to continuous de Rham complex.
method Theoretical analysis and locally-verifiable sufficient conditions for exactness.
result Locally-verifiable conditions guarantee exactness of hierarchical B-spline discrete de Rham complex.

The study analyzes numerical stability in large language models using mixed-precision arithmetic.

problem Numerical stability of large language models using low-precision arithmetic.
method Developed a mixed-precision analysis of transformer inference, deriving bounds for condition numbers and forward error.
result Established that numerical stability is determined by the interplay between weight magnitude and the growth of the residual stream.

Adaptive method improves numerical solution of Cox-Ingersoll-Ross model.

problem Approximating solutions to the Cox-Ingersoll-Ross model efficiently.
method Path-bounded timestepping with hybrid approach, including a backstop method.
result The adaptive method is strongly convergent, with strong error control.

Combines neural networks with splitting-up method for filtering equations.

problem Approximating the solution of filtering equations for signal processes.
method Combines splitting-up method with neural networks.
result Produces an approximation of the unnormalised conditional distribution.

Study numerically flat foliations on Kähler manifolds, proving new splitting theorems.

problem Understanding foliations with numerically flat tangent bundles on Kähler manifolds.
method Analyzing the structure of foliations on compact Kähler manifolds, extending earlier results.
result Smooth foliations with numerically flat tangent bundles induce a decomposition of the ambient manifold's tangent bundle.

ETCNN uses neural networks to price American options accurately.

problem Accurately pricing American options with inequality constraints.
method ETCNN framework solving BSM equations with exact terminal condition.
result ETCNN achieves high accuracy and robustness across various scenarios.

Improved fourth-order compact scheme for option valuation with Robin boundary condition.

problem Lower convergence rates in numerical methods for American options.
method High-order compact scheme, Robin boundary condition, coupled nonlinear PDEs.
result Fourth-order convergence rate achieved without mesh refinement.

Two neural network methods approximate conditional optimal transport for Bayesian inference.

problem Approximating conditional optimal transport for Bayesian inference in high dimensions.
method Neural network approximations of conditional optimal transport maps.
result Improved scalability and modeling choices for conditional sampling and density estimation.

We use GANs and signatures to approximate conditional laws in filtering and prediction of diffusion processes.

problem Approximating conditional laws for diffusion processes with noisy observations.
method Conditional GANs combined with signatures for approximation.
result Efficient approximation of conditional laws for diffusion processes.

Study on elasticity with mixed boundary conditions, proving spectral asymptotics.

problem Analyzing spectral asymptotics for linear elasticity with mixed boundary conditions.
method Established two-term spectral asymptotics for linear elasticity on smooth compact manifolds.
result Verification of general formulae through explicit examples in 2D and 3D.

A non-Euclidean generalization of conditional expectation is introduced and characterized as the minimizer of expected intrinsic squared-distance from a manifold-valued target. The computational tractable formulation expresses the non-convex optimization problem as transformations of Euclidean conditional expectation. …

2017-10-16abs ↗pdf ↗

Two-layer networks struggle with high frequencies due to numerical and computational limitations.

problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.

Study simulates Heston-type local stochastic volatility model using particle method.

problem Simulate calibrated Heston-type local stochastic volatility model with non-standard coefficients.
method Monte Carlo particle method, Euler-Maruyama scheme, full truncation Euler scheme.
result Strong convergence of Euler-Maruyama scheme with rate 1/2 in time, up to a logarithmic factor.