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.

169,341 papers · 148 categories

Trend · papers per month

2905798691,158 · Jun 202019922001200920182026
48 results for stochastic target problems

Optimizes target value in stochastic black box functions.

problem Finding input to minimize expected squared error to target value.
method Derives acquisition functions for expected improvement, probability of improvement, and lower confidence bound, assuming Gaussian aleatoric effects.
result Acquisition functions can outperform classical Bayesian optimization under certain conditions.

MT-SGD samples from multiple target distributions using gradient descent.

problem Sampling from multiple unnormalized target distributions.
method Proposes MT-SGD, a flow of intermediate distributions to sample from multiple target distributions.
result Asymptotic analysis shows MT-SGD reduces to multiple-gradient descent for multi-objective optimization.

We study a stochastic game where one player tries to find a strategy such that the state process reaches a target of controlled-loss-type, no matter which action is chosen by the other player. We provide, in a general setup, a relaxed geometric dynamic programming principle for this problem and derive, for the case of …

2012-06-27abs ↗pdf ↗

New approach to control diffusion processes with soft constraints.

problem Finding an optimal diffusion process with a target terminal distribution.
method Generalized Schrödinger bridge problem with soft constraints, solving for a geometric mixture of target and other distributions.
result The terminal distribution of the optimally controlled process is a geometric mixture of the target and another distribution.

This study models target trajectories using stochastic processes for efficient tracking.

problem Efficiently modeling and predicting target trajectories in continuous time.
method Decomposes trajectory modeling into deterministic and stochastic components using Gaussian or Student's-tt processes.
result Demonstrates superior performance in tracking maneuvering targets compared to existing methods.

We solve a complex trade execution problem by simplifying it into a known LQ control problem.

problem Optimal trade execution with stochastic price impact and resilience.
method Extending the problem to progressively measurable processes and reducing it to a LQ stochastic control problem.
result The solution to the LQ problem traces back to the solution of the original trade execution problem.

We show that stochastic interpolation flow maps are Lipschitz with a sharp constant.

problem High dimensional sampling and transport problems.
method Investigating stochastic interpolation flow for generating data samples.
result Stochastic interpolation flow maps are Lipschitz with a sharp constant matching optimal transport maps.

SCSG method optimizes stochastic gradient-based optimization for large-scale problems.

problem Lack of adaptability between theoretical optimality and practical applicability in stochastic gradient-based optimization.
method SCSG method with batch variance reduction and geometrization technique.
result SCSG achieves strictly better theoretical complexity and is adaptive to both strong convexity and target accuracy.

Study hedging covered options with linear impact and gamma constraint.

problem Hedging covered options with linear market impact and gamma constraint.
method Stochastic target and partial differential equation smoothing techniques.
result Super-replication price is viscosity solution of a fully non-linear parabolic equation.

This work introduces a new method for coupling base and target densities in generative models.

problem Generating samples from complex target distributions using simple base distributions.
method Developed a framework of stochastic interpolants with data-dependent couplings.
result Constructing dynamical transport maps that serve as conditional generative models.

We extend the stochastic Perron method to analyze the framework of stochastic target games, in which one player tries to find a strategy such that the state process almost surely reaches a given target no matter which action is chosen by the other player. Within this framework, our method produces a viscosity sub-solut…

2014-08-28abs ↗pdf ↗

Optimal asset allocation strategy outperforms stochastic benchmark.

problem Achieving higher terminal wealth than a stochastic benchmark.
method Data-driven Neural Network optimization framework for dynamic asset allocation.
result Optimal adaptive strategy outperforms benchmark with higher median and right-skewed terminal wealth.

Method optimizes diffusion model generation to meet user preferences.

problem Optimizing diffusion model generation with only black-box target scores.
method Covariance-adaptive sequential optimization algorithm for black-box optimization.
result Proves superior performance in achieving better target scores.

New method for sampling from complex distributions using stochastic localization.

problem Sampling from unnormalized target densities in multi-modal distributions.
method Stochastic Localization via Iterative Posterior Sampling (SLIPS) framework.
result Approximate samples from target distribution and denoiser learned iteratively.

Improved loss scaling for stochastic momentum algorithms in high dimensions.

problem Improving loss scaling for stochastic momentum algorithms in high dimensions.
method Dimension-adapted Nesterov acceleration (DANA) scales momentum hyperparameters based on model size and data complexity.
result DANA improves loss scaling exponents across various data and target complexities.

Proposes a new method for probabilistic forecasting using stochastic interpolants and Föllmer processes.

problem Probabilistic forecasting of dynamical systems.
method Generative modeling and stochastic interpolants to map current state to probabilistic ensemble of forecasts.
result The approach can be used to forecast complex, high-dimensional systems like Navier-Stokes and video sequences.

Study optimizes trading in multiple assets with cross-effects.

problem Optimizing trade execution in multiple assets with cross-impact effects.
method Formulated as a stochastic control problem, extended to progressively measurable controls, solved using linear-quadratic control theory.
result Cross-hedging effects can be optimal, e.g., trading in an asset without an initial position.

This paper analyzes how periodic and soft target updates stabilize linear Q-learning.

problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.

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.

New method samples from multi-modal distributions on Riemannian manifolds without training.

problem Sampling from multi-modal distributions on Riemannian manifolds is challenging.
method Simulation of a non-equilibrium deterministic dynamics to transport noise toward target distributions.
result Method is entirely training-free and effective on various multi-modal problems.

Unified framework for training diffusion and flow models to sample from target distributions.

problem Training diffusion and flow models to sample from target distributions defined by exponential tilting.
method Unified framework combining stochastic optimal control and non-equilibrium thermodynamics perspectives.
result Unified bias-variance decompositions and theoretical support for adjoint-based methods.

Investor aims to meet financial goals with deadlines and target amounts, considering stock trading costs.

problem Goal-based portfolio selection with fixed transaction costs.
method Stochastic Perron's method to show value function is unique viscosity solution to quasi-variational inequalities. Existence of optimal strategy established.
result Optimal trading strategy differs significantly from frictionless case, revealing complex regions and strategies.

Investment strategies in occupational pension plans are optimized for non-tradable income risk.

problem Optimizing investment strategies for occupational pension plans in the presence of non-tradable income risk.
method Formulated as a stochastic optimization problem, analyzed in both constant and stochastic volatility environments.
result Random contributions induce the optimal glide path structure, influenced by initial wealth, contributions, and risk aversion.

Method estimates posterior model for boundary value problems with uncertain constraints.

problem Estimating posterior probability model for stochastic boundary value problems with uncertain constraints.
method Probabilistic learning inference using Kullback-Leibler divergence and MCMC.
result Method successfully estimates posterior probability measure with constraints.

Review of quantile regression methods for stochastic computer experiments.

problem Quantile regression in stochastic computer experiments.
method Six metamodels categorized by order statistics, functional approaches, and Bayesian methods tested on various problems.
result Metamodels reveal good contrasts, providing guidelines for selecting the best method.

Paper analyzes SGHMC for non-convex optimization with discontinuous gradients.

problem Training neural networks with ReLU activation.
method Non-asymptotic convergence analysis of SGHMC with discontinuous gradients.
result Explicit upper bounds for expected excess risk in non-convex optimization.

New algorithm finds local minima in non-convex problems efficiently.

problem Finding local minima in non-convex finite-sum minimization problems.
method Stochastic Trust Region (STR) algorithm combining inexact gradient and Hessian estimation.
result STR finds (ε,ε)(ε, \sqrtε)-approximate local minimum with improved efficiency.

Averaged SGD achieves optimal convergence rate for neural networks in the NTK regime.

problem Convergence analysis of averaged stochastic gradient descent for neural networks.
method Analyzed convergence of averaged stochastic gradient descent for overparameterized two-layer neural networks.
result Achieved minimax optimal convergence rate with global convergence guarantee.

GenFormer uses deep learning to generate complex stochastic data.

problem Creating synthetic stochastic data that matches real-world statistical properties.
method Transformer-based deep learning model that maps Markov state sequences to time series values.
result GenFormer preserves target marginal distributions and other statistical properties in multivariate spatio-temporal data.

Unified physics-informed GANs solve stochastic differential equations with limited data.

problem Solving stochastic differential equations with sparse sensor data.
method Physics-informed generative adversarial networks (PI-GANs) with stochastic differential equations (SDEs) encoding.
result PI-GANs accurately approximate and solve SDEs up to 30 dimensions.

Federated Learning with L0 constraint improves sparsity and performance.

problem Inherent sparsity in data and models leads to dense models with poor generalizability.
method L0 constraint on model density achieved through probabilistic gates and federated stochastic gradient descent.
result Achieves target sparsity (rho) in FL with minimal loss in statistical performance.

This work analyzes how often to update the target network in Q-learning.

problem Understanding the optimal frequency of target network updates in Q-learning.
method Formulated target updates as a nested optimization scheme, derived finite-time convergence analysis.
result Optimal target update frequency increases geometrically over time.

New adaptive stepsize method for stochastic approximation converges to target point.

problem Finding optimal step sizes for stochastic approximation algorithms.
method Adaptive block-coordinate stepsizes using online estimates of second moment.
result New method converges almost surely to a small neighborhood of the target point.

Study bond market making with hit-ratio target using optimal control and HJB equations.

problem Optimizing bond market making with hit-ratio target in OTC markets.
method Stochastic optimal control approach, dualizing hit-ratio target, HJB equation, Riccati equation, linearization.
result Explicit quote decompositions into riskless spread, inventory-risk correction, and hit-ratio correction.

Central bank strategy to maintain currency exchange rate within limits.

problem Maintaining a currency exchange rate within a target zone despite adverse economic trends.
method Modeling the problem with a continuous-time market impact model and solving it as a stochastic control problem.
result Optimal strategy minimizes accumulated inventory of foreign currency.