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

78157235313 · May 202619922001200920172026
48 results for serial dependence

The book chapter discusses tail risk analysis for financial data using extreme value statistics.

problem Serial dependence in financial time series complicates tail risk assessment.
method The approach involves unconditional and conditional quantile forecasting.
result Serial dependence impacts multivariate tail dependence.

The paper proposes estimators for bid-ask spreads with and without serial dependence.

problem Estimating bid-ask spreads in financial markets with and without serial dependence.
method The authors propose moment-based estimators for bid-ask spreads, considering both geometric Brownian motion and geometric fractional Brownian motion for price dynamics, and Ornstein-Uhlenbeck process for microstructure noise.
result The estimators are consistent and asymptotically normal, and perform well compared to existing approaches on simulated data.

Algorithm beats best constant rebalancing portfolio in long-term investment.

problem Poor performance of learning algorithms in online portfolio optimization.
method Leverages serial dependence in asset returns without distributional assumptions.
result Strategy asymptotically grows to highest rate among all strategies.

Stochastic momentum methods trade compute efficiency for serial runtime.

problem Stochastic momentum methods trade compute efficiency for serial runtime.
method Stochastic HB and ASGD for consistent linear regression with Gaussian covariates.
result HB preserves SGD-level CE over a larger batch-size window, allowing larger batches to reduce serial runtime until HB reaches its deterministic accelerated scale.

In this paper we investigate the adaptive market efficiency of the agricultural commodity futures market, using a sample of eight futures contracts. Using a battery of nonlinear tests, we uncover the nonlinear serial dependence in the returns series. We run the Hinich portmanteau bicorrelation test to uncover the momen…

2014-12-27abs ↗pdf ↗

Method predicts LFSM increments from past observations using codifference.

problem Forecasting LFSM increments from discrete-time observations.
method Uses codifference for serial dependence, with conditional expectation or projection for α>1α>1 or α<2α<2.
result Method shows promising performance in forecasting volatilities, capturing kurtosis and serial dependence.

Estimates Hurst exponent of log-volatility using KS statistic, addressing serial correlation in financial data.

problem Estimating Hurst exponent of log-volatility in financial time series with serial correlation.
method Proposes a random permutation procedure to remove serial correlation, using the Kolmogorov-Smirnov statistic for distribution-based estimation.
result Establishes the asymptotic variance of the estimator and reveals statistically significant hierarchy of roughness in volatility measures.

mGRN improves multivariate time series prediction by managing marginal and joint memories.

problem Extracting dependencies in multivariate sequential data with strong serial and cross-sectional dependencies.
method Developed a novel recurrent network architecture, Memory-Gated Recurrent Networks (mGRN), with gates for marginal and joint memories.
result mGRN consistently outperforms state-of-the-art architectures on various public datasets.

Complex structures are typical in machine learning. Tailoring learning algorithms for every structure requires an effort that may be saved by defining a generic learning procedure adaptive to any complex structure. In this paper, we propose to map any complex structure onto a generic form, called serialization, over wh…

2019-05-27abs ↗pdf ↗

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.

New rules control false discoveries in online anomaly detection for time series data.

problem Controlling false discoveries in anomaly detection for time series data.
method Novel online false discovery rate control (FDRC) rules for time series anomaly detection.
result Ensures high power in detecting anomalies even when the alternative is rare and test statistics are serially dependent.

We study the impact of volatility on intraday serial correlation, at time scales of less than 20 minutes, exploiting a data set with all transaction on SPX500 futures from 1993 to 2001. We show that, while realized volatility and intraday serial correlation are linked, this relation is driven by unexpected volatility o…

2006-10-03abs ↗pdf ↗

We consider distributed online learning protocols that control the exchange of information between local learners in a round-based learning scenario. The learning performance of such a protocol is intuitively optimal if approximately the same loss is incurred as in a hypothetical serial setting. If a protocol accomplis…

2019-11-28abs ↗pdf ↗

We propose parametric copulas that capture serial dependence in stationary heteroskedastic time series. We develop our copula for first order Markov series, and extend it to higher orders and multivariate series. We derive the copula of a volatility proxy, based on which we propose new measures of volatility dependence…

2017-01-25abs ↗pdf ↗

Practitioners of Bayesian statistics have long depended on Markov chain Monte Carlo (MCMC) to obtain samples from intractable posterior distributions. Unfortunately, MCMC algorithms are typically serial, and do not scale to the large datasets typical of modern machine learning. The recently proposed consensus Monte Car…

2015-06-09abs ↗pdf ↗

MER algorithm speeds up VI solving with Markovian data.

problem Solving stochastic variational inequalities with Markovian data.
method MER algorithm using multi-scale sampling from a Markovian buffer.
result Achieves faster convergence without knowing Markov chain mixing time.

CoT enhances transformer accuracy on serial tasks by enabling serial computation.

problem Improving accuracy of large language models on inherently serial problems.
method Integrating a chain of thought (CoT) into decoder-only transformers to enable serial computation.
result Constant-depth transformers with CoT can solve problems in AC^0, surpassing TC^0 without CoT.

This study revisits Fama-French models using sample innovations to address misinterpretation of high R-squared values.

problem Misinterpretation of high R-squared values in Fama-French models due to serial dependence and volatility clustering.
method Use of sample innovations to derive standard econometrics time series models to overcome misinterpretation.
result Suggests the Fama-French model should consider heavy-tail distributions due to relevant tail behavior in financial data.

In this paper we present an application of the use of autocopulas for modelling financial time series showing serial dependencies that are not necessarily linear. The approach presented here is semi-parametric in that it is characterized by a non-parametric autocopula and parametric marginals. One advantage of using au…

2015-07-16abs ↗pdf ↗

Generative neural networks model multivariate time series data.

problem Modeling cross-sectional dependence in multivariate time series data.
method ARMA-GARCH for serial dependence, PCA for dimensionality reduction, GMMN for cross-sectional dependence.
result GMMN-GARCH approach produces better predictive distributions and probabilistic forecasts.

ParaMonte::Python streamlines Bayesian data analysis with fast Monte Carlo and MCMC routines.

problem Efficiently sampling posterior distributions in Bayesian modeling and data science.
method Serial and MPI-parallelized Markov Chain Monte Carlo (MCMC) routines.
result Automated model calibration and uncertainty quantification in Bayesian analysis.

Modeling financial time series by stochastic processes is a challenging task and a central area of research in financial mathematics. As an alternative, we introduce Quant GANs, a data-driven model which is inspired by the recent success of generative adversarial networks (GANs). Quant GANs consist of a generator and d…

2019-07-15abs ↗pdf ↗

We present a general framework for accelerating a large class of widely used Markov chain Monte Carlo (MCMC) algorithms. Our approach exploits fast, iterative approximations to the target density to speculatively evaluate many potential future steps of the chain in parallel. The approach can accelerate computation of t…

2014-03-28abs ↗pdf ↗

We propose a novel probabilistic model to facilitate the learning of multivariate tail dependence of multiple financial assets. Our method allows one to construct from known random vectors, e.g., standard normal, sophisticated joint heavy-tailed random vectors featuring not only distinct marginal tail heaviness, but al…

2019-05-31abs ↗pdf ↗

Probabilistic method combines space and time uncertainties in PDEs.

problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.

Multi-period measures of risk account for the path that the value of an investment portfolio takes. In the context of probabilistic risk measures, the focus has traditionally been on the magnitude of investment loss and not on the dimension associated with the passage of time. In this paper, the concept of temporal pat…

2015-01-07abs ↗pdf ↗

Quarter-hour market bursts predict algorithmic trading and returns in crypto futures.

problem Predicting returns in cryptocurrency futures markets using quarter-hour market bursts.
method Analysis of trade data and Autocorrelation Map to identify and quantify algorithmic trading activity.
result Quarter-hour market bursts are associated with algorithmic trading and can predict returns.

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.

We discuss martingales, detrending data, and the efficient market hypothesis for stochastic processes x(t) with arbitrary diffusion coefficients D(x,t). Beginning with x-independent drift coefficients R(t) we show that Martingale stochastic processes generate uncorrelated, generally nonstationary increments. Generally,…

2007-01-23abs ↗pdf ↗

This work proposes an efficient autoregressive model for text generation.

problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.

Most of the information is stored as text, so text mining is regarded as having high commercial potential. Aiming at the semantic constraint problem of classification methods based on sparse representation, we propose a weighted recurrent neural network (W-RNN), which can fully extract text serialization semantic infor…

2019-09-28abs ↗pdf ↗

The FSRM uses a multifractional process to capture price multifractality, revealing serial information for forecasting.

problem Capturing multifractal price dynamics for better forecasting.
method Developed a fractional stochastic regularity model based on multifractional processes and information theory.
result The serial information of the regularity process HtH_t can be theoretically determined, aiding in forecasting future price increments.