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

Trend · papers per month

56112167223 · May 202619922001200920172026
48 results for leapfrogging regime

Model predicts alternating market dominance for two competing firms.

problem Alternating market dominance of two competing firms in a competitive market.
method Deterministic model with investment strategy, stability analysis of fixed points, bifurcation diagrams, time-series analysis.
result Leapfrogging regime is stabilized by specific parameter values and high elasticity coefficient.

Lower bounds on MALA and HMC for well-conditioned distributions.

problem Understanding the performance limits of Metropolized sampling methods.
method Analyzing the Metropolis-adjusted Langevin algorithm (MALA) and multi-step Hamiltonian Monte Carlo (HMC) with a leapfrog integrator.
result Nearly-tight lower bound of Ω~(κd)\widetildeΩ(κd) on the mixing time of MALA from an exponentially warm start.

WALNUTS improves sampling efficiency and robustness for multi-scale distributions.

problem Adapting leapfrog step size for multi-scale posterior distributions.
method Adapts leapfrog step size at fixed intervals of simulated time, selecting the largest step size to keep energy error below a threshold.
result Substantial improvements in sampling efficiency and robustness compared to standard NUTS.

HMC with leapfrog integrator mixes faster than MALA under certain smoothness conditions.

problem Analyzing the mixing time of HMC and MALA for sampling from smooth distributions.
method Bounding gradient complexity and leveraging invariance of joint distribution.
result Metropolized HMC with more leapfrog steps outperforms MALA in total variation distance.

A new clustering method improves recovery guarantees by re-embedding data.

problem Improving recovery guarantees in clustering algorithms.
method Chaining four techniques: leapfrog distances, multidimensional scaling, spectral methods, and sum-of-norms clustering.
result Re-embedding data improves recovery guarantees of clustering.

Hamiltonian Monte Carlo on ReLU networks is inefficient due to large local error.

problem Inefficiency of Hamiltonian Monte Carlo on ReLU neural networks.
method Analysis of Hamiltonian Monte Carlo with leapfrog integrator for Bayesian neural network inference.
result Leapfrog HMC for ReLU networks has a large local error rate of Ω(ε)Ω(ε), leading to inefficiency.

We present a novel technique for learning the mass matrices in samplers obtained from discretized dynamics that preserve some energy function. Existing adaptive samplers use Riemannian preconditioning techniques, where the mass matrices are functions of the parameters being sampled. This leads to significant complexiti…

2017-11-06abs ↗pdf ↗

Hamiltonian Monte Carlo (HMC) is a widely deployed method to sample from high-dimensional distributions in Statistics and Machine learning. HMC is known to run very efficiently in practice and its popular second-order "leapfrog" implementation has long been conjectured to run in d1/4d^{1/4} gradient evaluations. Here we …

2018-02-24abs ↗pdf ↗

Hamiltonian Monte Carlo (HMC) exploits Hamiltonian dynamics to construct efficient proposals for Markov chain Monte Carlo (MCMC). In this paper, we present a generalization of HMC which exploits \textit{non-canonical} Hamiltonian dynamics. We refer to this algorithm as magnetic HMC, since in 3 dimensions a subset of th…

2016-07-10abs ↗pdf ↗

New HMC method uses asymmetrical momentum distributions and improves performance.

problem Rigorous convergence guarantees for HMC with Gaussian momentum distributions.
method New convergence analysis for HMC with general asymmetrical momentum distributions, proposing AD-HMC.
result AD-HMC exhibits geometric convergence in Wasserstein distance under certain conditions.

This paper analyzes the convergence of dynamic HMC and NUTS methods.

problem Theoretical understanding of dynamic HMC and NUTS convergence.
method General class of MCMC algorithms, NUTS as a particular case, geometric ergodicity, irreducibility.
result NUTS is geometrically ergodic under certain conditions and ergodic without bounded stepsize.

New method improves sampling efficiency for complex distributions.

problem Sampling from distributions with high condition numbers and constraints.
method Riemannian Hamiltonian Monte Carlo with numerical integrators.
result Convergence rate is independent of condition number and polytope geometry.

The article detects market regimes from covariance matrices using VLSTAR and clustering models.

problem Market regime switching is hard to detect due to time-varying correlation coefficients.
method The article applies VLSTAR and unsupervised hierarchical clustering on monthly realized covariance matrices.
result VLSTAR outperforms clustering in detecting market regimes.

The study identifies and analyzes different market regimes in equity markets using advanced signal processing techniques.

problem Understanding and quantifying the dynamics of different market regimes in equity markets.
method Data-driven Hilbert--Huang Transform for regime identification, Holo--Hilbert Spectral Analysis for profiling, and Variable-Length Markov Chains for return dynamics modeling.
result Developed markets normalize more effectively as stress subsides, while developing markets retain residual tail dependence and downside persistence.

Paper improves asset allocation using machine learning for regime detection.

problem Improving asset allocation strategies in uncertain economic conditions.
method Machine learning for regime detection, modified k-means algorithm, portfolio optimization.
result Significant portfolio performance improvements over traditional benchmarks.

Proposes methods for learning optimal dynamic treatment regimes robust to unconfoundedness violations.

problem Estimating optimal dynamic treatment regimes using historical observational data when unconfoundedness is violated.
method Utilizes proximal causal inference framework to propose three nonparametric identification methods, a (K+1)-robust method, and establish a semiparametric efficiency bound.
result Establishes the (K+1)-robust method for learning optimal dynamic treatment regimes, validating its efficiency and multiple robustness through numerical experiments.

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.

Markov regime switching models have been used in numerous empirical studies in economics and finance. However, the asymptotic distribution of the likelihood ratio test statistic for testing the number of regimes in Markov regime switching models has been an unresolved problem. This paper derives the asymptotic distribu…

2018-01-21abs ↗pdf ↗

RegimeFolio optimizes portfolios by adapting to changing market regimes.

problem Non-stationary markets with shifting volatility regimes.
method Explicitly models volatility regimes with sector-specific ensemble forecasting and adaptive mean-variance allocation.
result Significant improvement in return and robustness compared to conventional methods.

Enhances portfolio construction with tailored regime forecasts for individual assets.

problem Traditional portfolio construction methods fail to account for asset-specific market conditions.
method Hybrid framework combining unsupervised and supervised learning for regime identification and forecasting.
result Outperforms traditional portfolio models across various asset classes.

Unified formula for training dynamics of linear networks combining lazy and balanced regimes.

problem Training dynamics of linear networks in two distinct setups: lazy and balanced/active.
method Unified formula for the evolution of the learned matrix, combining lazy and balanced regimes.
result Unified formula allows for rapid convergence and low rank bias, proving a complete phase diagram.

RAMBO optimizes multi-regime problems by discovering and modeling distinct energy basins.

problem Multi-regime problems in molecular conformation and drug discovery.
method Dirichlet Process Mixture of Gaussian Processes with adaptive hyperparameters and concentration parameters.
result Consistent improvements over state-of-the-art on multi-regime objectives.

This paper improves risk control for financial markets by calibrating VaR forecasts using conformal methods.

problem Nonstationary and regime-dependent losses in financial markets.
method Regime-weighted conformal risk control (RWC) for VaR forecasting.
result RWC improves regime-conditional stability in some settings with modest conservativeness changes.

ReCAP adapts to dynamic financial markets by segmenting and combining policy vectors.

problem Inefficient traditional PM approaches in non-stationary financial markets.
method Integrates continual learning into PM, segmenting regimes and adapting policies.
result Consistently outperforms baselines in real-world financial datasets.

Study improves S&P 500 volatility forecasting through regime-switching methods.

problem Accurate prediction of S&P 500 volatility for risk management and investment.
method Regime-switching methods including soft Markov switching, spectral clustering, and coefficient-based clustering.
result Coefficient-based clustering algorithm outperformed other models during all time periods.

Enhanced regime shifts detection using unstructured text and financial data.

problem Detecting regime shifts in financial markets is challenging due to noisy and multicollinear data.
method Combines LLM reasoning on unstructured text and statistical validation on financial time series.
result Framework achieves F1 score of 0.82, outperforming pure data-driven methods.

DeRegiME forecasts with regime structure, improving probabilistic predictions across various time series.

problem Probabilistic forecasting discards residual uncertainty, and distribution shifts are hard to capture.
method DeRegiME uses a sparse variational Gaussian process with a nonstationary regime-mixing kernel to separate latent uncertainty regimes.
result DeRegiME improves NLPD by 20.3% on average across benchmarks, with gains on CRPS and MSE.

A new method improves actor-critic RL by integrating HMC, enhancing policy distribution and exploration.

problem Actor-critic RL yields suboptimal policies due to amortization gap and insufficient exploration.
method Integrating Hamiltonian Monte Carlo (HMC) into the actor-critic RL framework.
result Improves policy distribution and exploration, leading to better policy estimates and higher returns.

Study optimal liquidation with multiple regimes using BSDEs with singular terminal values.

problem Optimal liquidation with regime switching in dark pools.
method Introduced a system of BSDEs with jumps and singular terminal values.
result Existence and uniqueness results for the BSDE system are obtained.

Develops a new model to better predict corporate bond yields.

problem Persistent shifts in interest rates undermine single-regime models.
method Regime-switching generalized CIR model with two-state short-rate process and credit factors.
result The model improves joint curve fit and delivers interpretable probabilities.

Study of two-layer ReLU neural network phase diagram at infinite-width limit.

problem Characterize the dynamical regimes of two-layer ReLU neural networks.
method Combining experimental and theoretical approaches, including phase diagram analogy.
result Identification of three regimes: linear, critical, and condensed.

MARCD uses generative scenarios to improve portfolio decisions during regime shifts.

problem Improving portfolio decisions under regime shifts and drawdowns.
method MARCD employs a Gaussian HMM for regime inference, a diffusion generator for scenario production, and a CVaR allocator with tail-weighted and crisis-aware components.
result MARCD reduces maximum drawdowns by 34% compared to baseline methods over 2020-2025.

Investigates JM for reducing downside risk in market regimes.

problem Mitigating downside risk during market downturns.
method Statistical jump model for identifying market regimes, optimizing penalty for state transitions.
result JM-guided strategies outperform traditional models in reducing risk and enhancing returns.

New algorithm ensures global convergence in deep neural networks beyond NTK regime.

problem Existing global convergence guarantees do not apply to practical deep networks.
method Proposes an algorithm with global convergence guarantees under the expressivity condition.
result Algorithm ensures global convergence in practical settings beyond NTK regime.