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

70141211281 · Jun 202019922001200920172026
48 results for derivative-based measures

Efficiently identifies key input variables for expensive functions using active learning.

problem Efficiently identify key input variables for expensive, black-box functions.
method Proposes novel active learning acquisition functions targeting derivative-based global sensitivity measures (DGSMs) under Gaussian process surrogate models.
result Active learning substantially enhances sample efficiency of DGSM estimation, especially with limited evaluation budgets.

The paper analyzes Lending Club's loan applicants to predict default risk.

problem Predicting default risk in loan applicants of Lending Club.
method Exploratory data analysis and machine learning (Logistic Regression, Random Forest) were used.
result A credit derivative based on Credit Default Swap was designed to hedge default risk.

A novel multi-resolution cluster detection (MCD) method is proposed to identify irregularly shaped clusters in space. Multi-scale test statistic on a single cell is derived based on likelihood ratio statistic for Bernoulli sequence, Poisson sequence and Normal sequence. A neighborhood variability measure is defined to …

2012-05-09abs ↗pdf ↗

Ensemble Kalman methods improve climate model calibration from noisy observations.

problem Calibrating parameters in complex climate models from noisy data.
method Comparing ensemble Kalman methods for efficiency in climate model calibration.
result Ensemble Kalman methods are more efficient and robust for parameter learning in climate models.

Proposes a new derivative concept for nonlinear DRO problems.

problem Optimizing nonlinear functions in probability space with distributionally robust optimization.
method Introduces Gateaux derivative for smoothness and proposes a Frank-Wolfe algorithm.
result Validates theoretical results on portfolio selection problems with numerical validation.

Paper introduces efficient methods for estimating cross-partial derivatives and sensitivity indices.

problem Efficiently estimating cross-partial derivatives and sensitivity indices in complex models.
method Using randomized points and constraints, the paper develops estimators with optimal convergence rates and low bias.
result The estimators achieve optimal rates of convergence and do not suffer from the curse of dimensionality.

We define and study the theory of derivation-based connections on a recently introduced class of bimodules over an algebra which reduces to the category of modules whenever the algebra is commutative. This theory contains, in particular, a noncommutative generalization of linear connections. We also discuss the differe…

1995-03-31abs ↗pdf ↗

In this work we are interested in the problems of supervised learning and variable selection when the input-output dependence is described by a nonlinear function depending on a few variables. Our goal is to consider a sparse nonparametric model, hence avoiding linear or additive models. The key idea is to measure the …

2012-08-13abs ↗pdf ↗

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differen…

2007-07-25abs ↗pdf ↗

Gradient-enhanced GSA uses Poincaré chaos expansions for accurate sensitivity analysis.

problem Accurately estimating Sobol' indices with limited data.
method Integrates sparse, gradient-enhanced regression with Poincaré chaos expansions for derivative-based sensitivity analysis.
result Accurately estimated Sobol' indices using limited data.

We propose Bayesian extensions of two nonparametric regression methods which are kernel and mutual kk-nearest neighbor regression methods. Derived based on Gaussian process models for regression, the extensions provide distributions for target value estimates and the framework to select the hyperparameters. It is show…

2016-08-04abs ↗pdf ↗

We present a flexible approach for the valuation of interest rate derivatives based on Affine Processes. We extend the methodology proposed in Keller-Ressel et al. (2009) by changing the choice of the state space. We provide semi-closed-form solutions for the pricing of caps and floors. We then show that it is possible…

2012-03-21abs ↗pdf ↗

We present a simple hybrid dynamical model as a tool to investigate behavioral strategies based on trend following. The multiplicative symbolic dynamics are generated using a lognormal diffusion model for the at-the-money implied volatility term structure. Thus, are model exploits information from derivative markets to…

2006-05-16abs ↗pdf ↗

For nonlinear supervised learning models, assessing the importance of predictor variables or their interactions is not straightforward because it can vary in the domain of the variables. Importance can be assessed locally with sensitivity analysis using general methods that rely on the model's predictions or their deri…

2019-10-17abs ↗pdf ↗

Derivative-free method solves stochastic optimization problems with noisy objectives and constraints.

problem Solving nonlinear optimization problems with stochastic objectives and deterministic constraints using only zero-order information.
method Derivative-Free Stochastic Sequential Quadratic Programming (DF-SSQP) method using simultaneous perturbation stochastic approximation (SPSA) for gradient and Hessian estimation.
result Global almost-sure convergence of the DF-SSQP method under standard assumptions, with local asymptotic normality and statistical inference.

This paper is concerned with the study of insurance related derivatives on financial markets that are based on non-tradable underlyings, but are correlated with tradable assets. We calculate exponential utility-based indifference prices, and corresponding derivative hedges. We use the fact that they can be represented …

2007-12-21abs ↗pdf ↗

Characterizes when differential forms have weak exterior derivatives based on limiting behavior of integration over simplices.

problem Characterizing differential forms with weak exterior derivatives.
method Uses integration over simplices to characterize the limiting behavior of differential forms.
result Proves a direct analogue of the Bourgain-Brezis-Mironescu characterization for differential forms.

The paper optimizes financial derivatives for market completion in SV models.

problem Optimizing financial derivatives for market completion in stochastic volatility models.
method Simulation-based method to approximate optimal portfolio strategy, using double optimization approach (utility maximization and risk exposure minimization).
result Strangle options are the best choices for market completion in equity options.

A novel unified Bayesian framework for network detection is developed, under which a detection algorithm is derived based on random walks on graphs. The algorithm detects threat networks using partial observations of their activity, and is proved to be optimum in the Neyman-Pearson sense. The algorithm is defined by a …

2013-11-21abs ↗pdf ↗

SLEIPNIR improves Gaussian process regression with derivatives, scaling up efficiently and accurately.

problem Scaling Gaussian process regression with derivatives for large datasets.
method Quadrature Fourier features for feature expansion, proving error bounds.
result Deterministic, non-asymptotic, exponentially fast decaying error bounds for approximated kernel and posterior.

Convolution operations designed for graph-structured data usually utilize the graph Laplacian, which can be seen as message passing between the adjacent neighbors through a generic random walk. In this paper, we propose PAN, a new graph convolution framework that involves every path linking the message sender and recei…

2019-04-24abs ↗pdf ↗

Efficient method for pricing European and American options using Markov switching stochastic volatility model.

problem Modeling and pricing options under varying volatility and mean-reversion speeds.
method Discrete-time Markov switching stochastic volatility with co-jump model, computationally efficient approach for European options, and conversion to European option pricing for American options.
result Efficient and accurate methods for pricing options, including variance swap analysis.

In many problems of supervised tensor learning (STL), real world data such as face images or MRI scans are naturally represented as matrices, which are also called as second order tensors. Most existing classifiers based on tensor representation, such as support tensor machine (STM) need to solve iteratively which occu…

2017-07-20abs ↗pdf ↗

Data-driven control of robotic systems using Koopman operators with error bounds.

problem Real-time control of nonlinear robotic systems with unknown dynamics.
method Constructing a Koopman operator-based linear representation using higher-order derivatives of nonlinear dynamics, with error bounds derived from Taylor series accuracy analysis.
result The Koopman model provides marginally better performance than competing nonlinear modeling methods and can be efficiently controlled using linear control design tools.

Game theory finds nowadays a broad range of applications in engineering and machine learning. However, in a derivative-free, expensive black-box context, very few algorithmic solutions are available to find game equilibria. Here, we propose a novel Gaussian-process based approach for solving games in this context. We f…

2016-11-08abs ↗pdf ↗

LazyDINO efficiently solves high-dimensional Bayesian inverse problems with fast and scalable solutions.

problem High-dimensional nonlinear Bayesian inverse problems with expensive parameter-to-observable maps.
method LazyDINO combines derivative-informed neural surrogates and lazy map variational inference for efficient posterior approximation.
result Significant cost reduction in amortized Bayesian inversion, achieving one to two orders of magnitude improvement.

A new algorithm solves bilevel optimization with linear constraints.

problem Solving bilevel optimization problems with coupled linear constraints.
method Penalty and augmented Lagrangian methods reformulate the problem; a single-loop, first-order algorithm proposed.
result Improved convergence rates compared to prior methods.

Study Schwarzians in the Heisenberg group, introducing new definitions and characterizing contact conformal vector fields.

problem Exploring Schwarzians in the Heisenberg group and their properties.
method Introducing two definitions of Schwarzians (CR and classical) and studying their kernels and cocycle conditions.
result Characterization of contact conformal vector fields and results in subelliptic PDEs.

Conformal prediction is a popular tool for providing valid prediction sets for classification and regression problems, without relying on any distributional assumptions on the data. While the traditional description of conformal prediction starts with a nonconformity score, we provide an alternate (but equivalent) view…

2019-10-23abs ↗pdf ↗