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

162323485646 · Jun 202019922001200920172026
48 results for predetermined transition time

Faster sampling in discrete diffusion models with predetermined transition time.

problem Efficiency in sampling discrete diffusion models.
method Discrete Non-Markov Diffusion Models (DNDM) with predetermined transition time.
result Significantly reduces the number of function evaluations for faster sampling.

We document a mechanism operating in complex adaptive systems leading to dynamical pockets of predictability (``prediction days''), in which agents collectively take predetermined courses of action, transiently decoupled from past history. We demonstrate and test it out-of-sample on synthetic minority and majority game…

2004-10-29abs ↗pdf ↗

The paper uses a novel framework to learn option prices by imitating principal investor behavior.

problem Challenges in modeling stock price changes and decision making in equity markets.
method Non-deterministic Markov decision process, Bayesian deep neural network, reinforcement learning.
result Optimal option prices learned through imitation of principal investor behavior.

Maximizing withdrawal success in a pooled annuity fund with multiple annuitants.

problem Optimizing withdrawal success in a pooled annuity fund with homogeneous annuitants.
method Maximizing the probability of completing withdrawals until death over portfolio weight functions.
result Increasing the number of annuitants can significantly increase the maximum probability of withdrawal success.

Proposes continuous convolution layers for flexible feature map resizing.

problem Fixed stride limitations in discrete convolution layers.
method Introduces Continuous Convolution (CC) layers that use learned continuous functions.
result Dynamic and consistent resizing of feature maps at any scale, non-integer and axis-dependent.

We study the optimal placement problem of a stock trader who wishes to clear his/her inventory by a predetermined time horizon t, by using a limit order or a market order. For a diffusive market, we characterize the optimal limit order placement policy and analyze its behavior under different market conditions. In part…

2017-08-14abs ↗pdf ↗

The problem of stock hedging is reconsidered in this paper, where a put option is chosen from a set of available put options to hedge the market risk of a stock. A formula is proposed to determine the probability that the potential loss exceeds a predetermined level of Value-at-Risk, which is used to find the optimal s…

2011-10-02abs ↗pdf ↗

This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.

problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.

We present a continuous-time maximum likelihood estimation methodology for credit rating transition probabilities, taking into account the presence of censored data. We perform rolling estimates of the transition matrices with exponential time weighting with varying horizons and discuss the underlying dynamics of trans…

2009-12-23abs ↗pdf ↗

This work accelerates gradient descent with anytime convergence guarantees.

problem Improving the convergence rate of gradient descent methods.
method Proposes a stepsize schedule for gradient descent that achieves anytime convergence rates.
result Gradient descent can achieve convergence rates of O(T1.119)O(T^{-1.119}) for any stopping time TT.

Most learning algorithms are not invariant to the scale of the function that is being approximated. We propose to adaptively normalize the targets used in learning. This is useful in value-based reinforcement learning, where the magnitude of appropriate value approximations can change over time when we update the polic…

2016-02-24abs ↗pdf ↗

A multi-task GP model tracks time-varying transition probabilities between two states.

problem Tracking time-varying transition probabilities between 'moves' and 'pauses' states.
method Kernel-based multi-task Gaussian Process model with time-variability and constraints.
result Enforces constraints while learning transition probabilities.

Pricing formulae for defaultable corporate bonds with discrete coupons under consideration of the government taxes in the united model of structural and reduced form models are provided. The aim of this paper is to generalize the comprehensive structural model for defaultable fixed income bonds (considered in [1]) into…

2013-09-06abs ↗pdf ↗

Paper introduces TtT, market-implied transition time, from greenium term structure.

problem Estimating market-implied transition time to a low-carbon economy.
method Develops inference theory for TtT, introduces two stochastic models.
result Combines two-layer analysis for consistent estimation of diffusion parameters.

Study models forest transitions with deep learning for parameter estimation.

problem Complex dynamics of forest, agricultural, and abandoned lands.
method Developed a stochastic differential equation model and used deep learning for parameter estimation.
result Deep learning approach estimates model parameters from time-series data.

We develop a topology data analysis-based method to detect early signs for critical transitions in financial data. From the time-series of multiple stock prices, we build time-dependent correlation networks, which exhibit topological structures. We compute the persistent homology associated to these structures in order…

2017-01-21abs ↗pdf ↗

A novel approach models rating transitions using Lie groups and Deep Learning.

problem Modeling rating transitions with geometric properties and stochastic processes.
method Introducing Itô-SDEs on Lie groups, using TimeGAN for calibration, and examining rating matrix properties.
result The geometric approach using Lie groups and Deep Learning generates a good fit for rating transitions.

Optimal stock trading strategy with market orders and limit orders in a risky market.

problem Finding the best time and amount to place market and limit orders to minimize costs.
method Analyzes single and multi-period models with limit and market orders, considering liquidity risk.
result Optimal placement of market and limit orders can be determined under different market conditions.

ISOKANN learns collective variables and effective dynamics for metastable transitions.

problem Understanding metastable transitions in complex molecular systems.
method Integrates Koopman operators with neural networks to extract CVs and effective dynamics.
result Reconstructs coarse-grained kinetics and reproduces transition times across barriers.

New algorithm reduces regret in stochastic shortest path problems.

problem Planning and control in environments with unknown dynamics and variable episode lengths.
method Developed an algorithm with a new regret bound of O(BSAK)O(B_\star |S| \sqrt{|A| K}).
result Guaranteed a significant reduction in regret compared to previous methods.

Revisits superhedging under proportional costs in continuous time markets.

problem Superhedging in markets with proportional transaction costs.
method Set-valued stochastic analysis, continuous trading schemes, dynamic risk measure.
result Dynamic set-valued risk measure with multi-portfolio time-consistency.

We introduce the safe linear stochastic bandit framework---a generalization of linear stochastic bandits---where, in each stage, the learner is required to select an arm with an expected reward that is no less than a predetermined (safe) threshold with high probability. We assume that the learner initially has knowledg…

2019-11-21abs ↗pdf ↗

A novel multi-resolution Gaussian process model for efficient time traversal.

problem Inference for long sequences with fast and slow transitions is difficult.
method A novel Gaussian process state-space architecture composed of multiple components, each trained on a different resolution.
result The combined model allows efficient inference for arbitrarily long sequences with complex dynamics.

Proposes a new model for time series that considers smooth transitions between states.

problem Models assume instantaneous transitions between discrete states, ignoring gradual changes.
method Dynamical Wasserstein Barycentric (DWB) model that estimates system state and pure state distributions over time.
result Accurately learns pure state distributions and improves state estimation for transition periods.

We construct examples of four dimensional manifolds with Spinc^c-structures, whose moduli spaces of solutions to the Seiberg-Witten equations, represent a non-trivial bordism class of positive dimension, i.e. the Spinc^c-structures are not induced by almost complex structures. As an application, we show the existence…

2000-02-28abs ↗pdf ↗

Proposes a new model to analyze mortgage delinquency transitions.

problem Analyzing mortgage delinquency transitions in a flexible yet identifiable way.
method Combines structured additive predictor with neural network for complex interactions, orthogonalising components for identifiability.
result The semi-structured model provides modest gains in discrimination compared to a structured model, especially in the early prediction spans.

This work proposes a new feature for transportation mode classification using GPS trajectories.

problem Classifying transportation modes from GPS trajectories to optimize urban mobility.
method The Ordinal Pattern Transition Graph and its self-transition probability are used for classification.
result The proposed feature outperforms existing methods in transportation mode classification.

The paper tackles joint learning of linear systems, improving accuracy with pooled data.

problem Estimating transition matrices of multiple related linear systems more accurately.
method Developed novel techniques to bound estimation errors and establish high probability bounds for singular values.
result Significant gains in accuracy achieved by pooling data across systems.