There are a number of situations in which several signals are simultaneously recorded in complex systems, which exhibit long-term power-law cross-correlations. The multifractal detrended cross-correlation analysis (MF-DCCA) approaches can be used to quantify such cross-correlations, such as the MF-DCCA based on detrend…
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
48 results for “DMA method”
The Hurst exponent 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 , with the…
Bayesian model averaging has become a widely used approach to accounting for uncertainty about the structural form of the model generating the data. When data arrive sequentially and the generating model can change over time, Dynamic Model Averaging (DMA) extends model averaging to deal with this situation. Often in ma…
The paper analyzes long-range correlations in bond markets using DMA method.
problem Understanding long-range auto- and cross-correlations in bond markets.
method Detrended Moving Average (DMA) method and complex network analysis.
result Long-range correlations in bond markets are persistent and show market segmentation.
A new method for direct determination of multifractal spectrum from moving average analysis.
problem Direct determination of multifractal spectrum from moving average analysis.
method Proposes a new approach based on detrending moving average method (MF-DMA) to directly determine multifractal spectrum.
result Direct determination of multifractal spectrum is possible with less computation cost compared to traditional approach.
We extend our previous study of scaling range properties done for detrended fluctuation analysis (DFA) \cite{former_paper} to other techniques of fluctuation analysis (FA). The new technique called Modified Detrended Moving Average Analysis (MDMA) is introduced and its scaling range properties are examined and compared…
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…
The detrending moving average (DMA) algorithm is one of the best performing methods to quantify the long-term correlations in nonstationary time series. Many long-term correlated time series in real systems contain various trends. We investigate the effects of polynomial trends on the scaling behaviors and the performa…
Paper proposes a new framework for robust multi-modal data fusion under uncertainty.
problem Unexpected modality failures in nonlinear non-Gaussian dynamic processes.
method Dynamic model averaging (DMA) based particle filter (PF) algorithm.
result The proposed solution outperforms state-of-the-art methods in experiments.
Study finds intrinsic multifractality in maize and barley spot markets, but not in wheat and rice.
problem Understanding the complex price behavior of global grain spot markets.
method Utilized multifractal fluctuation analysis (MF-DFA) to investigate intrinsic multifractality.
result Intrinsic multifractality found in maize and barley sub-indices, but not in wheat and rice.
We perform detrending moving average analysis (DMA) and detrended fluctuation analysis (DFA) of the WTI crude oil futures prices (1983-2012) to investigate its efficiency. We further put forward a strict statistical test in the spirit of bootstrapping to verify the weak-form market efficiency hypothesis by employing th…
Let be a compact Kähler manifold. We introduce and study the largest set of -plurisubharmonic (psh) functions on which the complex Monge-Ampère operator is well defined. It is much larger than the corresponding local domain of definition, though still a proper subset of the set $PSH(X,\om)$ of all…
Comparing the performance of FA, DFA and DMA using different synthetic long-range correlated time seriesphysics.data-an
Notwithstanding the significant efforts to develop estimators of long-range correlations (LRC) and to compare their performance, no clear consensus exists on what is the best method and under which conditions. In addition, synthetic tests suggest that the performance of LRC estimators varies when using different genera…
In this paper we have analyzed scaling properties of time series of stock market indices (SMIs) of developing economies of Western Balkans, and have compared the results we have obtained with the results from more developed economies. We have used three different techniques of data analysis to obtain and verify our fin…
In this paper, we show how the sampling properties of the Hurst exponent methods of estimation change with the presence of heavy tails. We run extensive Monte Carlo simulations to find out how rescaled range analysis (R/S), multifractal detrended fluctuation analysis (MF-DFA), detrending moving average (DMA) and genera…
Study finds multifractal cross-correlations between agricultural markets and external uncertainties.
problem Investigating relationships between agricultural spot markets and external uncertainties.
method Multifractal detrending moving-average cross-correlation analysis (MF-X-DMA).
result Maize exhibits intrinsic joint multifractality with all uncertainty proxies.
Intertrade duration of equities is an important financial measure characterizing the trading activities, which is defined as the waiting time between successive trades of an equity. Using the ultrahigh-frequency data of a liquid Chinese stock and its associated warrant, we perform a comparative investigation of the sta…
swTVM: Towards Optimized Tensor Code Generation for Deep Learning on Sunway Many-Core Processorcs.LG
swTVM optimizes deep learning code for Sunway processors.
problem Efficiently compiling deep learning models for Sunway processors.
method Extends TVM to support Sunway, leveraging architecture features.
result 1.79x improvement on average across benchmarks.
Improved iterative methods for risk parity portfolio weights.
problem Solving for portfolio weights in risk parity allocation.
method Enhanced CCD and Newton methods, including a rescaling step and improved initial guess.
result Improved CCD method is the best, three times faster with 40% fewer iterations.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
A new method combines Laplace and Variational Bayes for scalable inference.
problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
problem Calibration of prediction intervals in regression problems.
method Four classes of methods: Bayesian, ensemble, direct interval estimation, and conformal prediction.
result Conformal prediction can be used as a general calibration procedure.
Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
Develops a fast method for pricing American options under variance gamma model.
problem Inefficient methods for pricing American options under variance gamma model.
method Inspired by quadratic approximation method, uses machine learning on pre-calculated quantities to reduce error.
result Proposed method is efficient and accurate for practical use.
Pricing Derivatives under Multiple Stochastic Factors by Localized Radial Basis Function Methodsq-fin.CP
Two RBF methods solve complex financial derivatives pricing problems.
problem Pricing derivatives in models with multiple stochastic factors.
method Radial Basis Function Partition of Unity and Radial Basis Function generated Finite Differences methods.
result Both methods achieve high accuracy and are efficient for solving multi-dimensional PDEs.
New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
Simple stochastic Newton and cubic Newton methods with fast convergence.
problem Minimizing large numbers of smooth and strongly convex functions.
method Stochastic Newton and cubic Newton methods with simple local linear-quadratic rates.
result Local linear-quadratic convergence results with fast adaptation to problem's curvature.
Improved spectral methods of moments for robust latent variable model learning.
problem Limited robustness of spectral methods of moments to model misspecification.
method Hierarchical approach using approximate joint diagonalization instead of tensor decomposition.
result Our method outperforms previous tensor decomposition methods in speed and model quality.
VAN method optimizes learning tasks with unified methods.
problem Optimizing learning tasks in active and reinforcement learning.
method Variational Adaptive-Newton method that unifies optimization, inference, and evolution strategies.
result VAN performs well on various learning tasks.
A Large-Scale Comparative Analysis of Imputation Methods for Single-Cell RNA Sequencing Dataq-bio.GN
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.
New methods using natural gradient for structured optimization.
problem Structured optimization problems.
method Structured second-order methods via natural gradient descent.
result Efficiency demonstrated on non-convex and deep learning problems.
Improved A2C method with lower variance.
problem Reducing variance in deep policy gradient methods.
method Using control variate theory, derived a new A2C formulation with lower variance.
result New A2C method has lower variance and improved performance.
Unified Convergence Analysis of Stochastic Momentum Methods for Convex and Non-convex Optimizationmath.OC
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
A new method speeds up deep neural network training.
problem Nonconvex optimization in deep neural networks.
method Scaled conjugate gradient method for nonconvex optimization.
result The method converges faster and achieves lower scores in practical applications.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
problem Shape optimization problems
method Nonlinear conjugate gradient methods
result NCG methods are efficient for shape optimization
Uncertainty Aware Trader-Company Method: Interpretable Stock Price Prediction Capturing Uncertaintyq-fin.CP
Proposes UTC method for stock price prediction with uncertainty quantification.
problem Lack of uncertainty estimates in stock prediction methods.
method Combines TC method with probabilistic modeling for point and uncertainty predictions.
result UTC method achieves higher returns and lower risks than baselines.
Various approaches to gene selection for cancer classification based on microarray data can be found in the literature and they may be grouped into two categories: univariate methods and multivariate methods. Univariate methods look at each gene in the data in isolation from others. They measure the contribution of a p…
Survey of spectral, probabilistic, and deep metric learning methods.
problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.
Geometric methods study 3-manifold splittings.
problem Studying Heegaard splittings of 3-manifolds.
method Geometric approaches.
result Recent advances in geometric methods.
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.
New method improves accuracy in computing implied volatility.
problem Computing implied volatility from the Black-Scholes model.
method Adaptive gradient descent optimizers for numerical computation.
result More accurate results compared to close form approximation and Newton-Raphson method.
The paper examines Wiener process for LID estimation methods.
problem Estimating local intrinsic dimension in high-dimensional datasets.
method Investigates recent LID estimation methods from a Wiener process perspective.
result Explains how methods behave under non-ideal conditions.
Discuss ML methods for economists, highlighting better performance in econometrics.
problem Applying ML methods to econometrics problems.
method Supervised and unsupervised learning methods, matrix completion, causal inference, optimal policy estimation.
result ML methods often outperform traditional econometric methods in specific econometrics problems.
New method detects business-relevant outliers in e-commerce conversion rates.
problem Identifying outliers in e-commerce conversion rate data.
method A novel unsupervised fluid IQR method that adjusts sensitivity based on platform activity.
result Fluid IQR method outperforms existing methods in business-relevance and robustness.
Saliency methods often misattribute predictions due to input transformations.
problem Saliency methods lack reliability when explanations are sensitive to non-contributing factors.
method Used a simple pre-processing step to demonstrate that transformations with no effect on the model can cause misleading attributions.
result Saliency methods that do not satisfy input invariance (mirror model sensitivity to input transformations) result in misleading attributions.