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

Trend · papers per month

491317 · May 202619922001200920172026
48 results for non-Markovian closure

A new method predicts non-Markovian closure terms for complex systems.

problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.

Derivation of reduced order representations of dynamical systems requires the modeling of the truncated dynamics on the retained dynamics. In its most general form, this so-called closure model has to account for memory effects. In this work, we present a framework of operator inference to extract the governing dynamic…

2018-03-25abs ↗pdf ↗

HS-FNO models non-Markovian PDEs by learning history and future states.

problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.

Non-Markovian point process shows power-law scaling, similar to nonlinear Markovian process.

problem Understanding the scaling behavior of non-Markovian point processes.
method Analyzed a confined fractional Brownian motion-driven point process and compared it to a nonlinear Markovian process.
result A nonlinear Markovian process can reproduce the power-law scaling behavior of a non-Markovian point process.

Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.

problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.

Novel autoencoder method approximates Koopman operator in low dimensions.

problem Challenges in approximating finite Koopman operators using data-driven methods.
method Mori-Zwanzig autoencoder (MZ-AE) for robust Koopman operator approximation.
result Improved predictive capability and robust long-term statistical performance.

Paper tackles robust offline RL for non-Markovian processes, improving efficiency and applicability.

problem Learning robust policies for non-Markovian decision processes with limited offline data.
method Proposes a novel algorithm with dataset distillation and LCB design for robust values, derived new dual forms, and introduces concentrability coefficients.
result Proves polynomial sample efficiency for finding ε-optimal robust policies.

Unified analytical tool for non-Markovian jump processes.

problem Analyzing history-dependent jump processes with non-Markovian behavior.
method Developed a standard form of master equations using Laplace-space embedding and asymptotic solution.
result Unified analytical toolset for general non-Markovian processes, leading to the GLE approximation.

Investigates optimal consumption and investment strategies in non-Markovian markets with unbounded parameters.

problem Optimal consumption and investment strategies in non-Markovian markets with unbounded parameters.
method Martingale optimal principle and quadratic BSDEs with exponential moment.
result Establishes optimal strategies for consumption and investment.

The paper develops a deep signature approach for option pricing under non-Markovian stochastic volatility models.

problem Pricing options under non-Markovian stochastic volatility models is challenging due to the dependence on historical paths.
method Reformulate the asset dynamics as a rough stochastic differential equation and represent rough paths via signatures. Apply standard analytical tools to solve the transformed equation.
result The deep signature approach provides a theoretically grounded and computationally efficient framework for option pricing.

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.

Study develops numerical schemes for non-Markovian volatility models with memory.

problem Existence and uniqueness of strong solutions for non-Markovian SDEs.
method Functional quantization scheme based on Lamperti transformation.
result Theoretical foundation for numerical schemes applied to specific models.

Study analyzes non-Markovian effects in financial markets over multiple years.

problem Understanding non-Markovian dynamics and trader interactions in financial markets.
method Empirical analysis of self-response functions and trade sign correlators for different stocks over multiple years.
result Significant variations in traders' interactions over time, indicating changes in market mechanisms.

We revisit Merton's portfolio optimization problem under boun-ded state-dependent utility functions, in a market driven by a Lévy process ZZ extending results by Karatzas et. al. (1991) and Kunita (2003). The problem is solved using a dual variational problem as it is customarily done for non-Markovian models. One of …

2009-01-14abs ↗pdf ↗

Paper tackles non-Markovian control problems with new learning methods.

problem Non-Markovian stochastic control problems with unknown parameters.
method Off-model training and importance sampling for deep neural network approximation.
result Quantitative error bounds for adaptive learning under model uncertainty.

DeepSynth synthesizes automata to guide deep RL agents through sparse, non-Markovian rewards.

problem Training deep RL agents with sparse, non-Markovian rewards and unknown high-level objectives.
method Employing a novel algorithm for synthesizing compact automata to uncover sequential structure from trace data.
result Reduces the number of iterations required for policy synthesis by two orders of magnitude and improves scalability.

This paper studies a class of non-Markovian singular stochastic control problems, for which we provide a novel probabilistic representation. The solution of such control problem is proved to identify with the solution of a ZZ-constrained BSDE, with dynamics associated to a non singular underlying forward process. Du…

2017-01-30abs ↗pdf ↗

Paper introduces MVS to detect non-Markovian observations in reinforcement learning.

problem Real-world sensors violate Markov property, leading to suboptimal reinforcement learning performance.
method Uses prediction-based Markov Violation Score (MVS) combining random forest and ridge regression.
result MVS detects non-Markovian structure in observation trajectories, quantifying its impact.

Path signatures improve hedging of exotic derivatives in non-Markovian models.

problem Hedging exotic derivatives under non-Markovian stochastic volatility models.
method Investigates path signatures in deep and shallow learning contexts, comparing neural networks and regression approaches.
result Path signatures outperform LSTM in most cases and yield more accurate results in hedging.

The paper develops methods to price options under rough volatility models using BSPDEs.

problem Pricing options in models with non-Markovian dynamics.
method Backward stochastic partial differential equations (BSPDEs) and deep learning for numerical approximations.
result Existence and uniqueness of weak solutions for general nonlinear BSPDEs.

Algorithm converts plat to standard closure of braids in 3D and related spaces.

problem Converting plat to standard closure of braids in different spaces.
method Algorithmic approach for plat to standard closure conversion in \(\mathbb{R}^3\), handlebodies, and thickened surfaces.
result Algorithm is quadratic for plat to standard closure and linear for standard to plat closure.

New model controls memory in seq2seq tasks, revealing learning regimes.

problem Understanding memory in seq2seq tasks using neural networks.
method Introducing a stochastic switching-Ornstein-Uhlenbeck (SSOU) model to control memory and a measure of non-Markovianity.
result Two learning regimes emerge from the interplay of time scales in the SSOU process.

Efficient RL in PRMs with improved regret bound.

problem Reinforcement learning in probabilistic reward machines with non-Markovian rewards.
method Design of an algorithm with a new regret bound of O~(HOAT+H2O2A3/2+HT)\widetilde{O}(\sqrt{HOAT} + H^2O^2A^{3/2} + H\sqrt{T}).
result Improved regret bound over existing methods, matching lower bound up to a logarithmic factor.

The paper studies knitted surfaces and surface-links, showing their isotopy and closure properties.

problem Understanding the isotopy and closure properties of knitted surfaces and surface-links.
method Analyzing the structure and closure of knitted surfaces and surface-links in R4\mathbb{R}^4.
result Any surface-link is ambient isotopic to the closure of a 2-dimensional knit.

Describes state variables in sequential decision problems, linking them to Markovian and non-Markovian models.

problem Sequential decision problems, especially in active learning and POMDPs, where decisions affect what is observed and learned.
method Canonical framework and novel two-agent perspective of POMDPs, defining state variables to claim Markovian or non-Markovian models.
result Properly modeled sequential decision problems are Markovian, while real decision problems are often non-Markovian.

Representation learning on networks offers a powerful alternative to the oft painstaking process of manual feature engineering, and as a result, has enjoyed considerable success in recent years. However, all the existing representation learning methods are based on the first-order network (FON), that is, the network th…

2019-08-15abs ↗pdf ↗

Paper solves Merton's portfolio problem in a non-Markovian, non-semimartingale model.

problem Merton's portfolio optimization in a fake stationary Volterra-Heston model.
method Stochastic factor solution to a Riccati BSDE, combined with martingale optimality principle.
result Derives semi-closed form optimal strategies and value function.

We study a regular closure operator in the category of quandles. We show that the regular closure operator and the pullback closure operator corresponding to the reflector from the category of quandles to its full subcategory of trivial quandles coincide, we give a simple description of this closure operator, and analy…

2014-12-30abs ↗pdf ↗

The study connects lamination and orbit closures in hyperbolic manifolds.

problem Understanding the geometric and dynamical properties of horocycle orbit closures in Z\mathbb{Z}-covers of compact hyperbolic manifolds.
method Exposes connections between distance minimizing laminations and horospherical orbit closures in Z\mathbb{Z}-covers of compact hyperbolic manifolds. Provides novel constructions and explicit descriptions.
result Even slight perturbations to hyperbolic metrics can drastically change horocycle orbit closures.

Study on kinetic Langevin diffusions and their couplings, showing subtle TV bounds and new non-Markovian couplings.

problem Understanding and quantifying the TV distance between solutions of kinetic Langevin diffusions with different initial values.
method Established new non-Markovian couplings for kinetic Langevin diffusions, derived from optimal coalescence trajectories, and analyzed their TV bounds.
result No Markovian coupling can capture the asymptotic decay rate of the TV distance between solutions of kinetic Langevin diffusions with different initial values.

Study orbits in right triangles, deducing periodic billiard paths and classifying orbit closures.

problem Understanding periodic billiard paths in right triangles and orbit closures in strata of Abelian and quadratic differentials.
method Classifying orbit closures of rank at least two in hyperelliptic components of strata of Abelian and quadratic differentials.
result Computed orbit closures and deduced asymptotic number of periodic billiard trajectories in right triangles.

New approach tackles non-Markovian behavior in maternal health programs.

problem Improving adherence and engagement in maternal and child healthcare programs.
method Extending RMABs to non-Markovian settings, using time-series forecasting and TARI policy.
result Significant increase in engagement and content listened compared to existing methods.

FLDD improves discrete diffusion models by learning a non-Markovian noising process.

problem Efficiency and quality of discrete diffusion models in few-step generation.
method Introduces a learnable non-Markovian forward (noising) process to match the target distribution.
result FLDD produces higher quality samples in fewer steps compared to conventional discrete diffusion models.