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

Trend · papers per month

3367100133 · Jun 202019922001200920172026
48 results for engine sensitivity

New method for mixed-variable GSA improves material design efficiency.

problem Designing materials with both quantitative and qualitative variables.
method Integrates LVGP with Sobol' analysis for mixed-variable GSA.
result Accelerates exploration of novel MOF candidates in combinatorial design spaces.

New metrics quantify implementation risk in portfolio backtesting, revealing systematic differences in engine implementations.

problem Systematic divergence in backtested portfolio metrics due to differences in engine implementations.
method Formalized implementation risk, proposed four metrics, executed 15 strategies through five engines, analyzed source-code defects.
result Implementation risk introduces measurable ambiguity in performance attribution, but does not alter investment decisions.

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 paper presents efficient sampling methods for Gaussian processes.

problem High cost of global sensitivity analysis and optimization due to limited high-quality observations.
method Two sampling methods: random Fourier features and pathwise conditioning.
result Efficient generation of posterior samples from Gaussian processes at reduced computational cost.

Proposes ICE-based metric for better understanding interactions in black-box models.

problem Misleading global sensitivity metrics in black-box models due to interaction effects.
method Individual Conditional Expectation (ICE) curves to compute feature importance and interactions.
result ICE-based metric provides richer insights into feature importance and interactions.

Sobol method applied to probabilistic networks for sensitivity analysis.

problem Measuring influence of probabilistic network nodes on a quantity of interest.
method Transforms global sensitivity analysis into marginalization inference exploiting network structure.
result Efficient computation of sensitivity indices for complex networks.

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 ↗

Complex black-box predictive models may have high accuracy, but opacity causes problems like lack of trust, lack of stability, sensitivity to concept drift. On the other hand, interpretable models require more work related to feature engineering, which is very time consuming. Can we train interpretable and accurate mod…

2019-02-28abs ↗pdf ↗

Paper uses PCE to quantify ML model and input uncertainties.

problem Accurately quantify and propagate combined uncertainties in ML predictions.
method Polynomial Chaos Expansion (PCE) for joint input and model uncertainty.
result Efficient and accurate calculation of output variability and sensitivity.

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 optimization of high dimensional functions is a key issue in engineering problems but it frequently comes at a cost that is not acceptable since it usually involves a complex and expensive computer code. Engineers often overcome this limitation by first identifying which parameters drive the most the function varia…

2018-11-12abs ↗pdf ↗

This paper simplifies hedge ratios in financial models using pathwise algorithmic differentiation.

problem Expensive and unstable computation of hedge ratios from pathwise sensitivities.
method Develops reduced stochastic hedge ratios of the form φ_j^r = Σ_j^r ξ_j^q X_q, retaining sensitivity tensor through empirical averages.
result Two coefficient criteria are introduced to minimize pathwise residuals and satisfy moment equations.

The paper explores SHAP scores and their connection to functional ANOVA, highlighting challenges in approximations.

problem Estimating SHAP scores and understanding their limitations.
method Using the connection to functional ANOVA, the paper outlines the challenges in SHAP approximations and their relation to feature distribution and ANOVA terms.
result Challenges in SHAP approximations are primarily due to feature distribution and the number of ANOVA terms estimated.

Proposes FOAGP for efficient orthogonal effect decomposition of black-box computer experiments.

problem Challenges in sensitivity analysis of black-box computer experiments with complex, nonlinear functional outputs.
method Functional-output orthogonal additive Gaussian process (FOAGP) with conditional orthogonality constraint.
result Demonstrates effectiveness in orthogonal effect decomposition and variance decomposition through simulations and real-world application.

Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier …

2012-10-09abs ↗pdf ↗

Accurately predicting customer churn using large scale time-series data is a common problem facing many business domains. The creation of model features across various time windows for training and testing can be particularly challenging due to temporal issues common to time-series data. In this paper, we will explore …

2018-02-09abs ↗pdf ↗

The concept of mathematical modeling is widespread across almost all of the fields of contemporary science and engineering. Because of the existing necessity of predictions the behavior of natural phenomena, the researchers develop more and more complex models. However, despite their ability to better forecasting, the …

2019-04-08abs ↗pdf ↗

Surrogate models improve chemical process equipment design and optimization.

problem Design and optimization of complex chemical processes.
method Development and validation of CFD simulators, active learning strategies, and regression techniques.
result Gaussian process regression outperformed other techniques in benchmarking.

Method quantifies sensitivity of reliability analysis to uncertainty sources.

problem Computational expense in reliability analysis of complex models.
method Gaussian process surrogate model, active learning, sensitivity analysis.
result Reduces main source of error in estimating rare event probabilities.

Kolmogorov-Arnold Networks offer interpretable models for energy applications.

problem Lack of interpretability in modern machine learning methods for sensitive industries.
method Symbolic regression with Kolmogorov-Arnold Networks compared to traditional feedforward neural networks.
result Kolmogorov-Arnold Networks yield perfectly interpretable models and learn real, physical relations.

Patient notes contain a wealth of information of potentially great interest to medical investigators. However, to protect patients' privacy, Protected Health Information (PHI) must be removed from the patient notes before they can be legally released, a process known as patient note de-identification. The main objectiv…

2016-10-30abs ↗pdf ↗

Paper proposes a k-NN classifier for detecting spike-and-wave seizures in EEG.

problem Early detection of epileptic seizures in EEG signals.
method Uses t-location-scale distribution and k-nearest neighbors classifier.
result Demonstrates improved classification accuracy, sensitivity, and specificity on real data.

Paper proposes a holistic optimization for civil structures considering uncertainties.

problem Designing civil structures requires integration of material and structural design.
method Holistic optimization combining concrete mixture design and structural simulations.
result Inverted workflow allows consideration of new mixtures and uncertainties.

This paper analyzes uncertainty in DFN simulations using sensitivity analysis.

problem Uncertainty in estimating QoI due to epistemic and aleatoric uncertainties in DFN simulations.
method Sensitivity analysis to attribute uncertainty to input parameters and aleatoric uncertainty.
result Characterizes uncertainty in DFN flow simulations with heteroskedastic aleatoric uncertainty.

Modeling vessel speed to balance efficiency and environmental risks in Arctic shipping.

problem Balancing vessel speed with environmental and ecological risks in Arctic shipping.
method Inverse control constrained optimization framework with risk parameters estimated from AIS data.
result Distinct decision-making patterns across vessel types and navigational statuses, with varying sensitivity to ice and whale risks.

This review discusses challenges and solutions for AI in chemical engineering.

problem Challenges in applying classical machine learning to chemical engineering data.
method Identifying four data characteristics and discussing their applications and solutions.
result Current research extends data science and machine learning to handle chemical engineering data challenges.

Timely prediction of clinically critical events in Intensive Care Unit (ICU) is important for improving care and survival rate. Most of the existing approaches are based on the application of various classification methods on explicitly extracted statistical features from vital signals. In this work, we propose to elim…

2018-11-14abs ↗pdf ↗

We describe ways to define and calculate L1L_1-norm signal subspaces which are less sensitive to outlying data than L2L_2-calculated subspaces. We focus on the computation of the L1L_1 maximum-projection principal component of a data matrix containing N signal samples of dimension D and conclude that the general proble…

2013-09-04abs ↗pdf ↗

The computational complexity of solving nonlinear support vector machine (SVM) is prohibitive on large-scale data. In particular, this issue becomes very sensitive when the data represents additional difficulties such as highly imbalanced class sizes. Typically, nonlinear kernels produce significantly higher classifica…

2017-07-24abs ↗pdf ↗

Derivative-informed models improve financial surrogates for accurate hedging and risk management.

problem Developing fast surrogate models for financial derivatives and risk quantities.
method Derivative-informed operator learning framework combining neural operators, random features, and tangent sensitivity equations.
result The framework reduces hedging and risk errors by 40-76% compared to standard surrogates.

Paper uses deep reinforcement learning for better control of rocket engines during start-up phases.

problem Lack of optimal control during transient phases of liquid rocket engines.
method Deep reinforcement learning approach for optimal control of a gas-generator engine's continuous start-up phase.
result Deep reinforcement learning controller achieves highest performance and minimal computational effort.

Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.

problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.

Paper proposes verifier engineering for improving foundation models.

problem Challenges in providing effective supervision signals for foundation models.
method Leverages automated verifiers to perform verification tasks and deliver feedback.
result Verifier engineering can enhance foundation models' capabilities.

TL-ANDI distills context from source data to improve transfer learning for TFMs.

problem Limited transfer learning due to context-size constraints and distribution shifts.
method TL-ANDI uses posterior-aware distillation to construct a compact source context and locally distills labels.
result Improves transfer performance by addressing context-size and distribution shifts.

Polynomial chaos surrogates handle intrinsic noise in stochastic models.

problem Handling intrinsic noise in stochastic models with parametric uncertainty.
method Developed a PCE surrogate on a joint space of intrinsic and parametric uncertainty using Rosenblatt transformations and Karhunen-Loeve expansion.
result Quantified intrinsic noise contribution to model output variance using PCE Sobol indices.

Optimizes BESS for cross-market energy arbitrage to boost revenues.

problem Charging and discharging BESS at optimal times to maximize profits.
method Developed a generic framework, backtest engine, and optimization strategy.
result Boosted revenues by 10% through strategic BESS operation.