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

Trend · papers per month

2.8%5.5%8.3%11.1% · Jun 202319922001200920182026
48 results for random time-horizon

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.

Study optimal stopping for American call options with random time-horizon in Lévy models.

problem Optimal stopping of American call options in random time-horizon under Lévy models.
method Model random time-horizon as Omega default clock, analyze value function under different qq and yy.
result Different values of qq and yy lead to various optimal strategies (up-crossing, two-sided exit).

Optimizes investment under uncertain time horizons with non-concave utility.

problem Optimizing investment decisions with non-concave utility and uncertain time horizons.
method Established necessary and sufficient conditions for optimality, suggested recursive procedure for non-concave utility.
result Optimal investment strategies under uncertain time horizons exhibit multimodal distribution, indicating flexibility in switching between local maximizers.

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.

Improved algorithm for optimal stopping problems reduces runtime.

problem Optimal stopping problems with infinite time horizon and random discounting.
method Flexible forward improvement iteration with a variable look-ahead distance.
result The new algorithm converges and can significantly reduce runtime.

Study optimal portfolios in a non-Markovian regime-switching model with random time horizon.

problem Optimal portfolio selection in a market with non-Markovian regime-switching and random time horizon.
method Formulated as a constrained stochastic linear-quadratic optimal control problem, derived closed-form expressions for optimal portfolios and efficient frontier.
result Closed-form expressions for optimal portfolios and efficient frontier derived under non-Markovian regime-switching and random time horizon.

The paper proposes confidence horizons for anytime-valid inference with finite time constraints.

problem The need for stopping experiments early with valid inference under finite time horizons.
method Confidence horizons as large-sample confidence sequences or group sequential repeated confidence intervals.
result It is possible to obtain sharper large-sample anytime-valid inference by forgoing validity beyond a finite time horizon.

The paper finds the shortest time to exploit arbitrage in multi-stock markets.

problem Finding the shortest time to exploit arbitrage in multi-stock markets.
method Characterizes the minimal time horizon for relative arbitrage in markets with 2 to 3 stocks and uses geometric flows for markets with 4 or more stocks.
result Explicit computation of minimal time horizon for 2 and 3 stocks markets, and characterization via geometric flows for markets with 4 or more stocks.

We find a simple strategy approximating optimal portfolio for short time horizons.

problem Optimizing portfolios in incomplete markets with general utility functions.
method Closed-form formula derived from HJB PDE, approximated by sub- and super-solutions.
result Approximation formula for optimal trading strategy is accurate for small time horizons.

This paper studies the utility maximization problem with changing time horizons in the incomplete Brownian setting. We first show that the primal value function and the optimal terminal wealth are continuous with respect to the time horizon TT. Secondly, we exemplify that the expected utility stemming from applying th…

2010-06-25abs ↗pdf ↗

The paper analyzes optimal retirement timing considering age-dependent mortality risk.

problem Optimal retirement timing under age-dependent mortality risk.
method Formulated as a stochastic control and optimal stopping problem, transformed into a finite time horizon, three-dimensional degenerate optimal stopping problem.
result Existence of an optimal retirement boundary, characterized as a unique solution to a nonlinear integral equation.

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 exit strategies of CPT gamblers in unfair gambles

problem Optimal exit strategies of gamblers with CPT preferences in games with strictly negative expected payoffs
method Formulating the problem as an optimal stopping problem on asymmetric random walks, applying geometric transformation, randomized strategies, and changing the decision variable
result The unfair problem in the infinite time horizon has finite values for a wide range of CPT parameter specifications

Using high frequency data, we have studied empirically the change of volatility, also called volatility derivative, for various time horizons. In particular, the correlation between the volatility derivative and the volatility realized in the next time period is a measure of the response function of the market particip…

2001-05-08abs ↗pdf ↗

A new linear contextual bandit algorithm with improved regret bound.

problem Efficiently solving linear contextual bandit problems with reduced regret.
method Proposes a novel estimator embedded with exploration and a self-normalized bound.
result Regret bound matches lower bound of Ω(dT)Ω(\sqrt{dT}) up to logarithmic factors.

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.

This study examines how investor sentiment's predictive power varies with stock characteristics over different time horizons.

problem Investor sentiment's predictive effect on stock returns varies with stock characteristics and time horizon.
method Granger causality analysis in the frequency domain.
result Investor sentiment has varying predictability lengths (short vs. long) for different stock characteristics.

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 ↗

LinMED is a new linear bandit algorithm with near-optimal regret bound.

problem Optimizing decision-making in linear bandit problems with sub-Gaussian distributions.
method LinMED is a randomized linear bandit algorithm with closed-form arm sampling probabilities.
result LinMED achieves a near-optimal regret bound of dnd\sqrt{n} up to logarithmic factors.

We solve explicitly a two-dimensional singular control problem of finite fuel type for infinite time horizon. The problem stems from the optimal liquidation of an asset position in a financial market with multiplicative and transient price impact. Liquidity is stochastic in that the volume effect process, which determi…

2016-03-21abs ↗pdf ↗

The capitalization-weighted total relative variation i=1d0μi(t)dlogμi(t)\sum_{i=1}^d \int_0^\cdot μ_i (t) \mathrm{d} \langle \log μ_i \rangle (t) in an equity market consisting of a fixed number dd of assets with capitalization weights μi()μ_i (\cdot) is an observable and nondecreasing function of time. If this observable of the market …

2016-08-22abs ↗pdf ↗

New algorithm optimizes noisy, potentially corrupted functions.

problem Optimizing unknown functions with noisy bandit feedback, especially when evaluations are corrupted.
method Fast-Slow GP-UCB algorithm, combining robust and non-robust evaluations, enlarged confidence bounds.
result Theoretical analysis upper bounds cumulative regret, showing dependencies on corruption level and kernel.

Optimal strategies are found for a repeated betting game using diffusion approximation.

problem Finding optimal strategies for a repeated betting game with i.i.d. outcomes.
method Constructing a diffusion approximation of the repeated game and analyzing the wealth share process.
result Necessary and sufficient conditions for the wealth share process to be transient or recurrent are derived.

Risk measures applied to dynamic Markov processes with varying risk aversion.

problem Investigating dynamic risk measures in Markov decision processes with varying risk aversion.
method Distributional viewpoint on law-invariant convex risk measures, applied to Markov decision processes with latent costs and random actions.
result Existence of optimal policies in finite and infinite time horizons 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 ↗

New MAB model incentivizes user arm-pulling with self-reinforcing preferences.

problem Balancing exploration and exploitation in recommender systems with incentivized user preferences.
method Proposes a new MAB model with random arm selection and two policies: At-Least-nn Explore-Then-Commit and UCB-List.
result Achieves O(logT)O(log T) expected regret and O(logT)O(log T) expected payment over a time horizon TT.