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

157314471628 · Jun 202019922001200920172026
48 results for Stationary states

The method approximates stationary distributions of Markov models by truncating irrelevant states.

problem Computing the stationary distribution of complex Markov models is computationally challenging.
method A state-space lumping scheme that aggregates states in a grid structure, iteratively refining the state-space.
result The method provides a well-justified finite-state projection tailored to the stationary behavior of Markov models.

New definitions of ESP for quantum reservoir computing handle non-stationary systems.

problem Traditional ESP does not apply to non-stationary systems.
method Introduce two new categories of ESP: non-stationary ESP and subset/subspace ESP.
result Demonstrates correspondence between non-stationary ESP and QRC with NARMA tasks.

Study identifies transitions between traffic modes on Cologne motorways.

problem Understanding transitions between different traffic modes.
method Constructed state transition network, identified dominant states using PageRank algorithm.
result Identified seasonal dependence in traffic modes.

ETGPSSM efficiently models high-dimensional, non-stationary systems with reduced complexity.

problem Prohibitive computational and parametric complexity in high-dimensional, non-stationary dynamical systems.
method ETGPSSM integrates a single shared GP with input-dependent normalizing flows for scalable and flexible modeling.
result ETGPSSM outperforms existing models in computational efficiency and accuracy.

Study neural architectures on learned latent graphs using Schrödinger dynamics.

problem Understanding neural architectures on learned latent graphs.
method Optimizes over stratified moduli space of weighted graphs with Kähler-Hessian metric.
result Multilayer stationary networks are equivalent to global stationary problems on supra-graphs.

Non-stationary reinforcement learning is challenging due to the complexity of updating value functions.

problem Challenges in non-stationary reinforcement learning, especially in updating value functions.
method Proved a worst-case complexity result for modifying reinforcement learning problems.
result Modifying reinforcement learning problems requires an amount of time almost as large as the number of states.

Study on fake stationary Volterra Heston model for non-stationary processes.

problem Non-stationary nature of true Volterra equations.
method Weak notion of stationarity (fake stationary regime) for inhomogeneous affine Stochastic Volterra equations.
result Existence of limiting distributions in the long run, which may depend on initial state.

NVMDP framework tackles non-stationary MDPs with varying discount rates.

problem Challenges in non-stationary environments and infinite-horizon formulations for reinforcement learning.
method Introduces NVMDP framework that accommodates non-stationarity and varying discount rates.
result NVMDPs provide a flexible mechanism to shape optimal policies without altering state or action spaces.

KeRNS tackles non-stationary reinforcement learning in metric spaces.

problem Non-stationary reinforcement learning in metric spaces.
method KeRNS uses time-dependent kernels to model non-stationary Markov Decision Processes (MDPs).
result KeRNS achieves a regret bound that scales with the covering dimension and total variation of the MDP.

Detect changes in noisy dynamical systems using empirical approximations and finite-sample bounds.

problem Change detection in noisy dynamical systems
method Partition-based empirical approximations and finite-state stationary distribution stability
result Finite-sample bound for empirical stationary density

Enhances time-series regression trees with latent factors for robust financial analysis.

problem Handling predictors with measurement error, trends, seasonality, and missing data.
method Integrates latent stationary factors extracted via state-space methods into time-series regression trees.
result Factor-augmented trees provide a reliable approach for macro-finance problems, exemplified by the lead-lag effect between equity volatility and the business cycle.

Stanza models complex time series with balance between traditional and deep learning approaches.

problem Capturing long-term structure in non-stationary time series.
method Nonlinear, non-stationary state space model.
result Achieves forecasting accuracy competitive with deep LSTMs, especially for multi-step ahead forecasting.

Model predicts stationary equilibrium in investment decisions of firms in fluctuating markets.

problem Investment decisions in fluctuating markets with varying volatility and commodity prices.
method Mean-field model with Gaussian productivity shocks and two-state Markov chain for macroeconomic events.
result Existence, uniqueness, and characterization of stationary mean-field equilibrium with barrier-type investment strategy.

We characterize stationary solutions to McKean-Vlasov equations on the circle.

problem Stationary solutions of McKean-Vlasov equations on the circle.
method Exact equivalence to an infinite-dimensional quadratic system of equations over Fourier coefficients, leading to explicit characterization of stationary states.
result Analytic expressions for the emergence, form, and shape of bifurcations involving multiple Fourier modes, and connections with discontinuous phase transitions.

Improved algorithm detects changes in RL environments with non-stationary MDPs.

problem Learning in non-stationary reinforcement learning environments.
method R-BOCPD-UCRL2 algorithm for MDPs with multinomial state transitions.
result Near-optimal theoretical guarantees in terms of false-alarm rate and detection delay.

We study how resetting affects geometric Brownian motion, showing it becomes stationary but remains non-ergodic.

problem Effects of stochastic resetting on geometric Brownian motion.
method Analysis of geometric Brownian motion under stochastic resetting.
result Resetting makes geometric Brownian motion stationary but non-ergodic.

Develops a new method to discover causal relationships from nonstationary time series data.

problem Challenges in inferring causal relationships from observational data, especially for nonstationary time series.
method State-Dependent Causal Inference (SDCI) for conditionally stationary time series.
result SDCI can recover underlying causal dependencies with provable identifiability for state-dependent causal structures.

New Hida-Matérn kernels enable flexible process priors and efficient GP inference.

problem Flexible modeling of stationary processes with oscillatory components.
method Introducing a new class of covariance functions (Hida-Matérn kernels) and their state space representations.
result Efficient Gaussian Process inference and improved numerical stability.

In this paper, we consider a simple kinetic model of economy involving both exchanges between agents and speculative trading. We show that the kinetic model admits non trivial quasi-stationary states with power law tails of Pareto type. In order to do this we consider a suitable asymptotic limit of the model yielding a…

2004-12-21abs ↗pdf ↗

New algorithm tackles non-stationary reinforcement learning with general function approximation.

problem Understanding non-stationary MDPs with function approximation.
method Dynamic Bellman Eluder (DBE) dimension for complexity, sliding window mechanism, confidence set design.
result Upper bound on dynamic regret for proposed SW-OPEA algorithm.

The state space (SS) representation of Gaussian processes (GP) has recently gained a lot of interest. The main reason is that it allows to compute GPs based inferences in O(n), where nn is the number of observations. This implementation makes GPs suitable for Big Data. For this reason, it is important to provide a SS …

2016-01-07abs ↗pdf ↗

Master algorithm fails to detect non-stationarity in practical settings.

problem Non-Stationary Reinforcement Learning without prior knowledge.
method Master algorithm tested under various conditions, including piecewise stationary multi-armed bandits.
result Master's non-stationarity detection is ineffective for practical horizons, leading to performance similar to random restarting.

Improved sampling from mean-field stationary distributions.

problem Sampling from the stationary distribution of mean-field SDEs.
method Decoupling the problem into two aspects: approximation of mean-field SDE and sampling from finite-particle distribution.
result Improved guarantees in various settings, including optimizing neural networks.

New method finds stationary points in bilevel optimization problems.

problem Solving nonconvex-strongly-convex bilevel optimization problems.
method Restarted Accelerated HyperGradient Descent (RAHGD) method.
result Achieves best-known theoretical guarantees for finding stationary points in bilevel optimization.

Building on previous results on the quadratic helicity in magnetohydrodynamics (MHD) we investigate particular minimum helicity states. Those are eigenfunctions of the curl operator and are shown to constitute solutions of the quasi-stationary incompressible ideal MHD equations. We then show that these states have inde…

2018-06-19abs ↗pdf ↗

The understanding of complex systems has become a central issue because complex systems exist in a wide range of scientific disciplines. Time series are typical experimental results we have about complex systems. In the analysis of such time series, stationary situations have been extensively studied and correlations h…

2012-02-08abs ↗pdf ↗

Develops a deep non-stationary kernel for non-stationary spatio-temporal point processes.

problem Capturing non-stationary dependencies in point process data.
method Approximates the influence kernel with a novel low-rank decomposition and introduces a log-barrier penalty to maintain non-negativity.
result Demonstrates superior performance and computational efficiency compared to state-of-the-art methods.

The notion of the stationary equilibrium ensemble has played a central role in statistical mechanics. In machine learning as well, training serves as generalized equilibration that drives the probability distribution of model parameters toward stationarity. Here, we derive stationary fluctuation-dissipation relations t…

2018-09-28abs ↗pdf ↗

New method stabilizes FQE by reweighting Bellman targets.

problem Stability guarantees for FQE often rely on Bellman completeness, which can fail with function approximation.
method Proposes stationary-weighted FQE, reweighting Bellman targets by stationary target-to-behavior density ratio.
result Proves finite-sample linear convergence to stationary projected Bellman fixed point without Bellman completeness.

New approach turns optimal stationary RL into non-stationary RL without prior knowledge.

problem Optimal RL in non-stationary environments without prior knowledge of non-stationarity.
method Black-box reduction of optimal stationary RL algorithms to non-stationary RL.
result Achieves optimal dynamic regret bounds in various RL settings.

In this paper we study several aspects of the geometry of conformally stationary Lorentz manifolds, and particularly of GRW spaces, due to the presence of a closed conformal vector field. More precisely, we begin by extending to these spaces a result of J. Simons on the minimality of cones in Euclidean space, and apply…

2010-04-05abs ↗pdf ↗

PyChEst detects changes in non-stationary time series without distributional assumptions.

problem Detecting changes in non-stationary time series data.
method Nonparametric algorithms for consistent detection of multiple changepoints in piece-wise stationary processes.
result PyChEst consistently detects changes without distributional assumptions.

New algorithm tackles non-stationary RL with near-optimal regret bounds.

problem Model-free reinforcement learning in non-stationary Markov decision processes.
method Proposed RestartQ-UCB algorithm with Freedman-type bonus terms.
result Achieves near-optimal dynamic regret bound in non-stationary RL.