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

20395978 · May 202619922001200920172026
48 results for finite-time horizon

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.

Optimal reinsurance and dividend strategy for insurance companies in a finite time.

problem Maximizing dividends while managing risk in a finite time horizon.
method Dynamic control problem with Hamilton-Jacobi-Bellman equation, penalty approximation method.
result Smoothness of the value function and comparison principle for its gradient.

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

Developed LQ MFG theory with common noise, proving existence and uniqueness.

problem Linear-quadratic mean field games with common noise.
method Coupled forward-backward stochastic evolution equations (FBSEEs) in Hilbert spaces.
result Existence and uniqueness of solutions for small and arbitrary finite time horizons.

In this paper, we investigate dynamic optimization problems featuring both stochastic control and optimal stopping in a finite time horizon. The paper aims to develop new methodologies, which are significantly different from those of mixed dynamic optimal control and stopping problems in the existing literature, to stu…

2014-06-26abs ↗pdf ↗

Paper analyzes convergence of dynamic policy gradient for MDPs, improving performance in finite-time problems.

problem Optimal policies in finite-time MDPs are not stationary and require epoch-specific training.
method Introduces dynamic policy gradient combining dynamic programming and policy gradient, analyzes convergence for softmax parametrisation.
result Dynamic policy gradient training exploits finite-time structure, leading to better convergence bounds.

The paper studies the question of whether the classical mirror and synchronous couplings of two Brownian motions minimise and maximise, respectively, the coupling time of the corresponding geometric Brownian motions. We establish a characterisation of the optimality of the two couplings over any finite time horizon and…

2013-04-07abs ↗pdf ↗

I introduce and analyse an anytime version of the Optimally Confident UCB (OCUCB) algorithm designed for minimising the cumulative regret in finite-armed stochastic bandits with subgaussian noise. The new algorithm is simple, intuitive (in hindsight) and comes with the strongest finite-time regret guarantees for a hori…

2016-03-29abs ↗pdf ↗

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's value to be continuous with respect to the time horizon are obtained using recent …

2014-11-17abs ↗pdf ↗

We characterise the value function of the optimal dividend problem with a finite time horizon as the unique classical solution of a suitable Hamilton-Jacobi-Bellman equation. The optimal dividend strategy is realised by a Skorokhod reflection of the fund's value at a time-dependent optimal boundary. Our results are obt…

2016-09-06abs ↗pdf ↗

An optimal algorithm for multi-armed bandits with constraints.

problem Optimizing decisions in constrained multi-armed bandit problems.
method An index-based deterministic algorithm using Locatelli's anytime thresholding under known optimal value assumption.
result The algorithm achieves asymptotic optimality with probability approaching 1.

We consider the problem of portfolio optimization in a simple incomplete market and under a general utility function. By working with the associated Hamilton-Jacobi-Bellman partial differential equation (HJB PDE), we obtain a closed-form formula for a trading strategy which approximates the optimal trading strategy whe…

2016-11-28abs ↗pdf ↗

This paper examines the value of a cancellable European option in a finite time horizon setting. The specifications of this generalized European option allow the seller to cancel the option at any point in time for a fixed penalty paid directly to the holder. Here, we provide an explicit valuation formula for the Europ…

2013-04-22abs ↗pdf ↗

Deep neural nets approximate random dynamical system trajectories uniformly in time.

problem Approximating trajectories of random dynamical systems over infinite time horizons.
method Recurrent neural networks with simple feedback structures.
result Certain random trajectories can be approximated uniformly in time to any desired accuracy.

A new Bayesian method optimizes time-dependent expensive functions with lookahead.

problem Maximizing a time-dependent, expensive oracle with limited evaluations.
method Recursive, two-step lookahead expected payoff (r2LEY) acquisition function.
result r2LEY outperforms myopic methods in synthetic and real-world datasets.

New Thompson sampling algorithm reduces regret for exponential family bandits.

problem Minimizing regret in multi-armed bandit problems with exponential family rewards.
method Proposes ExpTS and ExpTS+^+ algorithms using novel sampling distributions.
result Minimizes both finite-time and asymptotic regret for exponential family rewards.

Study on fake stationary Volterra Heston model for non-stationary processes.

problem Non-stationary nature of true Volterra equations.
method Weak notion of stationarity (fake stationary regime) for inhomogeneous affine Stochastic Volterra equations.
result Existence of limiting distributions in the long run, which may depend on initial state.

Kernel-UCBVI algorithm balances exploration and exploitation in metric state-action spaces.

problem Exploration-exploitation dilemma in finite-horizon reinforcement learning with metric state-action spaces.
method Kernel-UCBVI, leveraging smoothness and kernel estimators of rewards and transitions.
result First regret bound for kernel-based RL using smoothing kernels, O(H3K2d/(2d+1))O(H^3 K^{2d/(2d+1)}).

In this paper, we obtain analytical expression for the distribution of the occupation time in the red (below level 00) up to an (independent) exponential horizon for spectrally negative Lévy risk processes and refracted spectrally negative Lévy risk processes. This result improves the existing literature in which only…

2019-03-09abs ↗pdf ↗

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

Optimizes portfolio in volatile markets with jumps, providing accurate formulas.

problem Optimizing wealth in a volatile financial market with jumps.
method Analyzes an incomplete stochastic volatility model, derives closed-form portfolio formulas using HJB equation and super-solution/sub-solution.
result Proves accuracy of derived portfolio formulas for both small and finite time horizons.

In this paper we consider a variation of the Merton's problem with added stochastic volatility and finite time horizon. It is known that the corresponding optimal control problem may be reduced to a linear parabolic boundary problem under some assumptions on the underlying process and the utility function. The resultin…

2015-05-10abs ↗pdf ↗

We use probabilistic methods to characterise time dependent optimal stopping boundaries in a problem of multiple optimal stopping on a finite time horizon. Motivated by financial applications we consider a payoff of immediate stopping of "put" type and the underlying dynamics follows a geometric Brownian motion. The op…

2014-07-25abs ↗pdf ↗

We consider a finite-horizon multi-armed bandit (MAB) problem in a Bayesian setting, for which we propose an information relaxation sampling framework. With this framework, we define an intuitive family of control policies that include Thompson sampling (TS) and the Bayesian optimal policy as endpoints. Analogous to TS…

2019-02-12abs ↗pdf ↗

Inspired by recent work of P.-L. Lions on conditional optimal control, we introduce a problem of optimal stopping under bounded rationality: the objective is the expected payoff at the time of stopping, conditioned on another event. For instance, an agent may care only about states where she is still alive at the time …

2019-01-17abs ↗pdf ↗

We explicitly solve the nonlinear PDE that is the continuous limit of dynamic programming of \emph{expert prediction problem} in finite horizon setting with N=4N=4 experts. The \emph{expert prediction problem} is formulated as a zero sum game between a player and an adversary. By showing that the solution is $\mathcal{C…

2019-11-22abs ↗pdf ↗

Algorithm converges to Nash equilibria in competitive games.

problem Finding Nash equilibria in decentralized, competitive Markov games.
method Decentralized Optimistic Gradient Descent/Ascent with a critic.
result Converges to the set of Nash equilibria under self-play.