In reinforcement learning, a decision needs to be made at some point as to whether it is worthwhile to carry on with the learning process or to terminate it. In many such situations, stochastic elements are often present which govern the occurrence of rewards, with the sequential occurrences of positive rewards randoml…
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
48 results for “Termination Mechanism”
RP1 uses active learning to improve world model in fewest samples.
problem Improving sample efficiency in MBRL for continuous control tasks.
method RP1 views MBRL as active learning, using a hybrid objective function and principled termination.
result Statistically significant gains over existing approaches on continuous control tasks.
Paper argues the bear case for Bitcoin is bounded and terminal states are neutral to positive.
problem The identity of Bitcoin's creator and the associated overhang risk.
method Quantitative analysis of Satoshi's 1.148 million BTC position, considering various preference sets.
result The terminal states most consistent with observed behavior are neutral to slightly positive for Bitcoin's effective supply.
Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.
problem Default contagion in a network of smart contracts cleared through blockchain.
method Constructs a decentralized clearing mechanism using blockchain and optimal bidding strategies.
result Proves existence and uniqueness of equilibrium clearing condition for terminal net worths.
In this paper we study dynamic pricing mechanism of contingent claims. A typical model of such pricing mechanism is the so-called g-expectation defined by the solution of the backward stochastic differential equation with generator g and with the contingent claim X as terminal condition. The generating f…
Energy-efficient detection of natural errors in deep networks.
problem Deep networks lack error detection capability without additional energy costs.
method Append RACs at hidden layers to detect natural errors with early classification termination.
result Early classification termination reduces energy consumption.
To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…
A new method improves graph random features with quasi-Monte Carlo techniques.
problem Improving the accuracy of graph random features.
method Induces negative correlations in random walks using antithetic termination.
result Strong theoretical guarantees on lower-variance estimators of the Laplacian kernel.
In this work, we consider the problem of autonomously discovering behavioral abstractions, or options, for reinforcement learning agents. We propose an algorithm that focuses on the termination condition, as opposed to -- as is common -- the policy. The termination condition is usually trained to optimize a control obj…
Study optimal contracts for pandemic risk, offering fixed shares and prevention mechanisms.
problem Optimal delegation contracts in the face of pandemic shutdown risk.
method Dynamic principal-agent model with exogenous early termination risk.
result Explicit characterization of optimal wage and action for prevention mechanisms.
This paper proposes a novel scheme for the watermarking of Deep Reinforcement Learning (DRL) policies. This scheme provides a mechanism for the integration of a unique identifier within the policy in the form of its response to a designated sequence of state transitions, while incurring minimal impact on the nominal pe…
Study bounds for prices of European and American options with optional termination.
problem Bounding prices of options with potential termination.
method Duality results linking upper prices of vulnerable options to American options with constrained exercise times.
result Linking upper prices of vulnerable options to American options and game options.
The paper finds optimal threshold strategies for insurance companies with a positive terminal value at creeping ruin.
problem Optimizing dividend payments in an insurance company's surplus process with a positive terminal value at creeping ruin.
method Using fluctuation theory, the paper derives explicit formulas for the objective function and shows the optimality of threshold strategies.
result Threshold strategies are optimal for the dividend optimization problem under certain conditions.
New method preserves distances in time series data.
problem Preserving distances in time series data under interpolation.
method Developed lines-preserving terminal embeddings.
result First dimension-free coresets for Fréchet distance clustering.
Proves finite step termination of Kähler-Einstein metric singularity formation.
problem Singularity formation of Kähler-Einstein metrics.
method Finite step termination of bubble trees for singularity formation.
result Finite step termination of Kähler-Einstein metric singularity formation proved in non-collapsing situation.
The study proves a key inequality for specific types of three-dimensional spaces.
problem Establishing a mathematical inequality for a specific class of three-dimensional spaces.
method Developed the orbifold version of the Bogomolov-Gieseker inequality for stable Q-sheaves on log terminal Kähler threefolds.
result Proved the Bogomolov-Gieseker inequality for log terminal Kähler threefolds.
New test for SGD in binary classification reduces computation time.
problem Determining optimal stopping for SGD in binary classification.
method Proposes a new, simple, computationally inexpensive termination criterion for SGD.
result Termination criterion reduces expected misclassification probability.
Employee stock options (ESOs) are American-style call options that can be terminated early due to employment shock. This paper studies an ESO valuation framework that accounts for job termination risk and jumps in the company stock price. Under general Lévy stock price dynamics, we show that a higher job termination ri…
We establish existence, uniqueness and regularity of solution results for a class of backward stochastic partial differential equations with singular terminal condition. The equation describes the value function of non-Markovian stochastic optimal control problem in which the terminal state of the controlled process is…
We prove that the sum of the -invariants of two different Kollár components of a Kawamata log terminal singularity is less than .
New method for computing terminal embeddings in sublinear time.
problem Efficiently computing terminal embeddings with sublinear time complexity.
method Developed a data structure to compute terminal embeddings in sublinear time.
result Achieved sublinear time computation of terminal embeddings.
Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineationstat.ML
Locally adaptive clustering for tree delineation.
problem Tree delineation from distance data.
method Locally adaptive hierarchical cluster termination.
result Multi-scale alternative to conventional termination criteria.
Tail Risk Management with Puts and Trend Following: A CVaR Framework for Crashes and Drawdownsq-fin.MF
This paper develops a CVaR framework for managing tail risks using puts and trend-following strategies.
problem Managing tail risks, especially crashes and drawdowns, requires different forms of protection.
method Develops a continuous-time CVaR framework that integrates long out-of-the-money put options and systematic trend-following overlays.
result Shows how convex crash protection and drawdown protection can be optimally combined in a mandate.
Is an option to early terminate a swap at its market value worth zero? At first sight it is, but in presence of counterparty risk it depends on the criteria used to determine such market value. In case of a single uncollateralised swap transaction under ISDA between two defaultable counterparties, the additional unilat…
A System of BSDEs with Singular Terminal Values Arising in Optimal Liquidation with Regime Switchingq-fin.MF
Study optimal liquidation with multiple regimes using BSDEs with singular terminal values.
problem Optimal liquidation with regime switching in dark pools.
method Introduced a system of BSDEs with jumps and singular terminal values.
result Existence and uniqueness results for the BSDE system are obtained.
This paper establishes the existence of a unique nonnegative continuous viscosity solution to the HJB equation associated with a Markovian linear-quadratic control problems with singular terminal state constraint and possibly unbounded cost coefficients. The existence result is based on a novel comparison principle for…
Deep hedging uses RL to minimize risk in financial markets.
problem Minimizing risk in financial markets using reinforcement learning.
method Trains a neural network policy via Monte Carlo simulation and stochastic gradient descent.
result Deep hedging algorithm falls within the RL category.
Crohn's disease, one of two inflammatory bowel diseases (IBD), affects 200,000 people in the UK alone, or roughly one in every 500. We explore the feasibility of deep learning algorithms for identification of terminal ileal Crohn's disease in Magnetic Resonance Enterography images on a small dataset. We show that they …
New reward function improves GAIL performance in task-based environments.
problem Reward bias in adversarial imitation learning.
method Proposed a new reward function to overcome existing biases.
result New reward function outperforms existing methods in task-based environments.
We provide representations of solutions to terminal value problems of inhomogeneous Black-Scholes equations and studied such general properties as min-max estimates, gradient estimates, monotonicity and convexity of the solutions with respect to the stock price variable, which are important for financial security prici…
Develops a learning model predictive controller for competitive racing.
problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.
A new BO termination criterion for HPO reduces optimization time without sacrificing test performance.
problem Determining an optimal budget for hyperparameter optimization.
method A new termination criterion based on the discrepancy between predictive and computable target performance.
result The proposed termination criterion achieves a better trade-off between test performance and optimization time.
Circular nets with spherical parameter lines have geometric properties related to Darboux cyclides and terminating Laplace sequences.
problem Discretizing surfaces with spherical curvature lines.
method Lie-geometric discretisation in terms of principal contact element nets.
result Circular nets with two families of spherical parameter lines are related to Darboux cyclides.
Develops a new framework for perpetual futures on binary prediction markets.
problem Lack of effective risk management in perpetual futures on binary prediction markets.
method PIRAP framework with six components: index estimator, margin sizing, leverage, funding rule, halt protocol, and eligibility framework.
result Mixed results from empirical evaluation, with some pre-registered floors passing and others failing.
We apply the language of the groupoid approach to Lie pseudo-groups, and the classical Cartan-Kuranishi theorem, to prove that Cartan's equivalence method terminates at involution (or at complete reduction) for constant type problems.
TVM improves generative modeling by matching terminal velocities.
problem Creating high-fidelity one- and few-step generative models.
method TVM generalizes flow matching, modeling transitions between diffusion timesteps and regularizing terminal behavior.
result TVM achieves state-of-the-art FID scores with minimal architectural changes and fused attention kernel.
Stopping Criterion Design for Recursive Bayesian Classification: Analysis and Decision Geometrycs.LG
The paper analyzes and proposes a new stopping criterion for recursive Bayesian classification.
problem Limitations of conventional stopping criteria in recursive Bayesian classification.
method Geometric interpretation of state posterior progression and analysis of conventional criteria.
result Proposes a new stopping criterion to overcome limitations of conventional methods.
In this paper, the `Approximate Message Passing' (AMP) algorithm, initially developed for compressed sensing of signals under i.i.d. Gaussian measurement matrices, has been extended to a multi-terminal setting (MAMP algorithm). It has been shown that similar to its single terminal counterpart, the behavior of MAMP algo…
Researchers find Kähler-Einstein metrics near isolated log terminal singularities.
problem Existence of Kähler-Einstein metrics with positive curvature near isolated log terminal singularities.
method Solving complex Monge-Ampère equations to analyze the existence of metrics.
result Existence of smooth solutions in subcritical regimes, with critical exponent expressed in terms of normalized volume.
The problem of content search through comparisons has recently received considerable attention. In short, a user searching for a target object navigates through a database in the following manner: the user is asked to select the object most similar to her target from a small list of objects. A new object list is then p…
Optimal life-cycle consumption and investment decisions under age-dependent risk preferencesq-fin.MF
In this article we solve the problem of maximizing the expected utility of future consumption and terminal wealth to determine the optimal pension or life-cycle fund strategy for a cohort of pension fund investors. The setup is strongly related to a DC pension plan where additionally (individual) consumption is taken i…
Optimal asset allocation strategy outperforms stochastic benchmark.
problem Achieving higher terminal wealth than a stochastic benchmark.
method Data-driven Neural Network optimization framework for dynamic asset allocation.
result Optimal adaptive strategy outperforms benchmark with higher median and right-skewed terminal wealth.
ETCNN uses neural networks to price American options accurately.
problem Accurately pricing American options with inequality constraints.
method ETCNN framework solving BSM equations with exact terminal condition.
result ETCNN achieves high accuracy and robustness across various scenarios.
We study the existence of a minimal supersolution for backward stochastic differential equations when the terminal data can take the value + with positive probability. We deal with equations on a general filtered probability space and with generators satisfying a general monotonicity assumption. With this minim…
Research of an optimization model for servicing a network of ATMs and information payment terminalscs.LG
Optimizes cash management in ATM networks to reduce costs and increase revenue.
problem Minimizing cash costs while ensuring adequate funds in a network of ATMs.
method Developed a discrete optimal control model using forecasting techniques and control theory.
result The proposed model outperforms classical inventory management models, earning 30% more revenue.
Proof of complex geometry theorem for specific singular spaces.
problem Proving a complex geometry theorem for a specific type of singular spaces.
method Self-contained proof of singular Beauville-Bogomolov decomposition theorem.
result Proof of singular Beauville-Bogomolov decomposition theorem for compact Kähler varieties with log terminal singularities and zero first Chern class.
The paper examines special Q-nets that terminate after a finite number of Laplace steps.
problem Understanding the termination of Laplace sequences in Q-nets.
method Analyzing discrete Koenigs nets and their Laplace sequences.
result For certain Koenigs nets, Laplace sequences terminate after a finite number of steps.
Geometrically interpolates rigid body motions with initial and terminal twists.
problem Finding spatial trajectories between prescribed initial and terminal poses.
method Derives solutions for k-IV-TIP and k-BV-TIP for k=1,...,4.
result Automatic cubic interpolation identical to minimum acceleration curve when twists are zero.