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

95190285380 · Jun 202019922001200920172026
48 results for stochastic polynomial chaos expansions

Combines Gaussian processes and polynomial chaos for stochastic control.

problem Uncertainties in dynamic models lead to performance issues in predictive control.
method Combines Gaussian processes with polynomial chaos expansions to estimate probability distributions of nonlinear functions.
result Demonstrates accurate approximation and closed-loop performance in stochastic nonlinear model predictive control.

AL-SPCE improves reliability analysis for complex systems with active learning and SPCE.

problem Efficiently analyzing reliability of complex, computationally expensive models with intrinsic randomness.
method Active learning framework using stochastic polynomial chaos expansions (SPCE) to reduce computational burden.
result AL-SPCE maintains high accuracy in reliability estimates while significantly improving efficiency.

Polynomial chaos expansions on Grassmannian submanifolds for high-dimensional stochastic systems.

problem Uncertainty quantification in high-dimensional stochastic systems.
method Principal Geodesic Analysis on the Grassmann manifold, adaptive algorithm for local submanifolds, polynomial chaos expansion.
result Efficient surrogate modeling of system behavior across different parameter spaces.

New method estimates SDE parameters efficiently using WCE and SGD.

problem Parameter estimation for stochastic differential equations.
method Wiener Chaos Expansion and Stochastic Gradient Descent.
result Accurate parameter recovery from noisy observations.

Neural networks solve SPDEs using Wiener chaos expansion.

problem Solving stochastic partial differential equations (SPDEs) numerically.
method Using neural networks in the truncated Wiener chaos expansion.
result Approximation rates for learning SPDE solutions with noise.

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.

Neural Chaos uses neural networks instead of polynomials for stochastic modeling.

problem Challenges in constructing surrogate models with uncertainty quantification for complex or high-dimensional stochastic processes.
method Adopting spectral expansion formalism with neural network basis functions, identifying them data-drivenly without prior assumptions.
result Demonstrates effectiveness of the proposed scheme through numerical examples of varying complexity.

A new method builds sparse polynomial chaos expansions for models with dependent inputs.

problem Quantifying uncertainty in models with dependent inputs.
method Data-driven approach to construct orthonormal polynomials recursively based on input correlations.
result Reduces the number of observations and improves numerical stability and computational efficiency.

A new method combines SciML and UQ with physical constraints.

problem Uncertainty quantification in scientific machine learning tasks.
method Physics-constrained polynomial chaos expansion.
result Effective uncertainty quantification and SciML integration.

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper we present a new adaptation mechanism that builds on compressive sensing algorith…

2018-01-06abs ↗pdf ↗

Enhances PCE surrogates using transfer learning for expensive simulations.

problem Over-sampling in PCE for expensive forward models.
method Transfer learning from similar tasks to a new task with limited training data.
result Improves scalability and accuracy of PCE surrogates.

The paper models asset prices using Wiener chaos expansions for efficient calibration to implied volatility surfaces.

problem Calibrating to implied volatility surfaces using flexible martingale models.
method Constructing an over-parameterized martingale model based on Wiener chaos expansions and conditional expectations.
result The method enables fast calibration to implied volatility surfaces and demonstrates flexibility through numerical experiments.

New method samples from time-integrated stochastic bridges using neural networks.

problem Sampling from time-integrated stochastic bridges with high accuracy and speed.
method Polynomial chaos expansion and artificial neural networks.
result Robust, data-driven Monte Carlo sampling with thousands of samples in milliseconds.

A new neural network model uses polynomial chaos theory to improve neural signal processing.

problem Redundant neural signal representation in DANNs.
method Employing arbitrary polynomial chaos theory to construct orthonormal representations in DANNs.
result Improves neural signal processing by reducing redundancy and enhancing orthogonality.

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.

Enhanced PC2^2 improves surrogate modeling for high-dimensional problems.

problem Degrading performance and efficiency of PC2^2 in high-dimensional parameter spaces.
method Integrates SULM solver and D-optimal sampling strategy into PC2^2 framework.
result Enhanced PC2^2 demonstrates better comprehensive capability and efficiency.

This paper tackles reliability analysis for stochastic systems using surrogate models.

problem Traditional reliability analysis relies on deterministic models, which are not suitable for stochastic systems with non-repeatable outcomes.
method The paper introduces reliability analysis for stochastic models by using generalized lambda models and stochastic polynomial chaos expansions as surrogate models to lower computational cost.
result The surrogate models enable efficient uncertainty quantification at a lower cost than traditional Monte Carlo simulation.

A new method for high-dimensional RBDO using stochastic emulators.

problem Efficient RBDO in high-dimensional settings.
method Unified stochastic representation, stochastic emulators, deterministic mapping.
result Significant computational gains in high-dimensional settings.

Deep learning accelerates Monte Carlo SDE simulations with large time steps.

problem Accurate simulation of SDEs with large time steps.
method Polynomial chaos expansion with neural network learned stochastic collocation points.
result Data-driven scheme achieves strong convergence in Monte Carlo simulations.

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.

CODE learns ODE dynamics from sparse data, outperforming neural and kernel methods.

problem Learning ODE dynamics from sparse and noisy data.
method CODE uses Polynomial Chaos Expansion (aPCE) for the ODE's RHS, enabling global orthonormal polynomial representation.
result CODE exhibits remarkable extrapolation capabilities even under novel initial conditions and measurement noise.

Bayesian approach improves sparse PCE for high-dimensional problems.

problem Sparse PCE struggles with high-dimensional uncertainty and underdetermined situations.
method Joint shrinkage priors and MCMC for sparse PCE with uncertainty estimation.
result Bayesian PCE achieves sparse representations with higher polynomial degrees.

Bayesian optimization with RPCE reduces MAP estimation for structural dynamics models.

problem Estimating parameters of structural dynamic models efficiently.
method Bayesian optimization with RPCE surrogate model.
result Effective reduction in model evaluations for MAP estimation.

Surrogate models help predict complex systems with less computational cost.

problem Uncertainty in complex systems due to variability and external loads.
method Surrogate models trained on limited simulations to approximate full time-dependent response.
result Efficient surrogate models reduce computational expense for UQ in nonlinear dynamics.

Conformal prediction improves prediction intervals for PCEs, especially in sparse cases.

problem Quantifying local model errors in PCEs for small datasets.
method Integration of conformal prediction methods (full and Jackknife+) into full and sparse PCEs.
result Better-calibrated prediction intervals for both full and sparse PCEs.

This paper optimizes PCE for efficient surrogate modeling in engineering.

problem Efficiently selecting polynomial regressors for surrogate modeling in computationally expensive models.
method Three state-of-the-art basis-adaptive sparse PCE methods are compared and analyzed.
result Automatic selection of the best solver and basis-adaptive scheme improves surrogate model accuracy.

We present a regression technique for data-driven problems based on polynomial chaos expansion (PCE). PCE is a popular technique in the field of uncertainty quantification (UQ), where it is typically used to replace a runnable but expensive computational model subject to random inputs with an inexpensive-to-evaluate po…

2018-08-09abs ↗pdf ↗

New chaos formula simplifies variance calculation for Gaussian nodal volumes.

problem Analyzing the variance of Gaussian nodal volumes on Riemannian manifolds.
method Explicit Wiener-Itô chaos decomposition, reducing complexity from 2+2n2+2n to 4 Hermite polynomials.
result New exact formula for variance and bounds, valid for arbitrary manifolds.

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.

This paper proposes a new method to optimize portfolio allocation with transaction costs using Wiener chaos expansion.

problem Optimizing portfolio allocation with transaction costs in multi-period settings.
method Wiener chaos expansion approach to represent and solve the optimization problem.
result The proposed method finds an optimal strategy for portfolio allocation with transaction costs.

Polynomial chaos surrogates quantify epistemic uncertainty in AI-driven scientific models.

problem Uncertainty in reward estimates hinders interpretability in sequential generative models.
method Fit polynomial chaos expansions to trained models to propagate epistemic uncertainty and quantify sensitivity.
result Interpretable decomposition of reward components driving generative decisions.

PCENet reduces uncertainty in high-dimensional data efficiently.

problem Uncertainty quantification in high-dimensional data is computationally expensive.
method Two-stage learning process: variational autoencoder for low-dimensional representation, polynomial chaos expansion for mapping.
result Model captures system dynamics, learns under uncertainty, estimates high-dimensional data uncertainty, matches output distribution moments.

In this paper we calibrate chaotic models for interest rates to market data using a polynomial-exponential parametrization for the chaos coefficients. We identify a subclass of one-variable models that allow us to introduce complexity from higher order chaos in a controlled way while retaining considerable analytic tra…

2011-06-13abs ↗pdf ↗

The Wiener chaos approach to interest rate modelling arises from the observation that the pricing kernel admits a representation in terms of the conditional variance of a square-integrable random variable, which in turn admits a chaos expansion. When the expansion coefficients factorise into multiple copies of a single…

2014-03-13abs ↗pdf ↗

A machine learning approach to compute Black-Scholes prices with uncertain volatility.

problem Approximating financial markets with continuous-time models like Black-Scholes when data is discrete.
method Generalized Polynomial Chaos (gPC) method combined with a machine learning technique called Bi-Fidelity.
result Efficient numerical method to quantify uncertainty in derivative pricing.

New method uses sparse random features for crashworthiness analysis.

problem Efficient surrogate modelling for uncertainty quantification.
method Sparse Random Features combined with self-supervised dimensionality reduction.
result Superiority over state-of-the-art techniques in crashworthiness analysis.

Computer simulation has become the standard tool in many engineering fields for designing and optimizing systems, as well as for assessing their reliability. To cope with demanding analysis such as optimization and reliability, surrogate models (a.k.a meta-models) have been increasingly investigated in the last decade.…

2015-02-13abs ↗pdf ↗