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

Trend · papers per month

148296444592 · Jun 202019922001200920172026
48 results for exit timing

Analyzes first exit times in a modified Barndorff-Nielsen and Shephard model.

problem Analyzing first exit times in a modified Barndorff-Nielsen and Shephard model.
method Formulated an approximate model driven by Brownian motion and Lévy subordinator, analyzed first exit times of log-return process.
result First exit time process decomposes into Brownian motion and Lévy subordinator components.

New method controls mean exit time in stochastic systems using machine learning and quasipotential.

problem Controlling mean exit time in stochastic dynamical systems with white noise.
method Developed a neural network to compute the quasipotential function and designed an algorithm to calculate the controller.
result Effective and accurate control strategy demonstrated through numerical experiments.

Study of a generalized geometric Brownian motion with varying entry and exit rates.

problem Understanding the long-run behavior of economic systems with growth, volatility, entry, and exit.
method Generalized geometric Brownian motion framework with varying entry and exit rates, analyzing moments and survival probability.
result Optimal exit rate minimizes mean first-passage time, influencing system outcome.

Developed policy gradient methods for stochastic control with exit time, outperforming traditional techniques in share repurchase pricing.

problem Optimal control with exit time in stochastic models.
method Two types of algorithms: direct policy learning and alternately learning value function and control.
result Policy gradient methods outperform PDE or neural networks in share repurchase pricing.

We apply the theory of continuous time random walks to study some aspects of the extreme value problem applied to financial time series. We focus our attention on extreme times, specifically the mean exit time and the mean first-passage time. We set the general equations for these extremes and evaluate the mean exit ti…

2004-06-23abs ↗pdf ↗

E2^2CM uses class means for efficient early exits in neural networks.

problem Efficient early exits in neural networks with low computational cost.
method Early Exit Class Means (E2^2CM) based on class means of samples, without gradient-based training.
result E2^2CM achieves higher accuracy with fixed training time budget and boosts existing early exit schemes.

We prove explicit upper and lower bounds for the L1L^1-moment spectra for the Brownian motion exit time from extrinsic metric balls of submanifolds PmP^m in ambient Riemannian spaces NnN^{n}. We assume that PP and NN both have controlled radial curvatures (mean curvature and sectional curvature, respectively) as view…

2010-09-07abs ↗pdf ↗

Investors optimize liquid staking decisions in LSP and AMM protocols.

problem Optimal timing and allocation in liquid staking protocols.
method Derive optimal allocation strategy and model optimal exit timing using Laplace transforms and free-boundary techniques.
result Optimal stop-loss strategy maximizes expected payoff, influenced by fees and opportunity gains.

Enhances early-exit neural networks for anytime classification.

problem Lack of guaranteed prediction quality improvement with longer computation time.
method Post-hoc modification based on Product-of-Experts to enforce conditional monotonicity.
result Achieves conditional monotonicity in prediction quality, enabling anytime classification.

We study theoretical and empirical aspects of the mean exit time of financial time series. The theoretical modeling is done within the framework of continuous time random walk. We empirically verify that the mean exit time follows a quadratic scaling law and it has associated a pre-factor which is specific to the analy…

2005-07-06abs ↗pdf ↗

Optimizes liquidity withdrawal timing for AMM LPs to balance fees and impermanent loss.

problem Balancing fees and impermanent loss in automated market makers.
method Stochastic control problem with endogenous stopping time, numerical solutions via Euler scheme and Longstaff-Schwartz method.
result Optimal exit strategy depends on volatility, fees, and market dynamics.

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

Classifies domains critical for heat content and exit-time moments.

problem Understanding critical domains for heat content and exit-time moments.
method First variation of heat content, constant flow property, isoparametric foliation.
result Domains critical for heat content at all times have constant flow property and isoparametric foliation.

In the domain of technology startups, biotechnology has often been considered as specific. Their unique technology content, the type of founders and managers they have, the amount of venture capital they raise, the time it takes them to reach an exit as well as the technology clusters they belong to are seen as such un…

2018-04-13abs ↗pdf ↗

This paper investigates sufficient conditions for a Feynman-Kac functional up to an exit time to be the generalized viscosity solution of a Dirichlet problem. The key ingredient is to find out the continuity of exit operator under Skorokhod topology, which reveals the intrinsic connection between overfitting Dirichlet …

2018-06-25abs ↗pdf ↗

Enhances KANs for accuracy and interpretability with multi-exit architecture.

problem Unclear optimal depth for KANs and difficulty in optimization and interpretation.
method Introduces multi-exit KANs with each layer having its own prediction branch.
result Multi-exit KANs outperform single-exit versions on various datasets.

Risk control improves EENNs to make faster predictions without sacrificing accuracy.

problem Determining safe times for EENNs to exit early without degrading performance.
method Adapting risk control frameworks to EENNs to tune their exiting mechanism.
result Risk control enables EENNs to make faster predictions while maintaining user-specified performance goals.

This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.

problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.

Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby incurring a possibly large representation cost because exit values refer to nonlocal a…

2012-06-27abs ↗pdf ↗

EENNs improve inference efficiency but need nested prediction sets for reliable uncertainty estimates.

problem Non-nested prediction sets from standard uncertainty quantification methods in EENNs.
method Introduced anytime-valid confidence sequences (AVCSs) tailored for EENNs.
result AVCSs generate nested prediction sets across EENN exits, addressing the issue of non-nested sets.

EERO optimizes resource usage for efficient classification.

problem Managing computational resources in complex machine learning models.
method EERO uses multiple classifiers with a reject option to adaptively shorten processing paths.
result EERO effectively manages budget allocation and enhances accuracy in complex scenarios.

For a Riemannian manifold (M,g)(M,g) with strictly convex boundary M\partial M, the lens data consists in the set of lengths of geodesics γγ with endpoints on M\partial M, together with their endpoints (x,x+)M×M(x_-,x_+)\in \partial M\times \partial M and tangent exit vectors (v,v+)TxM×Tx+M(v_-,v_+)\in T_{x_-} M\times T_{x_+} M. We show …

2014-12-04abs ↗pdf ↗

This paper employs the extrinsic information transfer (EXIT) method, a technique imported from the analysis of the iterative decoding of error control codes, to study the performance of belief propagation in community detection in the presence of side information. We consider both the detection of a single (hidden) com…

2019-01-08abs ↗pdf ↗

Lewis and Mordecki have computed the Wiener-Hopf factorization of a Lévy process whose restriction on ]0,+[]0,+\infty[ of their Lévy measure has a rational Laplace transform. That allows to compute the distribution of (Xt,inf0stXs)(X_t,\inf_{0\leq s\leq t}X_s). For the same class of Lévy processes, we compute the distribution of $ (…

2010-03-25abs ↗pdf ↗

Large deviation principles for multivariate stochastic volatility models.

problem Understanding the behavior of log-processes in multivariate stochastic volatility models.
method Establishing a comprehensive sample path large deviation principle for log-processes.
result Asymptotic formulas for first exit times and barrier option prices derived from the LDP.

We solve the escape problem for the Heston random diffusion model. We obtain exact expressions for the survival probability (which ammounts to solving the complete escape problem) as well as for the mean exit time. We also average the volatility in order to work out the problem for the return alone regardless volatilit…

2008-07-07abs ↗pdf ↗

SIFT reduces training time by selecting samples with approximate losses.

problem Reducing training time by selecting samples with large approximate losses.
method Developed SIFT which uses early exiting to obtain approximate losses with intermediate layer representations for sample selection.
result SIFT achieves significant gains in training time and number of backpropagation steps without optimized implementation.

The paper uses machine learning to compute rare event probabilities in stochastic systems.

problem Characterizing rare events in stochastic dynamical systems with weak noise.
method Developed a neural network framework for computing quasipotential, most probable paths, and prefactors.
result Demonstrated higher effectiveness and accuracy of the algorithm in calculating mean exit times.