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

4.8%9.6%14.4%19.2% · Feb 202619922001200920172026
48 results for parameter sensitivities

Study parameter sensitivities in bond pricing models with jumps.

problem Analyzing the impact of parameters on bond pricing models with jumps.
method Theoretical analysis and MATLAB simulations of a Brownian motion and compound Poisson process.
result Explicit call price formula and verification of sensitivities.

SSRCA simplifies ABM sensitivity analysis using machine learning.

problem Hardness of performing sensitivity analysis for complex ABMs.
method Machine learning pipeline (Simulate, Summarize, Reduce, Cluster, Analyze) for ABMs.
result SSRCA identifies sensitive parameters and common output patterns for ABMs.

SeReNe prunes neurons with low sensitivity to reduce network size.

problem Large neural networks consume too many resources on resource-constrained devices.
method Exploits neural sensitivity as a regularizer to prune neurons with low sensitivity.
result Pruning neurons with low sensitivity achieves competitive compression ratios.

The paper analyzes robustness and sensitivity of rough Volterra stochastic volatility models.

problem Analyzing the robustness and sensitivity of stochastic volatility models.
method Statistical tests and empirical analysis on Apple Inc. equity options.
result Comparison of different models' robustness and sensitivity to option data structure.

Proposes ML methods for robust price-sensitivity estimation in dynamic pricing.

problem Estimating price elasticities robustly in the presence of feature-dependent sensitivity.
method Poisson semi-parametric model with two-stage estimation: first-stage ML for observed purchases, second-stage Bayesian GLM for price-sensitivity.
result Reduces estimation error in price-sensitivity parameters from 25% to 4%.

The ever-increasing number of parameters in deep neural networks poses challenges for memory-limited applications. Regularize-and-prune methods aim at meeting these challenges by sparsifying the network weights. In this context we quantify the output sensitivity to the parameters (i.e. their relevance to the network ou…

2018-10-28abs ↗pdf ↗

Proposes a method to assess unobserved confounding effects in causal inference.

problem Assessing unobserved confounding in causal inference studies.
method Copula-based normalizing flows with sensitivity parameter ρρ.
result Estimates average causal effect (ACE) as a function of unobserved confounding strength.

Proposes a differentially private bandit algorithm reducing noise over time.

problem Privacy concerns in interactive recommendation systems.
method Tree-based mechanism to add Laplace or Gaussian noise to model parameters, focusing on dynamic global sensitivity.
result Demonstrates (ε,δ)(ε, δ)-differential privacy with reduced noise and improved regret.

Paper improves robustness of GNNs against adversarial attacks.

problem Understanding robust generalization of GNNs in adversarial settings.
method Develops a sensitivity-aware PAC-Bayesian framework for MPGNNs.
result Derives tighter robust generalization bounds for MPGNNs.

The study assesses sensitivity to prior choices in Bayesian nonparametric models.

problem Difficulty in specifying priors for Bayesian nonparametric models.
method Utilizes variational Bayesian methods to assess sensitivity to concentration parameter and stick-breaking distribution.
result Demonstrates how to evaluate sensitivity to prior choices in Dirichlet process mixtures and related models.

Two formulae estimate sensitivity of random vectors to distributional parameters.

problem Estimating sensitivity of random vectors to distributional parameters.
method Two analytical formulae and four numerical algorithms.
result Validated numerical algorithms and demonstrated effectiveness.

Bayesian approach improves AdaLoRA's performance and efficiency.

problem Improving the efficiency and performance of adaptive low-rank adaptation.
method Utilized Bayesian metrics and the Improved Variational Online Newton (IVON) optimizer for adaptive parameter budget allocation.
result Bayesian counterpart outperforms sensitivity-based importance metric and is faster than AdaLoRA.

We develop a method for quantile-based sensitivity analysis in models with discontinuities.

problem Uncertainty in interpreting discontinuous models using traditional derivatives.
method Quantile-based derivatives for discontinuous models with discrete inputs.
result Derivatives of quantile-based outputs are well-defined and provide meaningful insights.

Diffusion models accurately recover mixture weights from generated samples despite score function insensitivity.

problem Score-based generative models often fail to learn correct relative mode amplitudes (mixture weights) from generated samples.
method Relate diffusion score matching (DSM) loss to mixture weight estimation error, define diffusion score sensitivity index (DSSI), and prove its governing role in mixture weight recovery.
result Generated samples can accurately recover mixture weights from the DSM loss, even when the target score is insensitive to mixture weights.

Proposes ρρ-GNF for sensitivity analysis of unobserved confounding.

problem Sensitivity analysis of unobserved confounding in observational studies.
method Copulas and normalizing flows to estimate average causal effect (ACE) as a function of unobserved confounding strength.
result Develops ρcurveρ_{curve} to provide bounds for ACE and identify confounding strength required to nullify ACE.

We propose a cloud-based filter trained to block third parties from uploading privacy-sensitive images of others to online social media. The proposed filter uses Distributed One-Class Learning, which decomposes the cloud-based filter into multiple one-class classifiers. Each one-class classifier captures the properties…

2018-02-10abs ↗pdf ↗

The paper develops methods to analyze sensitivity in stochastic models using surrogate models.

problem Quantifying the impact of input variability on stochastic simulators with randomness.
method The authors propose using generalized lambda models to emulate response distributions of stochastic simulators and estimate sensitivity indices.
result The proposed method can estimate sensitivity indices even with strong heteroskedasticity and small signal-to-noise ratio.

Linking output sensitivity to deep learning generalization.

problem Understanding and comparing the generalization properties of deep neural networks.
method Linking the loss function to output sensitivity and analyzing its relation to bias-variance decomposition.
result Output sensitivity is a strong metric for comparing generalization performance of deep networks.

Framework for sensitivity analysis in biomanufacturing processes.

problem High complexity and uncertainty in biomanufacturing processes.
method Shapley value estimation for linear and nonlinear pKG models, using quasi-Monte Carlo and antithetic sampling.
result Improved efficiency and accuracy in sensitivity analysis for biomanufacturing processes.

This paper adresses the general issue of estimating the sensitivity of the expectation of a random variable with respect to a parameter characterizing its evolution. In finance for example, the sensitivities of the price of a contingent claim are called the Greeks. A new way of estimating the Greeks has been recently i…

2009-09-14abs ↗pdf ↗

Gradient descent with large steps leads to chaotic parameter space and unpredictable outcomes.

problem Understanding the behavior of gradient descent with large step sizes in matrix factorization.
method Analyzing the fractal structure of the parameter space and deriving critical step sizes for convergence.
result Gradient descent with large steps exhibits chaotic behavior and sensitivity to initialization, creating a fractal boundary between converging and diverging minimizers.

Paper introduces a new method for risk-sensitive investment management using RL.

problem Risk-sensitive portfolio management with unknown model parameters.
method Combines RL and risk-sensitive stochastic control with Gaussian perturbations for exploration.
result Endogenous relative-entropy regularization and optimal investment strategy derived.

This study prioritizes temporal resolution over spatial in energy systems models due to higher influence.

problem The impact of spatial and temporal resolution on energy system models.
method Global sensitivity analysis to compare structural aspects, spatial, and temporal resolution.
result Temporal resolution has a higher influence on all results parameters compared to spatial resolution.

OPNP prunes parameters and neurons to improve OOD detection without training.

problem Detecting out-of-distribution samples in real-world machine learning models.
method OPNP approach that identifies and removes sensitive parameters and neurons.
result OPNP consistently outperforms existing methods on multiple OOD detection tasks.

DALTON improves ODE parameter estimation by learning from noisy data.

problem High sensitivity to parameters in ODEs produces unreliable parameter estimates.
method Data-adaptive probabilistic likelihood approximation for ODEs.
result DALTON produces more accurate parameter estimates than existing methods.

Sharp bounds on ATE with unmeasured confounders, valid even when misspecified.

problem Bounding average treatment effects with unmeasured confounders.
method Distributionally robust optimization, double sharpness, double validity.
result Proposes estimators with robustness properties for valid bounds.

Optimal AFs minimize RFR test error and sensitivity.

problem Finding optimal AFs for RFR to minimize test error and sensitivity.
method Closed-form solution for AFs minimizing test error and sensitivity under different functional parsimony.
result Optimal AFs can be linear, saturated linear, or Hermite polynomial expressions.

Generatability in metric spaces studied with novel novelty parameters.

problem Understanding generatability in metric spaces with asymmetric novelty parameters.
method Introducing (ε,ε)(\varepsilon,\varepsilon')-closure dimension to characterize uniform and non-uniform generatability.
result Generatability is stable across novelty scales in doubling spaces but can be highly scale-sensitive in general metric spaces.

We study the effect of parameters uncertainties on a stochastic diffusion model, in particular the impact on the pricing of contingent claims, thanks to Dirichlet Forms methods. We apply recent techniques, developed by Bouleau, to hedging procedures in order to compute the sensitivities of SDE trajectories with respect…

2010-01-28abs ↗pdf ↗

Symbolic LSTM improves time series forecasting by reducing hyperparameter sensitivity.

problem High sensitivity to hyperparameters and random initialization in numerical time series forecasting.
method Combining LSTM with a dimension-reducing symbolic representation.
result Symbolic representation alleviates forecasting problems and speeds up training.

SNAPO optimizes policies for complex sequential decisions using differentiable simulation.

problem Optimizing policies for high-dimensional, sequential decisions under uncertainty.
method Embeds neural policy in a differentiable simulator, computes gradients efficiently.
result Produces sensitivities at a cost proportional to one reverse pass, regardless of sensitivity count.

We study the effect of parameter uncertainty on a stochastic diffusion model, in particular the impact on the pricing of contingent claims, using methods from the theory of Dirichlet forms. We apply these techniques to hedging procedures in order to compute the sensitivity of SDE trajectories with respect to parameter …

2012-03-26abs ↗pdf ↗

This paper introduces a method to incorporate risk sensitivity in RL using quadratic variation penalties.

problem Risk-sensitive reinforcement learning under entropy regularization.
method Equivalent martingale property and quadratic variation penalty for value process.
result The proposed method improves finite-sample performance in linear-quadratic control problems.