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

Trend · papers per month

3978116155 · Jun 202019922001200920172026
48 results for state-dependent noise

Study of SGD with state-dependent noise, improving escape from local minima.

problem Understanding and improving the dynamics of SGD in non-convex optimization.
method Formal study on SGD with state-dependent noise, proposing power-law dynamic with state-dependent diffusion.
result Power-law dynamic can escape from sharp minima exponentially faster than flat minima.

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

New method handles complex systems with discontinuous, heavy-tailed noise.

problem Handling discontinuous, heavy-tailed Lévy noise in stochastic systems.
method Developed nonlocal Kramers-Moyal formulas for SDEs with multiplicative Lévy noise.
result Validated framework for discovering interpretable SDE models from data.

We prove quantitative convergence rates at which discrete Langevin-like processes converge to the invariant distribution of a related stochastic differential equation. We study the setup where the additive noise can be non-Gaussian and state-dependent and the potential function can be non-convex. We show that the key p…

2019-07-07abs ↗pdf ↗

Proposes a new framework for optimizing utility with state-dependent benchmarks.

problem Various interpretations of benchmarks in utility functions.
method General framework of state-dependent utility optimization with stochastic benchmarks.
result Provides optimal solutions and addresses issues of well-definedness and feasibility.

Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…

2014-12-18abs ↗pdf ↗

A Hawkes process with state-dependent factor models order flows in limit order books.

problem Modeling order flows in limit order books for better market prediction.
method A Hawkes process with a state-dependent factor for conditional intensity estimation.
result State-dependent formulations improve the fit of LOB models to financial data.

This paper improves credit risk analysis by incorporating state-dependent recovery rates into a factor model.

problem Accurate default forecasting in credit risk analysis.
method Extends a one-factor Gaussian copula model to include state-dependent recovery rates and a common factor.
result The proposed model outperforms other models in default prediction, especially during hectic periods.

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.

Study efficient algorithms for nonconvex optimization with state-dependent Markov data.

problem Stochastic optimization with Markovian data and state-dependent transition kernels.
method Projection-based and projection-free algorithms for constrained nonconvex problems.
result The number of oracle calls to achieve an εε-stationary point is O(1/ε2.5)\mathcal{O}(1/ε^{2.5}).

Stochastic Gradient Descent introduces noise in training, affecting model decision boundaries.

problem Understanding the impact of noise in SGD on model decision boundaries.
method Characterized SGD and persistent SGD dynamics in a neural network model, measuring noise magnitude in both under- and over-parametrized regimes.
result Noisier algorithms lead to wider decision boundaries in constraint satisfaction problems.

The paper defines and characterizes conditional nonlinear expectations.

problem Defining and characterizing conditional nonlinear expectations.
method Embedding in decision theory, using state-dependent preferences, and continuous utility representation.
result Consistent backward conditional projections are characterized by the Sure-Thing Principle.

SGD in DLNs reveals feature learning dynamics.

problem Understanding SGD dynamics in DLNs during saddle-to-saddle training.
method Stochastic Langevin dynamics with anisotropic, state-dependent noise; one-dimensional per-mode SDEs; Boltzmann distribution approximation.
result SGD noise encodes feature learning progression but does not alter saddle-to-saddle dynamics.

Revisits consumption-investment problem with anticipative noise.

problem Revisits classical consumption-investment problem with anticipative noise.
method Models risky-asset returns through a general α-integral, interpolating between Itô, Stratonovich, and related conventions.
result Derives closed-form optimal policies for logarithmic utility and constant volatilities in a market with n risky assets.

Nonlinear SGD achieves high-probability rates in non-convex optimization with heavy-tailed noise.

problem Optimization in non-convex problems with heavy-tailed noise.
method General nonlinear framework for SGD, including symmetrization techniques.
result Achieves O~(t1/2)\widetilde{\mathcal{O}}(t^{-1/2}) rate for heavy-tailed noise.

Most decision theories, including expected utility theory, rank dependent utility theory and cumulative prospect theory, assume that investors are only interested in the distribution of returns and not in the states of the economy in which income is received. Optimal payoffs have their lowest outcomes when the economy …

2013-08-29abs ↗pdf ↗

The paper extends intensity models for limit order books using marked point processes.

problem Modeling intensity ratios in limit order books with state dependency and clustering.
method Developed a new model combining three multiplicative components for marked point processes.
result The new model outperforms other intensity-based methods in predicting market order signs and aggressiveness.

The paper analyzes fill probabilities in limit order books with varying price levels.

problem Determining the likelihood of limit orders being executed in a limit order book.
method Developed a state-dependent stochastic framework to model limit order book dynamics.
result Derived semi-analytical expressions for fill probabilities and mid-price changes.

A new model for forward curves captures behavior through a single equation.

problem Modeling forward curves in a complex function space.
method Developed a stochastic partial differential equation with locally state-dependent coefficients.
result The model retains simplicity while capturing entire forward curve behavior.

New convergence rates for SGD under heavy-tailed noise with infinite variance.

problem Convergence analysis of SGD under heavy-tailed noise with infinite variance.
method Identifying a condition on the Hessian and providing a convergence rate for the distance to the global optimum.
result SGD can converge to the global optimum under heavy-tailed noise with infinite variance.

We develop a new method to estimate failure probabilities in complex systems.

problem Estimating failure probabilities in safety-critical autonomous systems is challenging due to the rarity of failures and large state spaces.
method We propose an adaptive importance sampling algorithm that minimizes forward Kullback-Leibler divergence and uses Markov score ascent methods.
result Our method provides more accurate failure probability estimates than existing techniques.

Neural networks estimate SDEs with jump noise using a Tamed-Milstein scheme.

problem Estimating drift and diffusion functions in SDEs with jump noise.
method Tamed-Milstein scheme with neural networks as non-parametric approximators.
result Flexible estimation of complex nonlinear dynamics in systems with state-dependent noise.

This work extends Tweedie's formulae to non-Gaussian processes for better diffusion model generation.

problem Limited exploration of non-Gaussian diffusion models and corresponding Tweedie's formulae.
method Extended Tweedie's formulae to geometric Brownian motion, squared Bessel, and Cox-Ingersoll-Ross processes.
result Demonstrated potential of non-Gaussian models in image and financial time series generation.

A framework combining HSMM and survival analysis for lifecycle-oriented mobility analysis.

problem Understanding individual metro usage dynamics over multi-year horizons.
method A state-based lifecycle modeling framework integrating HSMM and discrete-time survival analysis.
result Identification of interpretable mobility states, transition dynamics, and state-dependent exit and re-entry processes.

In a dual risk model, the premiums are considered as the costs and the claims are regarded as the profits. The surplus can be interpreted as the wealth of a venture capital, whose profits depend on research and development. In most of the existing literature of dual risk models, the profits follow the compound Poisson …

2015-10-13abs ↗pdf ↗

Innovative extensions to option pricing models using asymmetric Brownian motion and random walk approaches.

problem Capturing empirical phenomena like return skewness, heavy tails, and volatility asymmetry in option pricing models.
method Developing the Geometric Asymmetric Brownian Motion (GABM) within the Bachelier--Black--Scholes--Merton framework.
result Deriving closed-form option pricing formulas and a discrete-time binomial tree algorithm that converges to the GABM limit.

A method for estimating the median of gradients in stochastic optimization.

problem Robust gradient estimation in stochastic optimization for various applications.
method Stochastic Proximal Point Method for median gradient estimation.
result The proposed method can converge even under heavy-tailed, state-dependent noise.

New algorithm speeds up MCMC for complex distributions.

problem Efficient sampling from complex, high-dimensional distributions.
method Numerical Generalized Randomized Hamiltonian Monte Carlo with state-dependent event rates.
result Approximates Hamiltonian trajectories for robust sampling.

The paper solves a consumption-investment problem with state-dependent lower bounds.

problem A life-time consumption-investment problem with a state-dependent lower bound on consumption.
method Transformed the problem into a state-independent control problem to apply standard theory.
result Explicit optimal strategies provided for both homogeneous and non-homogeneous constraints.

New volatility model for option pricing with time-varying risk premium.

problem Volatility risk premium is time-varying and not well captured by existing models.
method Combines Markov switching with Realized GARCH framework to derive a state-dependent pricing kernel.
result The model reduces option pricing errors by 15% or more compared to competing models.

The paper proposes a machine learning approach for state-dependent asset allocation.

problem Market conditions cause performance deviations from long-term averages.
method Analyzes historical market states and asset returns to directly relate state variables to portfolio weights.
result The proposed approach generates a more efficient portfolio compared to traditional methods.

We analyze a new Markov chain model for better sampling and optimization.

problem Developing a new Markov chain model for improved sampling and optimization.
method We introduce a new class of Ito chains with arbitrary noise and inexact drift/diffusion coefficients, proving a bound in W2W_{2}-distance.
result Our analysis provides improved or first results for various applications like SGLD, sampling, and boosting.

Effective and intelligent exploration has been an unresolved problem for reinforcement learning. Most contemporary reinforcement learning relies on simple heuristic strategies such as εε-greedy exploration or adding Gaussian noise to actions. These heuristics, however, are unable to intelligently distinguish the well …

2019-06-17abs ↗pdf ↗

Bitcoin reacts positively to USDT minting but not burning, showing state-dependence.

problem Understanding Bitcoin's response to Tether's supply changes.
method Analyzing Bitcoin's intraday price movements in response to USDT minting and burning events.
result Bitcoin's response to USDT minting events declines after 60 minutes and is influenced by investor sentiment and public announcements.

Measures price impact in order-driven markets without relying on averages.

problem Measuring price impact in order-driven markets without relying on averages.
method Modeling the limit order book using state-dependent Hawkes processes and defining price impact profile as a function of the compensator of a stochastic process.
result The clustering of sell child orders has a bigger impact on price than their sizes.

Safe learning in uncertain systems with state measurements and optimization.

problem Safe learning in nonlinear control-affine systems with unknown additive uncertainty.
method Model uncertainty as Gaussian noise, learn mean and covariance, use optimization to adjust control input.
result Guaranteed safety with arbitrarily large probability while learning and control proceed simultaneously.