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

70140210280 · Jun 202019922001200920172026
48 results for Time-varying transition probabilities

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.

The paper extends MS models with TVTP to U.S. Treasury yields, finding reliable regime dynamics but challenging TVTP identification.

problem Identifying time-varying transition probabilities in Markov-switching models for U.S. Treasury yields.
method Developed a comprehensive MS model with TVTP, including simulations and an R package for estimation.
result Regime means, variances, and transition probabilities are reliably identified, but TVTP coefficients are harder to estimate.

This paper proposes a multi-scale Markov-Switching GARCH model for EUR/USD volatility.

problem Non-stationary financial volatility requires models that capture changing market conditions across multiple timescales.
method Triple-timeframe Markov-Switching GARCH (MS-GARCH) framework with AR(1)-MS-GARCH models and TVTP for short horizons.
result The proposed model produces statistically distinct regimes and superior volatility forecasting performance.

Develops diffusion models for time-varying correlation on the circle.

problem Time-varying correlation modeling on the circle.
method Stochastic processes on the unit circle, specifically Brownian motion and von Mises diffusion.
result Derives an accurate analytical approximation to the transition density of the von Mises diffusion.

Estimates time-varying network connections using multi-stage smoothing.

problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.

New algorithm reduces high-probability regret for time-varying feedback graphs.

problem High-probability regret bounds for adversarial bandits with time-varying feedback graphs.
method Online mirror descent framework with innovative techniques for pessimistic loss estimators.
result Achieves optimal high-probability regret bound for general and weakly observable graphs.

The study analyzes how bonus-malus systems and delayed claims settlement affect insurance companies' financial stability.

problem Analyzing the impact of bonus-malus systems and delayed claims settlement on insurance companies' financial stability.
method Examined a discrete-time risk model with time-varying premiums, evaluating two types of claims and settlement delays.
result Delayed settlement of by-claims leads to lower ruin probabilities under specific assumptions.

Estimates financial market impacts of COVID-19 using time-varying kernel density.

problem Estimating the impact of COVID-19 on financial markets over time.
method Time-varying kernel density estimation with Kolmogorov-Smirnov statistic.
result Determines the chronology and regional disparities of financial market impacts.

A new method generates counterfactual treatment outcomes for time-varying treatments.

problem Estimating counterfactual outcomes for time-varying treatments with high-dimensional outcomes.
method Conditional generative framework with inverse probability re-weighting.
result Our method outperforms state-of-the-art baselines in generating high-quality counterfactual samples.

The paper proposes a new SDF scaled by time-varying volatility from S&P 500 options.

problem Estimating the SDF from option prices and predicting the equity premium.
method Utilizes S&P 500 options data to recover a stable, non-monotonic SDF.
result The SDF exhibits a hump on the put side, which transitions into a W-shape with maturity.

In a recent work (Chattopadhyay, A. K. et al, Europhys. Lett. {\bf 91}, 58003, 2010) based on food consumption statistics, we showed how a stochastic agent based model could represent the time variation of the income distribution statistics in a developing economy, thereby defining an alternative \enquote{poverty index…

2016-08-18abs ↗pdf ↗

Optimizes decisions in time-varying distributions using online stochastic methods and Wasserstein distance.

problem Optimizing decisions in time-varying distributions using Wasserstein distance.
method Online proximal-gradient method, exact penalty method, constraint-tightening approach.
result Dynamic regret bounds for tracking and estimation error.

Proposes DSW for unbiased ITE estimation with dynamic confounders.

problem Estimating ITE from dynamic observational data with time-varying confounders.
method Deep Sequential Weighting (DSW) infers hidden confounders using current treatment assignments and historical information.
result DSW generates unbiased and accurate treatment effects.

From social networks to Internet applications, a wide variety of electronic communication tools are producing streams of graph data; where the nodes represent users and the edges represent the contacts between them over time. This has led to an increased interest in mechanisms to model the dynamic structure of time-var…

2014-03-14abs ↗pdf ↗

A Longitudinal Attribute-Conditioned Neural Network (LANTERN) framework for modeling health-state transition probabilities in irregular longitudinal data.

problem Estimating long-term care transition probabilities in irregular longitudinal health data.
method A neural network that learns from individual health history, incorporates time elapsed, and conditions on demographic and socioeconomic attributes.
result Improves severe disability discrimination and maintains strong calibration.

The continuous observation of the financial markets has identified some stylized facts which challenge the conventional assumptions, promoting the born of new approaches. On the one hand, the long-range dependence has been faced replacing the traditional Gauss-Wiener process (Brownian motion), characterized by stationa…

2019-03-13abs ↗pdf ↗

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 ↗

Novel unsupervised feature selection method using multi-step Markov transition probability.

problem Neglected relationships between non-adjacent data points in feature selection.
method MMFS (Multi-step Markov transition probability for Feature Selection) approach, employing positive and negative viewpoints.
result MMFS effectively maintains data structure in unsupervised feature selection.

Develops CLTs for Markov chain transition probabilities and policies.

problem Estimating transition probabilities and policies in controlled Markov chains.
method Non-parametric estimator for transition matrices; CLTs for value, Q-, and advantage functions; goodness-of-fit tests.
result Asymptotic normality of estimators under specific logging policies.

Minimal assumptions analysis of Q-learning with time-varying policies.

problem Finite-time analysis of Q-learning with time-varying policies for discounted MDPs.
method Minimal assumptions, Poisson equation decomposition, sensitivity analysis.
result Established convergence rate and sample complexity for Q-learning.

Improves GCNNs with node transition probabilities and DropNode regularization.

problem Over-fitting and over-smoothing issues in GCNNs.
method Message passing based on node transition probabilities and DropNode regularization.
result Improved GCNNs with better node representations and reduced over-fitting and over-smoothing.

Neural networks parameterize time-varying Markov dynamics in financial time series.

problem Estimating Markov transition matrices in high-resolution, high-noise financial data.
method Introduces a neural network framework to generate explicit, time-varying Markov transition matrices, constraining neural outputs to formal stochastic operators.
result Learned operators capture regime shifts, with high-volatility regimes homogenizing transition dynamics.

We propose a neural superstatistics method to estimate dynamic cognitive models from time series data.

problem Memoryless cognitive models ignore parameter fluctuations, leading to inaccurate predictions.
method Developed a simulation-based deep learning method for Bayesian inference of superstatistical models.
result Deep learning method efficiently recovers time-varying and time-invariant parameters.

Meta-learning method for estimating time-varying mHealth intervention effects.

problem Complex mHealth data and uncertain randomization probabilities.
method DR-WCLS meta-learning procedure for causal excursion effects.
result More efficient and consistent estimates of causal excursion effects.

CBNNs model survival with time-varying interactions, outperforming other methods.

problem Complex covariate effects and time-varying interactions in survival analysis.
method Combines case-base sampling with neural networks to model time-varying effects and complex baseline hazards.
result CBNNs outperform regression and neural network-based survival methods in simulations and real data applications.

In banking practice, rating transition matrices have become the standard approach of deriving multi-year probabilities of default (PDs) from one-year PDs, the latter normally being available from Basel ratings. Rating transition matrices have gained in importance with the newly adopted IFRS 9 accounting standard. Here,…

2017-07-31abs ↗pdf ↗

A new method for steering large agent populations efficiently.

problem Controlling the configuration of a swarm of identical, interacting cooperative agents.
method Mean-Field Schrodinger Bridges with Gaussian Mixture Models.
result A highly efficient parameterization to approximate optimal solutions of the MFSB problem in closed form.

This study improves estimation of locally stationary functional time series using NW method.

problem Accurately capturing time-dependence in locally stationary functional time series with time-varying covariates.
method Nadaraya-Watson (NW) estimation procedure for the conditional distribution of LSFTS.
result Established convergence rates of NW estimator for LSFTS with respect to Wasserstein distance.

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.

We describe a generalization of the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM) which is able to encode prior information that state transitions are more likely between "nearby" states. This is accomplished by defining a similarity function on the state space and scaling transition probabilities by pai…

2017-07-21abs ↗pdf ↗

A computational technique borrowed from the physical sciences is introduced to obtain accurate closed-form approximations for the transition probability of arbitrary diffusion processes. Within the path integral framework the same technique allows one to obtain remarkably good approximations of the pricing kernels of f…

2006-02-15abs ↗pdf ↗