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

97193290386 · Jun 202019922001200920172026
48 results for Partial Stochasticity

Bayesian neural networks can be partially stochastic without losing predictive power.

problem The necessity of fully stochastic parameters in Bayesian neural networks.
method Theoretical and empirical investigation of partially stochastic networks compared to fully stochastic ones.
result Expressive predictive distributions require only small amounts of stochasticity, and partially stochastic networks can match or outperform fully stochastic networks.

Clarifies when solutions to stochastic PDEs stay near given subsets.

problem Understanding the proximity of solutions to stochastic PDEs to given subsets.
method Analyzes distance between closed sets and solutions to stochastic PDEs.
result Clarifies conditions for solutions to stay near given subsets.

New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.

problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.

Improves model accuracy for neural nets in stochastic dynamics with partial prior knowledge.

problem Stability and accuracy in neural nets modeling stochastic dynamics with many parameters.
method Three steps: probabilistic weights, partial knowledge incorporation, and PAC-Bayesian training.
result Improved model fit with partial and noisy prior knowledge.

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.

This work explains GANs as Bayesian neural networks with partial stochasticity.

problem Challenges in optimizing GANs and understanding their limitations.
method Interpreting GANs as Bayesian neural networks with partial stochasticity, establishing conditions, and proposing strategies to smooth the loss landscape and find solutions with minimum description length.
result Proposed strategies lead to performance improvements and deeper understanding of GANs.

SON learns SPDE solutions and uncertainty from noisy data.

problem Uncertainty quantification in SPDEs with unknown model uncertainties.
method Combining DeepONet and SNNs, SON models stochasticity and predicts uncertainty.
result SON accurately captures solution structure and quantifies predictive uncertainty.

Novel framework for learning infinitesimal generator of stochastic processes.

problem Challenges in learning infinitesimal generator due to unbounded nature and state space dimensionality.
method Introduces a novel framework based on energy functional, integrates physical priors, and uses reduced-rank estimator in RKHS.
result Learning bounds independent of state space dimension and non-spurious spectral estimation.

New approach handles stochastic and partially-observable environments using discrete autoencoders and Monte Carlo tree search.

problem Challenges in planning for stochastic and partially-observable environments.
method Uses discrete autoencoders and a stochastic variant of Monte Carlo tree search.
result Significantly outperforms MuZero on stochastic chess and scales to DeepMind Lab.

Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.

problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.

This paper presents a novel approach to numerically solve stochastic differential games for nonlinear systems. The proposed approach relies on the nonlinear Feynman-Kac theorem that establishes a connection between parabolic deterministic partial differential equations and forward-backward stochastic differential equat…

2019-06-11abs ↗pdf ↗

Paper develops efficient Bayesian inference for enzymatic SRNs with LNA metamodel.

problem Bayesian inference for nonlinear SDE-based mechanistic models with partial observations and measurement errors.
method Interpretable Bayesian updating LNA metamodel and efficient posterior sampling.
result Proposed approach demonstrates promising performance in empirical studies.

New model captures state-dependent variability in partially observed systems.

problem Structured stochasticity not captured by constant-variance models.
method State-coupled stochastic volatility framework with particle expectation-maximization.
result Model consistently reduces recovery bias under partial observation.

New framework for ranking distributions using variable fractional parameters.

problem Ordering distributions with varying steepness and local non-concavities.
method Introducing a function γ:Ro[0,1]\boldsymbolγ: \mathbb{R} o [0,1] to replace the fixed parameter in fractional SD.
result Enables ranking of a broader range of distributions and incorporates dynamic greediness.

New algorithms reduce regret in both stochastic and adversarial partial monitoring problems.

problem Partial monitoring with kk-actions and dd-outcomes.
method Follow-the-regularized-leader framework, exploration by optimization, adaptive learning rate.
result Best-of-both-worlds algorithms with favorable regret bounds in stochastic and adversarial settings.

A new paradigm recently emerged in financial modelling: rough (stochastic) volatility, first observed by Gatheral et al. in high-frequency data, subsequently derived within market microstructure models, also turned out to capture parsimoniously key stylized facts of the entire implied volatility surface, including extr…

2017-10-20abs ↗pdf ↗

Deep learning model solves high-dimensional PDEs using Actor-Critic approach.

problem Solving high-dimensional nonlinear PDEs efficiently.
method Reformulated PDE into BSDE system, inspired by Actor-Critic algorithm for deep RL.
result Improved model with fewer parameters, faster convergence, and less hyperparameter tuning.

A new method speeds up option pricing under Heston's stochastic volatility model.

problem Speeding up option pricing under the Heston model.
method Iterative splitting method applied to a two-dimensional PDE.
result The iterative splitting method provides more accurate option prices and Greeks compared to traditional methods.

Deep learning approximates SPDE solutions from noise trajectories.

problem Approximating solutions to stochastic partial differential equations (SPDEs).
method Uses neural networks to approximate SPDE solutions based on noise realizations.
result Accurately estimates SPDE solutions and functionals like mean and variance.

PLoM learns stochastic solutions to PDEs with limited data.

problem Synthesizing solutions to nonlinear PDEs with scarce data.
method Probabilistic Learning on Manifolds constrained by PDEs.
result Learned stochastic solutions minimize PDE residuals.

New method improves training stochastic neural networks with tighter guarantees.

problem Training stochastic neural networks with provable guarantees.
method Developed partially-aggregated estimators and reformulated PAC-Bayesian bounds.
result Derives a differentiable objective leading to tighter generalisation guarantees.

TOFU-POV tackles partially observed linear bandits, achieving sublinear regret with low-dimensional action vectors.

problem Stochastic linear bandits with partially observed actions in settings like recommendation and healthcare.
method TOFU-POV estimates latent action subspace, imputes missing actions, and runs OFUL in low-dimensional coordinates.
result TOFU-POV achieves T\sqrt{T} regret scaling with intrinsic subspace dimension, improving upon natural baselines.

Unified framework models multiple financial and insurance term structures.

problem Modeling multiple term structures in various markets.
method Extended Heath-Jarrow-Morton (HJM) approach under real-world probability.
result Characterization of local martingale deflators and existence of affine realizations.

New method achieves optimal performance without needing problem parameters.

problem Parameter-free stochastic optimization in non-convex and convex settings.
method Simple hyperparameter search technique for non-convex setting, and method with stochastic gradients for convex setting.
result Fully parameter-free methods can outperform state-of-the-art algorithms in both non-convex and convex settings.

This paper constructs Brownian motion on complex flag manifolds and finds joint distribution of stochastic areas.

problem Modeling stochastic areas on complex partial flag manifolds.
method Constructs Brownian motion on complex partial flag manifolds and uses it to find joint distribution of stochastic areas.
result Limit law of stochastic areas is a multivariate Cauchy distribution.

Improved Bayesian neural network inference by selectively removing redundant modes.

problem Redundant modes in Bayesian neural network posteriors complicate approximate inference.
method Structured partial stochasticity and deterministic subset selection of weights.
result Improved performance of approximate inference schemes with simplified posterior distribution.

We construct normed spaces of real-valued functions with controlled growth on possibly infinite-dimensional state spaces such that semigroups of positive, bounded operators (Pt)t0(P_t)_{t\ge 0} thereon with limt0+Ptf(x)=f(x)\lim_{t\to 0+}P_t f(x)=f(x) are in fact strongly continuous. This result applies to prove optimal rates of converge…

2010-11-11abs ↗pdf ↗

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.

Study on hedging and valuation of basis risk in incomplete markets with partial information.

problem Hedging and valuation of European and American claims in an incomplete market with correlated assets and partial information.
method Stochastic control and partial information scenario, forward indifference valuation, dual representation, PDE approach.
result Derivation of optimal hedging strategy and forward indifference price representation for claims.

Investigates optimal PPI strategies to reduce carbon emissions while managing financial risk.

problem Optimizing portfolio insurance strategies to mitigate carbon emissions.
method Modelled risky assets using stochastic factor model with partial information, solved optimization problem using CRRA utility function.
result Optimal carbon penalized PPI strategies reduce carbon emissions without sacrificing financial performance.

We consider the problem of inference in a linear regression model in which the relative ordering of the input features and output labels is not known. Such datasets naturally arise from experiments in which the samples are shuffled or permuted during the protocol. In this work, we propose a framework that treats the un…

2018-04-02abs ↗pdf ↗

These notes were originally written for the Stochastic Analysis Seminar in the Department of Operations Research and Financial Engineering at Princeton University, in February of 2011. The seminar was attended and supported by members of the Research Training Group, with the author being partially supported by NSF gran…

2014-06-07abs ↗pdf ↗