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

91181272362 · Jun 202019922001200920172026
48 results for Markov dependence

This paper analyzes RMR under Markov-dependent samples, improving understanding of its generalization error.

problem Understanding the generalization error of RMR in Markov-dependent settings.
method Established the upper bound for RMR estimator under Markov-dependent samples, providing a learning rate.
result Markov dependence affects the generalization error, reducing it by a multiplicative factor of the spectral gap.

We propose a dynamic model of dependence structure between financial institutions within a financial system and we construct measures for dependence and financial instability. Employing Markov structures of joint credit migrations, our model allows for contagious simultaneous jumps in credit ratings and provides flexib…

2018-09-10abs ↗pdf ↗

Estimates binary labels from dependent data using Markov Random Fields.

problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.

Deep learning estimates time-varying Markov model parameters.

problem Estimating time-dependent parameters in Markov models.
method Reframes parameter estimation as an optimization problem using maximum likelihood.
result Real solution close to SDE with neural network-derived parameters under specific conditions.

Unified framework for drawdown risk computation under Markov models.

problem High computational challenges in drawdown risk metrics.
method Unified framework for computing five drawdown quantities under general Markov models, using linear systems and efficient algorithms.
result Efficient algorithms achieve same complexity as path-independent problems, validated by rigorous convergence analysis and extensive experiments.

Estimates dependent parameters using Markovian dependence with shrinkage.

problem Estimating dependent parameters from a hidden Markov model.
method Developed a novel non-parametric shrinkage algorithm combining Tweedie-based ideas and efficient state estimation.
result Superior performance compared to non-shrinkage methods in hidden Markov models.

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rules. The polynomial property allows us to study such rules using …

2017-07-21abs ↗pdf ↗

Paper studies CLT rates for dependent data in Wasserstein-p distance.

problem CLT rates for multivariate dependent data in Wasserstein-p distance.
method Analyzes locally dependent sequences and geometrically ergodic Markov chains.
result Establishes optimal W1W_1 CLT rates and WpW_p (p2p\ge 2) rates for dependent data.

New method identifies nonstationary causal structures in time series data.

problem Identifying causal relationships in time series data that change over time.
method High-order Markov Switching Models for regime-dependent causal discovery.
result Scalable approach for estimating high-order regime-dependent causal structures.

The paper studies how quickly samples from Langevin dynamics become independent.

problem Understanding the dependence between samples along Langevin dynamics and related algorithms.
method Measures dependence via ΦΦ-mutual information and proves strong data processing inequalities.
result The ΦΦ-mutual information between samples decreases exponentially to zero.

The paper analyzes Q-learning in 2-player Markov games and provides gap-dependent logarithmic regret bounds.

problem Analyzing the cumulative regret of Nash Q-learning in 2-player turn-based stochastic Markov games.
method Proposed gap-dependent logarithmic upper bounds for cumulative regret in episodic tabular setting and discounted game setting.
result The proposed bounds match theoretical lower bounds up to a logarithmic term.

New methods improve temporal difference learning for policy evaluation in Markov decision processes.

problem Improving temporal difference learning for policy evaluation in Markov decision processes.
method Introduced variance-reduced forms of stochastic approximation to achieve non-asymptotic, instance-dependent optimality.
result Temporal difference learning is strictly suboptimal, but variance-reduced forms achieve optimality up to logarithmic factors.

CMRFs extend PGMs for topological data, capturing both conditional and marginal dependencies.

problem Limited expressiveness of PGMs for topological data.
method Introducing Colored Markov Random Fields (CMRFs) that model Gaussian edge variables on topological spaces.
result CMRFs improve distributed estimation over physical networks compared to baselines.

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

Study improves generalization bounds for equivariant networks on Markov data.

problem Challenges in integrating equivariance with Markov dependencies in neural networks.
method Applied McDiarmid's inequality and computed covering number using group theory.
result Derived upper bound on Rademacher complexity for equivariant neural networks on Markov datasets.

The paper provides concentration inequalities for Markov chain variance estimators.

problem Estimating the variance of Markov chains with concentration properties.
method Martingale decomposition method for uniformly geometrically ergodic Markov chains.
result Explicit control of the p-th moment of the OBM estimator difference and dependence on p and mixing time.

Study online learning in RKHS with dependent processes, focusing on \(β\)- and \(φ\)-mixing.

problem Online learning in RKHS with dependent data.
method Online regularized learning algorithm in RKHS, analyzing \(β\)- and \(φ\)-mixing sequences.
result Probabilistic upper bounds and convergence rates for mixing coefficients.

Study efficient algorithms for nonconvex optimization with state-dependent Markov data.

problem Stochastic optimization with Markovian data and state-dependent transition kernels.
method Projection-based and projection-free algorithms for constrained nonconvex problems.
result The number of oracle calls to achieve an εε-stationary point is O(1/ε2.5)\mathcal{O}(1/ε^{2.5}).

New model identifies regimes in non-stationary data.

problem Identifying latent regimes in non-stationary systems with instantaneous effects.
method Identifiable Markov Switching Models with exponential family noise.
result Established identifiability of latent regimes and causal structures.

Develops new Markov processes with switching rates and past dependence.

problem Modeling processes with dynamic switching rates and path dependence.
method Introduces a new class of Markov jump processes with regime switching and path dependence. Derives distributional properties and maximum likelihood estimates.
result Maximum likelihood estimates of the process parameters are derived in closed form and have asymptotic normality.

Bayesian context trees capture complex dependencies in categorical sequences.

problem Complex, long-range dependencies in categorical sequences are not well captured by simple models.
method Parsimonious Bayesian context trees with model-based agglomerative clustering for efficient inference.
result The proposed framework outperforms existing models on real-world data.

We prove that the variance swap rate (fair strike) equals the price of a co-terminal European-style contract when the underlying is an exponential Markov process, time-changed by an arbitrary continuous stochastic clock, which has arbitrary correlation with the driving Markov process, provided that the payoff function …

2017-05-02abs ↗pdf ↗

This paper develops statistical models for cryptocurrency returns using hidden Markov regression and copulas.

problem Capturing the interrelationships and serial heterogeneity of cryptocurrency returns.
method Hidden Markov regression models with regime-switching copulas for quantiles and expectiles.
result Captures extreme returns and their temporal evolution through a latent Markov chain.

Develops a new model to track financial market interconnectedness over time.

problem Investigating time-varying financial market interconnectedness.
method Hidden Markov graphical model with state-dependent generalized hyperbolic distributions.
result Identifies different degrees of network connectivity of returns over time.

A new HMM model captures kernel dependencies using context-specific Bayesian networks.

problem Traditional HMMs struggle with non-Gaussian data and independence assumptions.
method Kernel density estimation with context-specific Bayesian networks.
result The proposed model outperforms related HMMs in likelihood and classification accuracy.

This paper analyzes the bias of inexact MCMC methods in high dimensions.

problem Understanding the bias of inexact MCMC methods in high-dimensional spaces.
method Establishing bounds on Wasserstein distances between inexact MCMC methods and target distributions.
result The asymptotic bias of ULA and uHMC depends on key quantities related to the target distribution or the stationary probability measure of the scheme.

The study analyzes a model for aggregate losses with dependent and overdispersed inter-losses times.

problem Analyzing aggregate loss models with dependent and overdispersed inter-losses times.
method The study uses a two-state Markovian arrival process (MAP2) and a Markov renewal process to model the inter-losses times. Severities are modeled using a heavy-tailed, double-Pareto Lognormal distribution. The model is estimated via direct maximization of the likelihood function.
result The model with dependence and overdispersion in inter-losses times leads to higher capital charges compared to a Poisson process.

New volatility model for option pricing with time-varying risk premium.

problem Volatility risk premium is time-varying and not well captured by existing models.
method Combines Markov switching with Realized GARCH framework to derive a state-dependent pricing kernel.
result The model reduces option pricing errors by 15% or more compared to competing models.

Estimates change points in Weibull time series with copulas.

problem Change-point estimation for nonlinear Weibull time series with copula-based Markov models.
method Copula-based Markov chain model with Weibull marginal distributions, incorporating asymmetric dependence structures through Clayton and Joe copulas.
result Proposed method performs well in estimating change points and model parameters, demonstrated through extensive numerical studies and empirical application.

Study nonparametric estimator for Markov chain transition matrices in offline setting.

problem Estimating transition matrices of finite controlled Markov chains from logged data.
method Developed sample complexity bounds and conditions for minimaxity.
result Achieving certain statistical risk requires balancing mixing properties and sample size.

New algorithm improves sample efficiency for zero-sum Markov games.

problem Improving sample efficiency for model-free algorithms in zero-sum Markov games.
method Proposes a model-free stage-based Q-learning algorithm using variance reduction techniques.
result Achieves optimal sample complexity for finding ε-optimal Nash Equilibrium.

Unified framework DDNs for multi-label classification, improving inference efficiency.

problem Efficient inference for multi-label classification with dependency networks.
method Combining dependency networks and deep learning, proposing novel inference schemes.
result Novel inference schemes outperform basic neural architectures and Markov networks.

We define a Hidden Markov Model (HMM) in which each hidden state has time-dependent activity levels\textit{activity levels} that drive transitions and emissions, and show how to estimate its parameters. Our construction is motivated by the problem of inferring human mobility on sub-daily time scales from, for example, mobile phone …

2015-07-27abs ↗pdf ↗

Study best arm identification in restless Markov multi-armed bandits with state-dependent transitions.

problem Identify the best arm in a multi-armed bandit with time-varying states.
method Propose a sequential policy to select arms without knowing their exact TPMs.
result Upper and lower bounds on expected time to find the best arm match in a special case.

The paper improves SMC algorithm for multi-modal distributions by proving variance bounds.

problem Problems with SMC on multi-modal distributions, especially in terms of mixing time.
method Proves variance bounds for SMC on multi-modal distributions using soft decomposition.
result Bounds on SMC variance depend on local rather than global mixing times.