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

155310464619 · Jun 202019922001200920172026
48 results for nonlinear stochastic approximation

Method solves complex optimization problems with high probability bounds.

problem Nonlinear equality constrained stochastic optimization problems.
method Step-search sequential quadratic programming method.
result High-probability bound on iteration complexity for first-order stationarity.

Study on statistical inference for nonlinear stochastic approximation with Markovian data.

problem Statistical inference for nonlinear stochastic approximation algorithms with Markovian data.
method Established a functional central limit theorem for the partial-sum process of the target parameter estimate, providing asymptotic pivotal statistics for constructing confidence intervals.
result Valid and efficient asymptotic inference method for nonlinear stochastic approximation algorithms with Markovian data.

We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.

problem Achieving decoupled convergence in nonlinear two-time-scale stochastic approximation.
method Nested local linearity assumption, suitable step size selection, convergence analysis of matrix cross term, fourth-order moment convergence rates.
result Finite-time decoupled convergence rates can be achieved in nonlinear two-time-scale stochastic approximation with proper step size selection.

Enhances RSCNs with hybrid regularization for nonlinear dynamics.

problem Modeling nonlinear dynamic systems with uncertainties.
method Recurrent stochastic configuration networks with hybrid regularization.
result The method outperforms other models in nonlinear system identification and industrial tasks.

DeepRSCN models nonlinear systems using stochastic configurations.

problem Modeling nonlinear dynamic systems efficiently.
method Incrementally constructed deep reservoir computing framework with random parameters and online weight updates.
result DeepRSCN outperforms single-layer networks in efficiency, learning, and generalization.

Stochastic VB improves nonlinear model inference speed and accuracy.

problem Bayesian inference of nonlinear models from noisy data.
method Stochastic Variational Bayesian (VB) inference for nonlinear models.
result Stochastic VB achieves comparable parameter recovery to analytical solution but is faster.

Two single-timescale algorithms improve TD learning with nonlinear approximations.

problem Optimizing TD learning with nonlinear smooth function approximation.
method Proposes two single-timescale single-loop algorithms with momentum and variance reduction.
result Achieves O(ε4)O(\varepsilon^{-4}) sample complexity for the first algorithm and O(ε3)O(\varepsilon^{-3}) for the second.

Develops a framework for learning nonlinear operators using Mercer kernels.

problem Learning nonlinear operators between infinite-dimensional spaces.
method Stochastic approximation framework with Mercer operator-valued kernels.
result Establishes dimension-free polynomial convergence rates for nonlinear operator learning.

Stochastic approximation proves asymptotic normality for non-smooth problems.

problem Solving non-smooth stochastic approximation problems.
method Stochastic approximation algorithms for solving smooth equations, extended to non-smooth problems.
result Asymptotic normality and optimality in non-smooth stochastic approximation is proven.

High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number …

2017-09-18abs ↗pdf ↗

New deep learning method solves complex BSDEs efficiently.

problem Solving high-dimensional nonlinear BSDEs.
method Reformulate as global optimization, approximate solution with deep neural network, globally minimize quadratic local loss functions.
result Demonstrated effectiveness on various high-dimensional nonlinear BSDEs, including finance applications.

We analyze SA with Markovian data and nonlinear updates, overcoming prior limitations.

problem Analyzing stochastic approximation with Markovian data and nonlinear updates.
method Fine-grained analysis of SA iterates and Markovian data, leveraging smoothness and recurrence properties.
result Established weak convergence and precise asymptotic bias of SA iterates.

A novel model uses ODE-based random features to model nonlinear dynamical systems.

problem Modeling highly nonlinear dynamical systems with uncertainty quantification.
method Compositions of physics-informed random features derived from ODEs, combined with deep Gaussian processes and approximate Bayesian inference.
result The model effectively captures nonlinear behavior in real-world multivariate time series data and achieves comparable performance to other models on benchmark tasks.

In this paper, we propose the uncertain volatility models with stochastic bounds. Like the regular uncertain volatility models, we know only that the true model lies in a family of progressively measurable and bounded processes, but instead of using two deterministic bounds, the uncertain volatility fluctuates between …

2017-02-16abs ↗pdf ↗

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.

The paper develops time-uniform inference methods for stochastic approximation parameters.

problem Statistical inference for parameters in stochastic approximation problems.
method Analysis of averaged iterates convergence rates and construction of asymptotic confidence sequences.
result Valid asymptotic confidence sequences for parameters in stochastic approximation problems.

New method for separating mixed signals with nonlinear functions.

problem Recovering source signals from nonlinear mixtures.
method Optimisation-based function approximation to minimize mutual statistical dependence.
result The method can recover source signals from nonlinear mixtures under certain conditions.

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.

New algorithms reduce complexity for solving nonconvex optimization problems with stochastic objectives and constraints.

problem Solving nonconvex optimization problems with stochastic objectives and constraints.
method Single-loop quadratic penalty and augmented Lagrangian algorithms with variance reduction techniques.
result Achieved best-known complexity guarantees for solving nonconvex optimization problems with stochastic objectives and constraints.

Quantum machine learning solves high-dimensional PDEs with lower variance and improved accuracy.

problem Approximating solutions to high-dimensional parabolic PDEs.
method Pure Variational Quantum Circuit (VQC) for BSDE approximation, using temporal discretization and Monte Carlo simulation.
result VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes.

Framework predicts nonlinear system responses using GFDT and generative models.

problem Predicting higher-order moments of nonlinear stochastic systems to small perturbations.
method Combining GFDT with generative modeling to estimate score function directly from data.
result Accurately captures nonlinear and non-Gaussian features of system responses.

Zap Q-learning is a recent class of reinforcement learning algorithms, motivated primarily as a means to accelerate convergence. Stability theory has been absent outside of two restrictive classes: the tabular setting, and optimal stopping. This paper introduces a new framework for analysis of a more general class of r…

2019-10-11abs ↗pdf ↗

New algorithm learns Koopman operator online, with complexity control and convergence guarantees.

problem Online learning of Koopman operator for general nonlinear systems.
method Sparse online learning via stochastic approximation, RKHS action, CME operator.
result Provably convergent algorithm with finite-time guarantees in mis-specified setting.

D2SRM solves complex PDEs using deep learning.

problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.

Unified framework for analyzing batch updating methods with noisy gradients.

problem Analyzing convergence of batch updating methods with noisy gradients and approximations.
method Unified framework using convergence of stochastic processes.
result Establishes a general theorem for most known convergence results.

Paper presents a new backward deep BSDE method for solving nonlinear FBSDE problems.

problem Nonlinear Forward Backward Stochastic Differential Equations (FBSDE) with terminal conditions.
method Backward deep BSDE method applied to FBSDE with nonlinear generators and random initial conditions.
result Derives exact and Taylor-based approximations for time-stepping nonlinear BSDEs.

A new algorithm solves high-dimensional nonlinear BSDEs efficiently.

problem Solving high-dimensional nonlinear backward stochastic differential equations (BSDEs).
method Transformed BSDE into a differential deep learning problem using Malliavin calculus. Discretized integrals using Euler-Maruyama method. Approximated solution with three deep neural networks. Optimized parameters using a differential learning loss function.
result Our algorithm is more accurate and faster than other methods.

We propose the use of statistical emulators for the purpose of valuing mortality-linked contracts in stochastic mortality models. Such models typically require (nested) evaluation of expected values of nonlinear functionals of multi-dimensional stochastic processes. Except in the simplest cases, no closed-form expressi…

2015-08-03abs ↗pdf ↗

Paper analyzes CLT for TTSA with Markovian noise, broadening its applications.

problem Analyzing asymptotic behavior of TTSA under Markovian noise.
method Central Limit Theorem applied to TTSA with Markovian noise.
result Uncovered coupled dynamics of TTSA influenced by Markov chain.

LatentFlow simplifies conditioning of stochastic processes without training.

problem Intractable conditional laws for complex stochastic models.
method Writing stochastic process as latent innovation, reducing conditioning to latent-space inference.
result Exact conditional sampling across various model classes.

Study efficient convergence of RL algorithm with function approximation.

problem Convergence of actor-critic algorithm with nonlinear function approximation.
method Stochastic gradient descent ascent with adaptive proximal term, Polyak-Łojasiewicz condition.
result First efficient convergence result with rate of O(sqrt{ln(N d G^2) / N}).

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.

In this paper, we study the stochastic combinatorial multi-armed bandit (CMAB) framework that allows a general nonlinear reward function, whose expected value may not depend only on the means of the input random variables but possibly on the entire distributions of these variables. Our framework enables a much larger c…

2016-10-20abs ↗pdf ↗