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

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920182026
48 results for random stopping time

This paper extends results of Mortimer and Williams (1991) about changes of probability measure up to a random time under the assumptions that all martingales are continuous and that the random time avoids stopping times. We consider locally absolutely continuous measure changes up to a random time, changes of probabil…

2013-09-24abs ↗pdf ↗

Existence of strong randomized equilibria in mean-field games with common noise.

problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.

The paper analyzes log-optimal and numéraire portfolios in market models stopped at random times.

problem Analyzing portfolios in market models stopped at random times.
method Progressive enlargement of flow of information with the random stopping time, studying log-optimal and numéraire portfolios.
result Computations of log-optimal and numéraire portfolios described in terms of observable parameters.

In the standard models for optimal multiple stopping problems it is assumed that between two exercises there is always a time period of deterministic length δδ, the so called refraction period. This prevents the optimal exercise times from bunching up together on top of the optimal stopping time for the one-exercise c…

2012-05-09abs ↗pdf ↗

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.

This paper addresses the question of how an arbitrage-free semimartingale model is affected when stopped at a random horizon. We focus on No-Unbounded-Profit-with-Bounded-Risk (called NUPBR hereafter) concept, which is also known in the literature as the first kind of non-arbitrage. For this non-arbitrage notion, we ob…

2013-10-04abs ↗pdf ↗

The paper tackles optimal stopping problems using reinforcement learning and singular control.

problem Continuous-time and state-space optimal stopping problems.
method Formulated as a singular control problem with randomized stopping times and penalized cumulative residual entropy.
result Identified unique optimal exploratory strategy through dynamic programming.

Study optimal stopping in random exploration, deriving HJB and designing a reinforcement learning algorithm.

problem Optimal stopping problem in continuous time with random exploration.
method Transformed optimal stopping to optimal control problem, derived HJB equation, designed reinforcement learning algorithm.
result Convergence rate of policy iteration and comparison to classical optimal stopping.

Solves optimal stopping problem with Poisson constraints using jumps.

problem Optimal stopping with Poisson constraints and jumps.
method Penalized backward stochastic differential equation (PBSDE) with jumps, decomposition method based on Jacod-Pham, comparison theorem of BSDEs with jumps.
result Solves American option pricing in nonlinear markets with Poisson constraints.

Analyzes Lévy flights on manifolds for finding small targets.

problem Finding small targets using Lévy flights on various manifolds.
method Analytic description of Lévy flights on closed Riemannian manifolds, including asymptotics of expected stopping time.
result Computes the expected time for finding a small target by Lévy flight on surfaces.

Early stopping is a well known approach to reduce the time complexity for performing training and model selection of large scale learning machines. On the other hand, memory/space (rather than time) complexity is the main constraint in many applications, and randomized subsampling techniques have been proposed to tackl…

2015-10-19abs ↗pdf ↗

We analyze an optimal stopping problem with random maturity under a nonlinear expectation with respect to a weakly compact set of mutually singular probabilities P\mathcal{P}. The maturity is specified as the hitting time to level 00 of some continuous index process at which the payoff process is even allowed to have…

2015-05-28abs ↗pdf ↗

Study optimal stopping times under regime-switching models with constraints.

problem Optimal stopping times for discounted payoffs on a regime-switching geometric Brownian motion.
method Solve variational inequality to find value functions and optimal thresholds.
result Existence and expressions of optimal stopping times under specific conditions.

Given an initial (resp., terminal) probability measure μμ (resp., νν) on Rd\mathbb{R}^d, we characterize those optimal stopping times ττ that maximize or minimize the functional EB0Bτα\mathbb{E} |B_0 - B_τ|^α, α>0α> 0, where (Bt)t(B_t)_t is Brownian motion with initial law B0μB_0\sim μ and with final distribution --once stop…

2017-11-08abs ↗pdf ↗

Random matrix theory explains transient signal detectability in early-stopped gradient flow.

problem Transient signal detectability in early-stopped gradient flow.
method Random matrix theory applied to gradient flow in a linear teacher-student setting.
result Transient Baik-Ben Arous-Péché (BBP) transition in learning dynamics due to anisotropy and noise.

Optimal policy for early stopping improves black-box optimization efficiency.

problem Finding the best algorithm and hyperparameters for complex tasks.
method Bayesian approach to adaptively restart algorithms based on run-so-far features.
result Up to 13x improvement in expected time to reach target accuracy over random search.

New method uses neural networks for optimal stopping time problems.

problem Optimal stopping time problems in high-dimensional financial models.
method Neural networks and randomisation of discrete variables for direct policy modeling.
result Success in pricing high-dimensional American and swing options.

The paper studies RBSDEs with arbitrary stopping times and their solutions.

problem Existence and estimation of solutions to RBSDEs under arbitrary stopping times.
method Analyzes the conditions for the existence of solutions and estimates their norms.
result Proves the existence of solutions and provides estimation methods for arbitrary stopping times.

In this paper, we provide a solution to two problems which have been open in default time modeling in credit risk. We first show that if ττ is an arbitrary random (default) time such that its Azéma's supermartingale $Z_t^τ=¶(τ>t|\F_t)$ is continuous, then ττ avoids stopping times. We then disprove a conjecture about …

2008-07-30abs ↗pdf ↗

Gradient-flow optimization is reinterpreted as a statistical inference problem.

problem Optimizing training duration and assessing model performance in deep learning.
method Develops a statistical framework for gradient-flow training, treating it as a random-effects model.
result Establishes asymptotic optimality for prediction and reduces reliance on validation splits.

The paper develops formulas for hedging and arbitrage in markets with random stopping times.

problem Developing pricing formulas for assets in markets with random stopping times.
method Modeling market with random stopping time, analyzing conditional essential supremum, and describing super-hedging prices.
result Explicit formulas for super-hedging prices and Immediate-Profit arbitrage are derived.

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

Trailing stop is a popular stop-loss trading strategy by which the investor will sell the asset once its price experiences a pre-specified percentage drawdown. In this paper, we study the problem of timing buy and then sell an asset subject to a trailing stop. Under a general linear diffusion framework, we study an opt…

2017-01-14abs ↗pdf ↗

This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are characterized by the solution of a backward stochastic differential equation. The pa…

2018-03-01abs ↗pdf ↗

In this paper we solve the hedge fund manager's optimization problem in a model that allows for investors to enter and leave the fund over time depending on its performance. The manager's payoff at the end of the year will then depend not just on the terminal value of the fund level, but also on the lowest and the high…

2014-03-02abs ↗pdf ↗

Study speculative trading using RL with exploratory framework.

problem Sequential optimal stopping problem over entry and exit times with general utility function and price process.
method Formulated as a sequential optimal stopping problem, solved using Cox processes driven by bounded, non-randomized intensity controls. Characterized randomized control via probability measure over jump intensities and regularized objective function by Shannon's entropy. Established error estimates and convergence of RL objective to value function.
result Closed-form solutions for optimal policy and value function are derived.

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.

Investors with anxiety about drawdowns may use stop-loss and trailing stops as optimal selling strategies.

problem Investors' anxiety about drawdowns affects optimal selling strategies.
method Mathematical analysis of optimal stopping with random discounting.
result Stop-loss and trailing stops can be optimal selling strategies under anxiety about drawdowns.

Study optimal stopping for diffusion processes with unknown primitives, applying RL and martingale methods.

problem Optimal stopping for diffusion processes with unknown model primitives.
method Continuous-time reinforcement learning framework, variational inequality formulation, stochastic optimal control, entropy regularizer, semi-analytical optimal Bernoulli distribution, policy improvement theorem, policy iterations.
result Demonstrated high accuracy in learning value functions and characterizing free boundaries for various optimal stopping problems.

This paper quantifies the interplay between the non-arbitrage notion of No-Unbounded-Profit-with-Bounded-Risk (NUPBR hereafter) and additional information generated by a random time. This study complements the one of Aksamit/Choulli/Deng/Jeanblanc [1] in which the authors studied similar topics for the case of stopping…

2014-04-01abs ↗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.

Bayesian models predict Collatz stopping times with high accuracy.

problem Predicting the total stopping time of Collatz sequences.
method Developed two complementary models: a hierarchical Negative Binomial regression and a mechanistic generative approximation.
result Bayesian models outperform generative approximations in predicting Collatz stopping times.