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

5101520 · Nov 201919922001200920172026
48 results for switching ARCH

A new network log-ARCH model improves stock market volatility forecasting.

problem Improving stock market volatility forecasting accuracy.
method Dynamic network autoregressive conditional heteroscedasticity (ARCH) model integrating lagged and adjacent node volatility information.
result The model shows significant improvements in forecasting accuracy compared to univariate log-ARCH models.

New model improves volatility forecasting by reducing overestimation and underestimation.

problem SVR-GARCH model overestimates or underestimates volatility, hindering peak or trough behaviors.
method Proposes blending ARCH and augmented blending-ARCH models to improve volatility forecasting.
result Empirical results show improved volatility forecasting ability.

Auto-regressive conditionally heteroskedastic (ARCH) family models are still used, by practitioners in business and economic policy making, as a conditional volatility forecasting models. Furthermore ARCH models still are attracting an interest of the researchers. In this contribution we consider the well known GARCH(1…

2014-12-19abs ↗pdf ↗

The covariance matrix is formulated in the framework of a linear multivariate ARCH process with long memory, where the natural cross product structure of the covariance is generalized by adding two linear terms with their respective parameter. The residuals of the linear ARCH process are computed using historical data …

2009-03-09abs ↗pdf ↗

The ARCH process (R. F. Engle, 1982) constitutes a paradigmatic generator of stochastic time series with time-dependent variance like it appears on a wide broad of systems besides economics in which ARCH was born. Although the ARCH process captures the so-called "volatility clustering" and the asymptotic power-law prob…

2007-05-23abs ↗pdf ↗

Engle's ARCH algorithm is a generator of stochastic time series for financial returns (and similar quantities) characterized by a time-dependent variance. It involves a memory parameter bb (b=0b=0 corresponds to {\it no memory}), and the noise is currently chosen to be Gaussian. We assume here a generalized noise, name…

2004-01-12abs ↗pdf ↗

This note develops a stochastic model of asset volatility. The volatility obeys a continuous-time autoregressive equation. Conditions under which the process is asymptotically stationary and possesses long memory are characterised. Connections with the class of ARCH(\infty) processes are sketched.

2012-02-24abs ↗pdf ↗

This paper presents the R package MCS which implements the Model Confidence Set (MCS) procedure recently developed by Hansen et al. (2011). The Hansen's procedure consists on a sequence of tests which permits to construct a set of 'superior' models, where the null hypothesis of Equal Predictive Ability (EPA) is not rej…

2014-10-30abs ↗pdf ↗

By Markowitz geometry we mean the intersection theory of ellipsoids and affine subspaces in a real finite-dimensional linear space. In the paper we give a meticulous and self-contained treatment of this arch-classical subject, which lays a solid mathematical groundwork of Markowitz mean-variance theory of efficient por…

2017-07-12abs ↗pdf ↗

In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …

2016-08-22abs ↗pdf ↗

This work extends identifiability analysis to sequential latent variable models, focusing on Switching Dynamical Systems.

problem Identifying latent variables in sequential data models.
method Proved identifiability of Markov Switching Models and established conditions for Switching Dynamical Systems.
result Identifiability of latent variables and non-linear mappings in Switching Dynamical Systems up to affine transformations.

The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…

2014-11-17abs ↗pdf ↗

Code-switching, the alternation of languages within a conversation or utterance, is a common communicative phenomenon that occurs in multilingual communities across the world. This survey reviews computational approaches for code-switched Speech and Natural Language Processing. We motivate why processing code-switched …

2019-03-25abs ↗pdf ↗

Study approximates financial market with discrete-time models.

problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.

This paper studies deep learning methodologies for portfolio optimization in the US equities market. We present a novel residual switching network that can automatically sense changes in market regimes and switch between momentum and reversal predictors accordingly. The residual switching network architecture combines …

2019-10-16abs ↗pdf ↗

We continue our study of ends non-compact manifolds. The over-arching aim is to provide an appropriate generalization of Siebenmann's famous collaring theorem that applies to manifolds having non-stable fundamental group systems at infinity. In this paper a primary goal is finally achieved; namely, a complete character…

2005-05-24abs ↗pdf ↗

Optimizes control of hybrid systems with multiple switching processes.

problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.

New algorithm learns switching dynamics from multiple neural signals.

problem Learning accurate switching dynamical system models from multimodal neural data.
method Unsupervised learning algorithm for multiscale switching dynamical system models.
result Switching multiscale dynamical system models outperform single-scale models in behavior decoding.

Paper tackles utility maximization with job-switching and retirement constraints.

problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.

Solves label switching in mixture models using optimal transport.

problem Label switching in mixture model posterior inference prevents meaningful statistics assessment.
method Proposes an algorithm leveraging optimal transport to compute posterior statistics in a quotient space.
result Demonstrates advantages over alternative approaches on simulated and real data.

New RL algorithm reduces policy switching cost to loglog(T) with similar regret.

problem Low policy switching cost in real-life RL applications.
method Stage-wise exploration and adaptive policy elimination.
result Regret of O(HSAloglogT)O(HSA \log\log T) with O(HSAloglogT)O(HSA \log\log T) switching cost.

The paper explores dynamic regret with switching cost in online decision making.

problem The relation between dynamic regret and switching cost in online decision making.
method Investigates two classic online settings: Online Algorithms (OA) and Online Convex Optimization (OCO). Provides a new theoretical analysis framework.
result The switching cost impacts dynamic regret differently in OA and has no impact in OCO.

Paper presents an efficient algorithm for linear MDP with low switching cost.

problem Large state space reinforcement learning problems with low switching cost.
method First algorithm for linear MDP with low switching cost, achieving near-optimal regret and switching cost.
result Regret bound of $\widetilde{O}\left(\sqrt{d^3H^4K} ight)$ and near-optimal switching cost of $O\left(d H\log K ight)$.

Study strategic competition in commodity markets using impulse-switching controls.

problem Strategic competition between upstream and downstream firms in commodity markets.
method Non-zero-sum stochastic differential game with mixed impulse/switching controls.
result Multiple Nash equilibria found, depending on the number of switches by the downstream firm.