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

158317475633 · Jun 202019922001200920172026
48 results for stochastic development

Constructs stochastic processes on sub-Riemannian manifolds using Cartan connections.

problem Developing stochastic processes on sub-Riemannian manifolds.
method Introduces stochastic development using Cartan connections, derives generator, and provides conditions for existence.
result Derives a general expression for the generator of the stochastic process and provides conditions for the existence of a Cartan connection.

We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of Hájek and Le Cam for classical statistical problems. We give complementary optimality results, developing fully online methods that adaptively achieve optimal convergence guarantees. Our…

2016-12-16abs ↗pdf ↗

Paper develops efficient methods for estimating Hessian inverses in stochastic optimization.

problem Estimating the inverse Hessian for convex function minimization.
method Robbins-Monro procedure for recursive estimation of the inverse Hessian.
result Develops universal stochastic Newton methods with improved efficiency.

Develops robust methods for infinite-dimensional stochastic processes.

problem Measuring covariations in stochastic evolution equations in infinite dimensions.
method Asymptotic theory for jump robust measurement of covariations.
result Identifies scaling limits for realized covariations.

Develops minibatch stochastic proximal gradient for large-scale learning models.

problem Finding optimal predictors with complex regularizers in large-scale learning models.
method Minibatch variants of stochastic proximal gradient algorithm for composite objective functions.
result Minibatch size NN after O(1Nε)\mathcal{O}(\frac{1}{Nε}) iterations achieves εε-suboptimality in expected quadratic distance.

The paper analyzes how behavioral investors make portfolio decisions using Markowitz Stochastic Dominance criteria.

problem Understanding how behavioral investors make portfolio decisions.
method Developed stochastic optimization problems and MILP models to capture subjective decision weights and probability weighting functions.
result The developed models can be used to formulate computationally tractable portfolio analysis problems.

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.

We develop stochastic variational inference, a scalable algorithm for approximating posterior distributions. We develop this technique for a large class of probabilistic models and we demonstrate it with two probabilistic topic models, latent Dirichlet allocation and the hierarchical Dirichlet process topic model. Usin…

2012-06-29abs ↗pdf ↗

We review some developments on clustering stochastic processes and come with the conclusion that asymptotically consistent clustering algorithms can be obtained when the processes are ergodic and the dissimilarity measure satisfies the triangle inequality. Examples are provided when the processes are distribution ergod…

2019-08-05abs ↗pdf ↗

Develops RL for dynamic risk assessment in stochastic optimization.

problem Time-consistent risk assessment in stochastic optimization problems.
method Model-free reinforcement learning with dynamic convex risk measures, time-consistent dynamic programming, policy gradient updates, actor-critic neural network optimization.
result Demonstrates optimal policies for statistical arbitrage, financial hedging, and robot control.

Develops methods to simulate option prices for a specific stochastic volatility model.

problem No method exists to compute option prices numerically for a non-martingale jump-type model.
method Develops two Monte Carlo simulation methods under change of measure.
result Conducts numerical experiments to validate the developed methods.

Developed unbiased estimators for Heston model with stochastic interest rates.

problem Estimating the Heston model with stochastic interest rates.
method Combined unbiased estimators with the Heston model and developed a semi-exact log-Euler scheme.
result Convergence rate of O(h)O(h) in the L2L^2 norm for a wide range of models.

Develops a new SPP algorithm with variance reduction for weakly convex optimization.

problem Weakly convex, composite optimization problems.
method Inexact semismooth Newton framework with variance reduction for stochastic proximal point updates.
result Establishes convergence results for the proposed algorithm.

Develops a new solver for optimizing with stochastic dominance constraints.

problem Optimizing with stochastic dominance constraints is computationally expensive and impractical.
method Introduces Light Stochastic Dominance Solver (light-SD) that uses Lagrangian properties and surrogate approximation.
result The light-SD solver demonstrates superior performance on various problems.

Develops a new method for efficient stochastic bilevel optimization.

problem Stochastic bilevel optimization problems in machine learning applications.
method Single-Timescale stochAstic BiLevEl optimization (STABLE) method.
result Achieves the same order of sample complexity as stochastic gradient descent for single-level optimization.

Develops a new method for pricing GMWBs with jumps and stochastic interest rates.

problem Pricing guaranteed minimum withdrawal benefits (GMWBs) with jumps and stochastic interest rates.
method Combines semi-Lagrangian method with Fourier pricing and Green's function.
result Mathematically demonstrates convergence to the viscosity solution of the HJB-QVI.

LASG improves communication efficiency in distributed learning.

problem Efficiently communicating gradients in distributed machine learning.
method Develops a new stochastic gradient descent approach, LASG, that predicts and selects significant communication rounds.
result Achieves communication savings by an order of magnitude in federated learning.

Paper develops a model to assess capital requirement for demographic risk using stochastic methods.

problem Quantifying capital requirement for demographic risk in life insurance contracts.
method Stochastic model extending local GAAP to Solvency II framework, proving market consistency.
result Model highlights main drivers of capital requirement evaluation, comparing to GAAP.

Optimizes liquidity provision intervals for profitable AMM participation.

problem Financial losses from poor liquidity provision intervals and reallocation costs.
method Developed a tractable stochastic optimization problem.
result Computes optimal liquidity provision intervals for profitable liquidity concentration.

A unified analytical pricing framework with involvement of the shot noise random process has been introduced and elaborated. Two exactly solvable new models have been developed. The first model has been designed to value options. It is assumed that asset price stochastic dynamics follows a Geometric Shot Noise motion. …

2014-07-16abs ↗pdf ↗

We propose a stochastic gradient Markov chain Monte Carlo (SG-MCMC) algorithm for scalable inference in mixed-membership stochastic blockmodels (MMSB). Our algorithm is based on the stochastic gradient Riemannian Langevin sampler and achieves both faster speed and higher accuracy at every iteration than the current sta…

2015-10-16abs ↗pdf ↗

Develops a generalized version of Chung's Lemma for stochastic optimization methods.

problem Establishing asymptotic convergence rates for stochastic optimization methods under various step size rules.
method Generalized version of Chung's Lemma for a broader family of step size rules.
result Demonstrates tight non-asymptotic convergence rates for various stochastic methods.

Develops new optimization techniques for decision-making under uncertainty.

problem Decision-making under uncertainty with complex cost functions and nested expectations.
method Introduces Multistage Conditional Compositional Optimization (MCCO) and develops multilevel Monte Carlo techniques.
result New optimization techniques reduce scenario complexity from exponential to polynomial growth.