Searcharxiv⌕ Search

arXiv subjects

Sergei Kucherenko

Publications and source records attributed to Sergei Kucherenko.

9 recordsLinked to original sources

Geometry-Aware R-Structured Kolmogorov-Arnold Networks

We propose a novel hybrid neural architecture, the Geometry-aware R-Structured Kolmogorov-Arnold Network (GRS-KAN), which integrates V.L.Rvachev's R-functions into the Kolmogorov-Arnold Network (KAN) framework. The proposed approach combines two complementary modeling mechanisms: smooth nonlinear structure is learned by KAN branches, while known geometric or logical constraints are encoded analytically using differentiable R-functions. This enables explicit representation of discontinuities, feasible regions, and implicit geometric boundaries within a trainable neural architecture. The framework implements differentiable logical operations through R-conjunctions and R-disjunctions, allowing complex geometric supports to be represented analytically and incorporated directly into regression models. Several GRS-KAN variants are introduced, including additive, multiplicative, and agnostic branch-weighted architectures. The method is demonstrated on regression problems involving discontinuities with circular and rectangular supports. Numerical experiments show that explicit geometric encoding substantially improves predictive accuracy and boundary localization compared with standard KANs. In the considered benchmarks, geometry-aware GRS-KAN models reduce test RMSE by up to 67% while simultaneously improving interpretability through explicit analytical representation of the learned geometric structure. The agnostic variant further demonstrates the ability to automatically determine whether geometric priors are beneficial for a given learning task.

cs.LG↗

Active subspace methods and derivative-based Shapley effects for functions with non-independent variables

Lower-dimensional subspaces that impact estimates of uncertainty are often described by Linear combinations of input variables, leading to active variables. This paper extends the derivative-based active subspace methods and derivative-based Shapley effects to cope with functions with non-independent variables, and it introduces sensitivity-based active subspaces. While derivative-based subspace methods focus on directions along which the function exhibits significant variation, sensitivity-based subspace methods seek a reduced set of active variables that enables a reduction in the function's variance. We propose both theoretical results using the recent development of gradients of functions with non-independent variables and practical settings by making use of optimal computations of gradients, which admit dimension-free upper-bounds of the biases and the parametric rate of convergence. Simulations show that the relative performance of derivative-based and sensitivity-based active subspaces methods varies across different functions.

math.NA↗

Effective dimensionality reduction for Greeks computation using Randomized QMC

Global sensitivity analysis is employed to evaluate the effective dimension reduction achieved through Chebyshev interpolation and the conditional pathwise method for Greek estimation of discretely monitored barrier options and arithmetic average Asian options. We compare results from finite difference and Monte Carlo methods with those obtained by using randomized Quasi Monte Carlo combined with Brownian bridge discretization. Additionally, we investigate the benefits of incorporating importance sampling with either the finite difference or Chebyshev interpolation methods. Our findings demonstrate that the reduced effective dimensionality identified through global sensitivity analysis explains the performance advantages of one approach over another. Specifically, the increased smoothness provided by Chebyshev or conditional pathwise methods enhances the convergence rate of randomized Quasi Monte Carlo integration, leading to the significant increase of accuracy and reduced computational costs.

q-fin.CP↗

Quasi-Monte Carlo methods for calculating derivatives sensitivities on the GPU

The calculation of option Greeks is vital for risk management. Traditional pathwise and finite-difference methods work poorly for higher-order Greeks and options with discontinuous payoff functions. The Quasi-Monte Carlo-based conditional pathwise method (QMC-CPW) for options Greeks allows the payoff function of options to be effectively smoothed, allowing for increased efficiency when calculating sensitivities. Also demonstrated in literature is the increased computational speed gained by applying GPUs to highly parallelisable finance problems such as calculating Greeks. We pair QMC-CPW with simulation on the GPU using the CUDA platform. We estimate the delta, vega and gamma Greeks of three exotic options: arithmetic Asian, binary Asian, and lookback. Not only are the benefits of QMC-CPW shown through variance reduction factors of up to $1.0 \times 10^{18}$, but the increased computational speed through usage of the GPU is shown as we achieve speedups over sequential CPU implementations of more than $200$x for our most accurate method.

q-fin.CP↗

Pricing and Risk Analysis in Hyperbolic Local Volatility Model with Quasi Monte Carlo

Local volatility models usually capture the surface of implied volatilities more accurately than other approaches, such as stochastic volatility models. We present the results of application of Monte Carlo (MC) and Quasi Monte Carlo (QMC) methods for derivative pricing and risk analysis based on Hyperbolic Local Volatility Model. In high-dimensional integration QMC shows a superior performance over MC if the effective dimension of an integrand is not too large. In application to derivative pricing and computation of Greeks effective dimensions depend on path discretization algorithms. The results presented for the Asian option show the superior performance of the Quasi Monte Carlo methods especially for the Brownian Bridge discretization scheme.

q-fin.CP↗

Quantile based global sensitivity measures

New global sensitivity measures based on quantiles of the output are introduced. Such measures can be used for global sensitivity analysis of problems in which quantiles are explicitly the functions of interest and for identification of variables which are the most important in achieving extreme values of the model output. It is proven that there is a link between introduced measures and Sobol main effect sensitivity indices. Two different Monte Carlo estimators are considered. It is shown that the double loop reordering approach is much more efficient than the brute force estimator. Several test cases and practical case studies related to structural safety are used to illustrate the developed method. Results of numerical calculations show the efficiency of the presented technique.

stat.AP↗

Different numerical estimators for main effect global sensitivity indices

The variance-based method of global sensitivity indices based on Sobol sensitivity indices became very popular among practitioners due to its easiness of interpretation. For complex practical problems computation of Sobol indices generally requires a large number of function evaluations to achieve reasonable convergence. Four different direct formulas for computing Sobol main effect sensitivity indices are compared on a set of test problems for which there are analytical results. These formulas are based on high-dimensional integrals which are evaluated using MC and QMC techniques. Direct formulas are also compared with a different approach based on the so-called double loop reordering formula. It is found that the double loop reordering (DLR) approach shows a superior performance among all methods both for models with independent and dependent variables.

math.NA↗

Exploring multi-dimensional spaces: a Comparison of Latin Hypercube and Quasi Monte Carlo Sampling Techniques

Three sampling methods are compared for efficiency on a number of test problems of various complexity for which analytic quadratures are available. The methods compared are Monte Carlo with pseudo-random numbers, Latin Hypercube Sampling, and Quasi Monte Carlo with sampling based on Sobol sequences. Generally results show superior performance of the Quasi Monte Carlo approach based on Sobol sequences in line with theoretical predictions. Latin Hypercube Sampling can be more efficient than both Monte Carlo method and Quasi Monte Carlo method but the latter inequality holds for a reduced set of function typology and at small number of sampled points. In conclusion Quasi Monte Carlo method would appear the safest bet when integrating functions of unknown typology.

stat.AP↗

Pricing and Risk Management with High-Dimensional Quasi Monte Carlo and Global Sensitivity Analysis

We review and apply Quasi Monte Carlo (QMC) and Global Sensitivity Analysis (GSA) techniques to pricing and risk management (greeks) of representative financial instruments of increasing complexity. We compare QMC vs standard Monte Carlo (MC) results in great detail, using high-dimensional Sobol' low discrepancy sequences, different discretization methods, and specific analyses of convergence, performance, speed up, stability, and error optimization for finite differences greeks. We find that our QMC outperforms MC in most cases, including the highest-dimensional simulations and greeks calculations, showing faster and more stable convergence to exact or almost exact results. Using GSA, we are able to fully explain our findings in terms of reduced effective dimension of our QMC simulation, allowed in most cases, but not always, by Brownian bridge discretization. We conclude that, beyond pricing, QMC is a very promising technique also for computing risk figures, greeks in particular, as it allows to reduce the computational effort of high-dimensional Monte Carlo simulations typical of modern risk management.

q-fin.RM↗