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

Trend · papers per month

90181271361 · Jun 202019922001200920172026
48 results for stochastic deals

We study a notion of good-deal hedging, that corresponds to good-deal valuation for generalized good-deal constraints. Under model uncertainty about the market prices of risk of hedging assets, a robust approach leads to a reduction or even elimination of a speculative component in good-deal hedging, which is shown to …

2016-07-15abs ↗pdf ↗

A simple strategy optimizes broker-client trading, reducing price discounts for informed traders.

problem Optimizing broker-client trading to balance client flow and informed trader losses.
method Modelled as a stochastic control problem, derived optimal strategy in closed form, introduced algorithm.
result Optimal strategy reduces price discounts for informed traders, balancing client flow and informed trader losses.

Consider the stochastic composition optimization problem where the objective is a composition of two expected-value functions. We propose a new stochastic first-order method, namely the accelerated stochastic compositional proximal gradient (ASC-PG) method, which updates based on queries to the sampling oracle using tw…

2016-07-25abs ↗pdf ↗

This paper analyzes adaptive gradient algorithms for better performance in ill-conditioned problems.

problem Poor performance of standard stochastic gradient algorithms in ill-conditioned problems.
method Non-asymptotic analysis of adaptive gradient algorithms (Adagrad and Stochastic Newton) for strongly convex objectives.
result Theoretical analysis and adaptation to practical applications like linear regression and regularized GLM.

The paper analyzes insurance risks using stochastic models.

problem Interest rate and variance risks in unit-linked insurance policies.
method General stochastic volatility models and stochastic interest rates are used to price unit-linked life insurance contracts.
result A perfect hedging strategy is provided and compared with the Black-Scholes model.

Stochastic partition models tailor a product space into a number of rectangular regions such that the data within each region exhibit certain types of homogeneity. Due to constraints of partition strategy, existing models may cause unnecessary dissections in sparse regions when fitting data in dense regions. To allevia…

2016-05-23abs ↗pdf ↗

Neural Processes combine the strengths of neural networks and Gaussian processes to achieve both flexible learning and fast prediction in stochastic processes. However, a large class of problems comprises underlying temporal dependency structures in a sequence of stochastic processes that Neural Processes (NP) do not e…

2019-06-24abs ↗pdf ↗

Proposes a new method to learn operators for stochastic problems using DeepONet with autoencoder.

problem Efficiently solve forward and inverse stochastic problems with limited data.
method MultiAuto-DeepONet, a multi-resolution autoencoder DeepONet model.
result The model effectively handles high-dimensional stochastic inputs and reduces the number of trainable parameters.

Existence of calibrated local stochastic volatility models proven for non-regular coefficients.

problem Existence of calibrated local stochastic volatility models in finance.
method Investigation of McKean--Vlasov equations with minimal continuity assumptions on coefficients, providing existence and propagation of chaos results.
result Existence of calibrated local stochastic volatility models for appropriate stochastic volatility parameters.

We introduce a nonparametric approach for estimating drift and diffusion functions in systems of stochastic differential equations from observations of the state vector. Gaussian processes are used as flexible models for these functions and estimates are calculated directly from dense data sets using Gaussian process r…

2017-02-17abs ↗pdf ↗

We generalize stochastic smoothing for gradient estimation of non-differentiable functions.

problem Gradient estimation for non-differentiable functions.
method Developed a general framework for relaxation and gradient estimation of non-differentiable black-box functions using stochastic smoothing with reduced assumptions.
result Empirically validated the effectiveness of variance reduction strategies for various non-differentiable tasks.

Paper introduces multitask neural networks for efficient stochastic control problems.

problem Infeasibility of simulating state variables in some stochastic control problems.
method Multitask neural networks with dynamic task balancing.
result Multitask neural networks outperform state-of-the-art approaches in derivatives pricing problems.

A non-Bayesian, regression-based or generalized least squares (GLS)-based approach is formally proposed to estimate a class of time-varying AR parameter models. This approach has partly been used by Ito et al. (2014, 2016a,b), and is proven to be efficient because, unlike conventional methods, it does not require Kalma…

2017-07-21abs ↗pdf ↗

New algorithm solves stochastic optimization problems with unknown gradients.

problem Solving nonlinear optimization problems with stochastic objectives and deterministic constraints.
method Adaptive SQP with differentiable exact augmented Lagrangian and stochastic line search.
result Global convergence established for both non-adaptive and adaptive SQP methods.

Stochastic AUC maximization has garnered an increasing interest due to better fit to imbalanced data classification. However, existing works are limited to stochastic AUC maximization with a linear predictive model, which restricts its predictive power when dealing with extremely complex data. In this paper, we conside…

2019-08-28abs ↗pdf ↗

Paper analyzes Scaffold algorithm for federated learning, proving linear speed-up with stochastic gradients.

problem Understanding the impact of stochastic gradients on the Scaffold algorithm's performance.
method Proved linear speed-up in the number of clients using a Markov chain analysis of global parameters and control variates.
result Scaffold achieves linear speed-up in the number of clients up to higher-order terms in the step size, but retains a higher-order bias.

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.

The paper characterizes stochastic incompleteness in Riemannian manifolds.

problem Stochastic incompleteness of Riemannian manifolds and its characterization.
method Characterization through solutions to nonlinear parabolic equations.
result Stochastic incompleteness is equivalent to the nonuniqueness of bounded solutions to certain nonlinear parabolic equations.

New method tackles model uncertainty in stochastic control using Bayesian nonparametrics.

problem Model uncertainty in stochastic control problems.
method Nonparametric Bayesian approach with Dirichlet process for unknown distributions, online learning, and Gaussian process surrogates.
result Demonstrates financial advantages of nonparametric Bayesian over parametric methods.

This paper deals with a natural stochastic optimization procedure derived from the so-called Heavy-ball method differential equation, which was introduced by Polyak in the 1960s with his seminal contribution [Pol64]. The Heavy-ball method is a second-order dynamics that was investigated to minimize convex functions f .…

2016-09-14abs ↗pdf ↗

We analyse a period spanning 35 years of activity in the Sao Paulo Stock Exchange Index (IBOVESPA) and show that the Heston model with stochastic volatility is capable of explaining price fluctuations for time scales ranging from 5 minutes to 100 days with a single set of parameters. We also show that the Heston model …

2004-02-06abs ↗pdf ↗

We present a stochastic-local volatility model for derivative contracts on commodity futures able to describe forward-curve and smile dynamics with a fast calibration to liquid market quotes. A parsimonious parametrization is introduced to deal with the limited number of options quoted in the market. Cleared commodity …

2018-08-29abs ↗pdf ↗

StochasticRank optimizes ranking metrics efficiently and guarantees global convergence.

problem Optimizing discrete ranking metrics due to their ill-posed nature.
method Stochastic smoothing, gradient estimate, debiasing, and Stochastic Gradient Langevin Boosting.
result Global convergence and superior performance on ranking datasets.

A new method improves communication efficiency in distributed learning.

problem Reducing communication overhead in distributed machine learning.
method Transforming contractive compressors into induced unbiased compressors.
result Significant improvements in memory requirements and communication complexity.

Develops trinomial models using cubature methods for financial derivative pricing.

problem Pricing financial derivatives in complex stochastic market models.
method Cubature methods applied to Wiener space for constructing trinomial models.
result Numerical solutions compare favorably with Black-Scholes model.

This paper introduces online algorithms to estimate robust geometric median in large data streams.

problem Detecting outliers in large data sets using robust statistical measures.
method Online stochastic Newton methods for estimating the geometric median.
result Rates of convergence for online estimation of the geometric median.

We define a second-order neural network stochastic gradient training algorithm whose block-diagonal structure effectively amounts to normalizing the unit activations. Investigating why this algorithm lacks in robustness then reveals two interesting insights. The first insight suggests a new way to scale the stepsizes, …

2017-05-25abs ↗pdf ↗

Overview of non-stochastic-gradient SA algorithms in signal processing and ML.

problem Dealing with large data sets and uncertainties in signal processing and machine learning.
method General framework of SA algorithms using Lyapunov functions.
result Unified convergence properties of non-stochastic-gradient algorithms.

Develops a framework to analyze financial structures.

problem Difficulty in systematic analysis, comparison, and verification of financial structures.
method Formalizes financial structures as structured allocation systems with explicit allocation operators.
result Specifies inputs, structural requirements, and feasibility restrictions for financial structures.

Adaptive learning method for stochastic programs with latent uncertainty.

problem Stochastic programming problems with implicitly decision-dependent uncertainty.
method Adaptive learning-based surrogate method integrating simulation and statistical estimates.
result Established non-asymptotic convergence rate analysis for enhanced stability and efficiency.

The incorporation of prior knowledge into learning is essential in achieving good performance based on small noisy samples. Such knowledge is often incorporated through the availability of related data arising from domains and tasks similar to the one of current interest. Ideally one would like to allow both the data f…

2017-05-30abs ↗pdf ↗