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.

169,291 papers · 148 categories

Trend · papers per month

22436586 · May 202619922001200920182026
48 results for Moving Window MCEM

New method improves inference in deep Gaussian processes.

problem Intractable exact inference in deep Gaussian processes.
method Stochastic Gradient Hamiltonian Monte Carlo (SGHMC) with Moving Window MCEM.
result Significantly better predictions at lower computational cost.

Simple soft sensor models improve prediction accuracy with small moving windows.

problem Improving prediction accuracy in soft sensing processes with limited historical data.
method Five simple soft sensor methodologies with small moving windows were compared.
result Small moving window sizes led to the lowest prediction errors for all methods.

Optimal weight windows are found by projecting the origin onto a convex polytope.

problem Finding the best weight windows for a weighted moving average smoother.
method Formulated as a quadratic program and projection onto a convex polytope.
result Optimal weight windows are symmetrical and decrease in weight away from the center.

Study improves portfolio optimization for Indonesian banks using robust methods.

problem Uncertainty in historical return and risk estimates leads to suboptimal portfolios.
method Robust optimization with moving-window and bootstrapping methods.
result Moving-window method with smaller risk-aversion parameter provides better risk-return trade-off.

Efficient method for pricing Bermudan moving average options using GPR-GHQ.

problem High-dimensional pricing of Bermudan moving average options in energy markets.
method Gaussian Process Regression and Gauss-Hermite quadrature.
result GPR-GHQ method efficiently handles long windows and high dimensionality.

The Hurst exponent HH of long range correlated series can be estimated by means of the Detrending Moving Average (DMA) method. A computational tool defined within the algorithm is the generalized variance σDMA2=1/(Nn)i[y(i)y~n(i)]2 σ_{DMA}^2={1}/{(N-n)}\sum_i [y(i)-\widetilde{y}_n(i)]^2\:, with y~n(i)=1/nky(ik)\widetilde{y}_n(i)= {1}/{n}\sum_{k}y(i-k) the…

2006-08-31abs ↗pdf ↗

The detrending moving average (DMA) algorithm is a widely used technique to quantify the long-term correlations of non-stationary time series and the long-range correlations of fractal surfaces, which contains a parameter θθ determining the position of the detrending window. We develop multifractal detrending moving a…

2010-05-06abs ↗pdf ↗

We study the dynamic evolution of cross-correlations in the Chinese stock market mainly based on the random matrix theory (RMT). The correlation matrices constructed from the return series of 367 A-share stocks traded on the Shanghai Stock Exchange from January 4, 1999 to December 30, 2011 are calculated over a moving …

2013-08-06abs ↗pdf ↗

Simple GBRT model improved by window-based input transformation outperforms state-of-the-art deep learning models.

problem Improving performance of traditional forecasting models for time series data.
method Transformed GBRT model input structure to include target values and external features, forming one input instance per training window.
result Simple GBRT model with window-based input transformation outperformed state-of-the-art deep learning models on nine datasets.

New method estimates animal density using acoustic data, accounting for unknown call identities.

problem Estimating animal density or call density from acoustic data with unknown call identities.
method Monte Carlo Expectation-Maximization (MCEM) method to resolve unknown call identities.
result Estimates are within 15% of expert-constructed estimates and incorporate uncertainty about call identities.

Adaptive beamforming collapses in highly non-stationary environments, but the Universal Switching Beamformer resolves this by dynamically adjusting memory length.

problem Adaptive beamforming performance degrades in highly non-stationary environments.
method Integrating sequential prediction into the beamforming architecture.
result The USB achieves agility and precision in tracking highly non-stationary scenes.

Acoustic sensors identify vehicles using spectral embedding.

problem Vehicle recognition from roadside audio sensors.
method Extract frequency signatures, apply spectral embedding for dimensionality reduction.
result K-nearest neighbors achieve accurate vehicle identification after dimensionality reduction.

FOCuS detects changes in mean from high-frequency data efficiently.

problem Detecting changes in high-frequency data with limited resources.
method FOCuS algorithm that runs multiple window sizes and change sizes simultaneously.
result FOCuS achieves state-of-the-art performance in detecting anomalies.

This study optimizes trading strategy parameters using walk-forward techniques and finds robust performance.

problem Optimizing trading strategy performance through parameter optimization.
method Walk-forward optimization with varying window lengths, tested on Bitcoin, Binance Coin, and Ethereum.
result The strategy outperforms Buy-and-Hold with lower drawdown and higher Information Ratio.

The paper develops a neural network-based method for detecting change points in large-scale time-evolving data.

problem Detecting and locating change points in multivariate time-evolving data.
method Two-step procedure involving neural network training and test error function calibration over moving windows.
result Consistent estimates for the number and locations of change points under temporal dependence.

A new method corrects bias in machine learning for trading by filtering out non-executable prices.

problem Contaminated data from price limits causes misleading performance metrics in trading models.
method Mask-first design with tradability filters, GPU optimization, and penalized losses.
result The system achieves Sharpe ratios of 1.63 on real data, significantly outperforming existing methods.

Optimal weight windows are symmetric rectangles centered at peak.

problem Finding the best weight windows for weighted least squares.
method Investigated symmetric and tapered rectangle window weights, showing the best rectangle window is optimal.
result The best rectangle window is optimal for all tapered rectangle window definitions.

A deep generative model is developed for representation and analysis of images, based on a hierarchical convolutional dictionary-learning framework. Stochastic {\em unpooling} is employed to link consecutive layers in the model, yielding top-down image generation. A Bayesian support vector machine is linked to the top-…

2015-12-23abs ↗pdf ↗

The Black-Scholes theory of option pricing has been considered for many years as an important but very approximate zeroth-order description of actual market behavior. We generalize the functional form of the diffusion of these systems and also consider multi-factor models including stochastic volatility. Daily Eurodoll…

2000-01-23abs ↗pdf ↗

Automatically identifies vehicles from audio sensors without needing labeled data.

problem Vehicle recognition and classification from acoustic signals.
method Incremental reseeding of acoustic signatures using spectral embedding and clustering.
result Incremental reseeding accurately identifies individual vehicles from their acoustic signatures.

The study improves VaR forecast accuracy by modeling conditional quantile dynamics.

problem Improving the accuracy of Value-at-Risk (VaR) forecasts for time-varying quantiles.
method Time-varying modeling of VaR, evaluation via simulation, asymmetric Mean Absolute Deviation loss function.
result Substantial improvements in forecasting conditional quantiles by maintaining predicted quantile unchanged.

A new method selects regions of interest in GC-MS data without prior target selection.

problem Challenges in GC-MS data analysis due to fragmentation and shared fragment ions.
method Uses a pseudo F-ratio moving window (ψψFRMV) to automatically select regions of interest.
result Algorithm can accurately identify signal regions in GC-MS data.

Develops an efficient online robust PCA method for big data.

problem Efficiency and robustness in processing big data with changing subspaces.
method Online moving window robust principal component analysis (OMWRPCA) with change point detection.
result Successfully tracks both slowly and abruptly changing subspaces and detects change points.

Financial markets are complex adaptive systems, and are commonly studied as complex networks. Most of such studies fall short in two respects: they do not account for non-linearity of the studied relationships, and they create one network for the whole studied time series, providing an average picture of a very long, e…

2014-09-30abs ↗pdf ↗

Study compares GARCH, EWMA, and IV models for GBP/USD and EUR/GBP currency pairs.

problem Predicting 20-day variation in GBP/USD and EUR/GBP currency pairs.
method Applied GARCH, EWMA, and IV models to GBP/USD and EUR/GBP pairs data.
result GARCH models outperform other models in predicting volatility for EUR/GBP, while GARCH with rolling window for GBP/USD.

ARIMA model shows promise for short-term Bitcoin price prediction but fails for long-term predictions.

problem Predicting Bitcoin's future price using ARIMA model.
method Traditional ARIMA model applied to Bitcoin price time series.
result ARIMA model performs well for short-term predictions but poorly for long-term predictions due to its inability to capture sharp price fluctuations.

Study examines how institutional differences and crises affect volatility in ASEAN stock markets.

problem Understanding how institutional differences and crises impact volatility in emerging Asian stock markets.
method By-window EGARCH/TGARCH analysis of daily stock index returns for Indonesia, Malaysia, and the Philippines from 2010 to 2024.
result All three markets show strong volatility persistence and fat-tailed returns; crises increase persistence and asymmetry, while tail thickness rises.

Study fusion methods for financial image views to improve robustness against attacks.

problem Improving robustness of financial image views for next-day direction prediction.
method Same-source multi-view learning with early fusion and late fusion, using OHLCV and technical-indicator views, and evaluating pixel-space L-infinity attacks.
result Early fusion can suffer negative transfer under noisy settings, while late fusion is more reliable once labels stabilize.

Entropy measure assesses market volatility and price heterogeneity.

problem Quantifying short-term market heterogeneity in financial time series.
method Entropy measure based on intersecting a random sequence with its moving average.
result Entropy of volatility series varies by market, while price series is market-invariant.

Hybrid pipeline detects spike-and-wave discharges in long-term EEG recordings.

problem Manual identification of spike-and-wave discharges in long-term EEG recordings is labour-intensive and error-prone.
method A hybrid pipeline that combines analytical features with a shallow ANN for SWD detection.
result The method correctly detected 384 out of 392 annotated SWD events, achieving high sensitivity and specificity.