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

Trend · papers per month

83166248331 · Jun 202019922001200920172026
48 results for Stochastic Horizon

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.

This paper solves the consumption-investment problem under Epstein-Zin preferences on a random horizon. In an incomplete market, we take the random horizon to be a stopping time adapted to the market filtration, generated by all observable, but not necessarily tradable, state processes. Contrary to prior studies, we do…

2019-03-21abs ↗pdf ↗

WSqD extends learning rate schedules for large model training without fixed horizons.

problem Fixed learning rate schedules limit training horizon extension.
method WSqD replaces constant stable phase with a shifted inverse-square-root base, retaining linear cooldown.
result WSqD achieves minimax-optimal convergence rate and horizon-independence.

Investment and consumption strategy for risk-averse agents with Epstein-Zin utility.

problem Optimal investment and consumption strategy for Epstein-Zin utility.
method Detailed introduction to Epstein-Zin utility, existence and uniqueness proof, verification argument.
result Existence and uniqueness of optimal solution for Epstein-Zin utility under certain parameter restrictions.

Study optimal liquidation strategies with infinite horizon and regime switching.

problem Optimal liquidation with semimartingale strategies in a stochastic environment.
method Characterization of value function and optimal strategy via BSDEs with infinite horizon.
result Existence and uniqueness of optimal control problem solutions.

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.

New algorithms minimize regret in SSP with optimal sparse updates.

problem Minimizing regret in Stochastic Shortest Path models.
method Implicit finite-horizon approximation for analysis, model-free and model-based algorithms developed.
result Minimax optimal regret for both model-free and model-based algorithms.

This study improves credit risk management using advanced reinforcement learning.

problem Sub-optimal hedging of credit losses due to bid-ask costs and model limitations.
method Risk-averse stochastic-horizon reinforcement learning for dynamic risk management.
result Efficacy demonstrated through numerical study of a single FX forward contract portfolio.

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 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 ↗

The paper solves investment problems with uncertain factors using game theory.

problem Optimal forward investment in an incomplete market with model uncertainty.
method Combining stochastic differential games and ergodic BSDE approach.
result Representation of robust forward performance processes in factor form.

Study optimal portfolio management with periodic evaluations in stochastic models, considering convex constraints.

problem Optimal portfolio management under ratio-type periodic evaluations in stochastic factor models with convex trading constraints.
method Transformed infinite horizon optimal control problem into an auxiliary terminal wealth optimization problem. Introduced an auxiliary unconstrained optimization problem in a modified market model. Used martingale duality approach to establish dual minimizer and optimal unconstrained wealth process.
result Derived and verified the optimal constrained portfolio process for the original problem over an infinite horizon.

Paper solves portfolio problem using improved stochastic methods.

problem Finite horizon consumption-investment problem under stochastic factor framework.
method Proves existence of classical solution for semilinear equation using gradient estimates.
result Proves existence of classical solution and provides all necessary estimates.

Study optimal healthcare spending under Epstein-Zin preferences for longevity.

problem Optimizing healthcare spending to extend longevity under Epstein-Zin preferences.
method Formulated Epstein-Zin utilities over a controllable random horizon using backward stochastic differential equations and HJB equations.
result Calibrated model accurately reflects actual mortality data and compares healthcare efficacy between countries.
Optimal Investment Horizonscond-mat.stat-mech

In stochastic finance, one traditionally considers the return as a competitive measure of an asset, {\it i.e.}, the profit generated by that asset after some fixed time span ΔtΔt, say one week or one year. This measures how well (or how bad) the asset performs over that given period of time. It has been established tha…

2002-02-20abs ↗pdf ↗

In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …

2016-08-22abs ↗pdf ↗

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.

The study introduces anytime learning schedules for large language models without fixed horizons.

problem Training large language models without knowing the total training horizon.
method Theoretical analysis and weight averaging to create anytime learning schedules.
result Theoretical and empirical evidence shows that weight averaging with simple step sizes can achieve comparable final loss to well-tuned cosine schedules.

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.

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.

Careful tuning of the learning rate, or even schedules thereof, can be crucial to effective neural net training. There has been much recent interest in gradient-based meta-optimization, where one tunes hyperparameters, or even learns an optimizer, in order to minimize the expected loss when the training procedure is un…

2018-03-06abs ↗pdf ↗

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.

Proposes new rule for ranking investment prospects over long horizons.

problem Ranking investment prospects over long horizons considering bounded risk aversion.
method Introduces asymptotic fractional-order stochastic dominance with bounded relative risk aversion.
result Establishes equivalent conditions for the new rule under lognormal returns without mean non-negativity constraint.

New algorithm reduces regret in stochastic bandit convex optimization.

problem Optimizing decisions in uncertain environments with convex losses.
method Introduces a second-order method for zeroth-order stochastic convex bandits.
result Regret bound of (1+r/d)[d1.5n+d3]polylog(n,d,r)(1 + r/d)[d^{1.5} \sqrt{n} + d^3] polylog(n, d, r).

This paper optimizes portfolio management in incomplete markets with stochastic factors, considering periodic wealth evaluations.

problem Optimizing portfolio performance in an incomplete market model with stochastic factors and periodic wealth evaluations.
method Developed a martingale duality approach to find optimal portfolio processes and dual minimizers.
result Established the existence of optimal portfolio processes and identified dual minimizers as the 'least favorable' market completion.

Study optimal consumption and investment for investors with Epstein-Zin preferences.

problem Optimal consumption and investment for investors with Epstein-Zin preferences in an incomplete market.
method Variational characterisation and direct method to prove existence of optimal policies.
result Existence and uniqueness of optimal consumption and investment policies.

We extend the model of stochastic bandits with adversarial corruption (Lykouriset al., 2018) to the stochastic linear optimization problem (Dani et al., 2008). Our algorithm is agnostic to the amount of corruption chosen by the adaptive adversary. The regret of the algorithm only increases linearly in the amount of cor…

2019-09-04abs ↗pdf ↗

Study on policy gradient for stochastic bandits using diffusion approximation.

problem Improving policy gradient methods for stochastic bandits with optimal regret bounds.
method Continuous-time diffusion approximation of policy gradient with learning rate analysis.
result Proved optimal regret bound of O(klog(k)log(n)/η)O(k \log(k) \log(n) / η) for η=O(Δ2/log(n))η= O(Δ^2/\log(n)).

MPC outperforms reactive budgeting in non-stationary return environments.

problem Optimizing budget allocation under non-stationary returns.
method Receding-horizon Model Predictive Control (MPC) compared to reactive policies.
result MPC consistently outperforms reactive budgeting when return dynamics are predictable.

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.

The paper models exchange rate risk premium using mean-reverting dynamics.

problem Empirical failure of uncovered interest parity (UIP).
method Modeling risk premium using Ornstein-Uhlenbeck (OU) process embedded in stochastic differential equation for exchange rate.
result The model shows strong predictive performance at short and long horizons, but underperforms at intermediate horizons.

Proposes a model for multi-horizon probabilistic forecasting of time series influenced by asynchronous events.

problem Forecasting time series influenced by asynchronous events is challenging.
method Introduces Variational Synergetic Multi-Horizon Network (VSMHN), a deep conditional generative model combining deep point processes and variational recurrent neural networks.
result Produces accurate, sharp, and realistic probabilistic forecasts.

New RL algorithm explains why deep learning works in stochastic environments.

problem Why deep RL algorithms perform well in practice despite using random exploration.
method Introducing SQIRL, an iterative RL algorithm that separates exploration and learning.
result Effective horizon explains why deep RL works in stochastic environments.

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 ↗