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

185369554738 · Jun 202019922001200920172026
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.

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 ↗

A new ML algorithm solves complex economic control problems.

problem Solving high-dimensional, finite-horizon stochastic control problems in economics.
method Deep neural network representation of optimal policy functions with three key features.
result Efficiently solves various economic control problems including recursive utility and growth models.

New RL method learns K-step lookahead Q-functions for fixed-horizon MDPs.

problem Challenges in online reinforcement learning for non-episodic, finite-horizon MDPs.
method Introduces a K-step lookahead Q-function with a time-varying threshold for selecting actions.
result Achieves minimax optimal constant regret for K=1 and O(max((K1),CK1)SATlog(T))\mathcal{O}(\max((K-1),C_{K-1})\sqrt{SAT\log(T)}) regret for K ≥ 2.

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)).

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 ↗

Study on BSDEs with random time horizon, focusing on existence and properties.

problem Existence of solutions to BSDEs and reflected BSDEs with a random time horizon.
method Method of reduction and examination of BSDEs with lahdlaug driver.
result Existence of solutions to BSDEs and reflected BSDEs with a random time horizon.

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 ↗

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.

Study optimal consumption with drawdown limits over a fixed time frame.

problem Maximizing utility with consumption limits during a fixed period.
method Extended utility maximization problem with drawdown constraint, using PDE arguments and dual transform.
result Existence and uniqueness of classical solution to HJB variational inequality, with explicit free boundaries.

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.

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 ↗

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 ↗

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.

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.

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 ↗

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 ↗

The paper clarifies long-horizon investment and DCA, showing no risk reduction but different exposure profiles.

problem Misleading claims about reducing risk with longer investment horizons and DCA.
method Unified probabilistic framework, defining risk and uncertainty, and introducing effective investment exposure.
result Different investment timing strategies can lead to distinct exposure profiles over time, affecting risk and uncertainty.

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)}).

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.

New algorithms learn MDPs with better regret bounds using generative sampling.

problem Learning MDPs with optimal policies under uncertainty.
method Hybrid exploration-generative RL model, classical and quantum algorithms.
result Quantum algorithms achieve polylogT\operatorname{poly}\log{T} regret for infinite-horizon MDPs.

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.

Paper identifies reductive MDPs, solving them in polynomial time.

problem Computational hardness of general MDPs and tractability of finite-horizon MDPs.
method Defines reductivity, a new class of SSPs, and develops a polynomial-time solution.
result Optimal policies can be found in polynomial time for reductive SSPs and MDPs.

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 ↗

Firms miscount their customers who stop buying without saying goodbye.

problem Counting non-contractual customers accurately.
method Estimating repeat purchase probabilities and extrapolating to infinite time.
result The count of alive customers is only partially identified, with a wide range of estimates.

In a market with one safe and one risky asset, an investor with a long horizon, constant investment opportunities, and constant relative risk aversion trades with small proportional transaction costs. We derive explicit formulas for the optimal investment policy, its implied welfare, liquidity premium, and trading volu…

2011-08-04abs ↗pdf ↗

This paper improves Thompson Sampling for complex decision-making problems.

problem Learning in infinite-horizon discounted decision processes with unknown parameters.
method Developed a general canonical probability space and new metrics for analyzing adaptive learning algorithms.
result Thompson Sampling achieves complete learning in complex decision-making problems.

New algorithm achieves asymptotically optimal regret without horizon dependence.

problem Horizon-free regret minimization for reinforcement learning.
method Proposes a new algorithm and proves a regret upper bound.
result Regret upper bound of \(\tilde O(\sqrt{SAK} + S^8A^3)\) with failure probability \(\delta\).

Study examines Wang-Yau quasi-local energy in strong fields near apparent horizons.

problem Examining the behavior of Wang-Yau quasi-local energy near apparent horizons in strong fields.
method Analyzing the limit of the Wang-Yau quasi-local energy as a spacelike surface approaches an apparent horizon, considering bounded coordinate functions and spacelike mean curvature.
result The limit of the Wang-Yau quasi-local energy falls into two cases: it blows up or remains finite, depending on whether the horizon can be isometrically embedded into R3R^3.

The paper optimizes portfolios in a financial market with correlated assets using a stochastic volatility model.

problem Optimizing portfolios in a financial market with correlated assets and stochastic volatility.
method Derive a Hamilton-Jacobi-Bellman equation, use approximation methods, analyze value function using expansion of utility function, control error with second-order terms, generate close-to-optimal portfolio.
result Close-to-optimal portfolio generated using first-order approximation of utility function with controlled error.

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 ↗