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

127253380506 · Jun 202019922001200920172026
48 results for root mean squared error

A new method simulates square-root processes efficiently.

problem Simulating square-root processes accurately and efficiently.
method Simulate the integrated square-root process instead of the square-root process itself.
result High precision with low number of time steps, and exact limiting Inverse Gaussian distributions.

This paper uses GAN and ERMSE to improve stock price movement prediction accuracy.

problem Predicting stock price movement direction is challenging due to complex, incomplete, and fuzzy information.
method The paper proposes a deep learning model using GAN and ERMSE to forecast stock market trends.
result The GAN model outperformed LSTM in predicting stock price movement direction with a 4.35% improvement.

Optimal stock price prediction model using recurrent neural networks with RMSprop optimizer.

problem Stock price prediction using neural networks.
method Comparison of fully connected, convolutional, and recurrent architectures; inclusion of three optimization techniques.
result Single layer recurrent neural network with RMSprop optimizer produces optimal results with validation and test MAE of 0.0150 and 0.0148 respectively.

Novel approach integrates Multivariate Square-root Lasso into Synthetic Control for high-dimensional data.

problem Challenges in practical implementation and computational efficiency of Synthetic Control method for high-dimensional disaggregated data.
method Integrates Multivariate Square-root Lasso into Synthetic Control framework.
result Demonstrates superior computational efficiency without compromising estimation accuracy.

Agent-based market shows herding cycles with square-root price impact.

problem Understanding herding cycles in agent-based markets.
method Agent-based model with 20,000 retail traders interacting with a single institutional agent.
result Agent discovers multi-cycle predatory strategy with 8-11 complete cycles over 2000 trading days.

Study compares machine learning algorithms for predicting SST in the Great Barrier Reef.

problem Predicting sea surface temperature in the Great Barrier Reef region.
method Ridge regression, LASSO, Random Forest, and Extreme Gradient Boosting (XGBoost) algorithms were evaluated.
result XGBoost significantly outperforms other algorithms in terms of predictive accuracy and Kullback-Leibler Divergence.

We apply an asymmetric version of Kirman's herding model to volatile financial markets. In the relation between returns and agent concentration we use the square root law proposed by Zhang. This can be derived by extending the idea of a critical mean field theory suggested by Plerou et al. We show that this model is eq…

2005-08-12abs ↗pdf ↗

JULIA combines multi-linear and nonlinear models for tensor completion.

problem Complex patterns in real-world tensors require a unified model.
method JULIA unifies multi-linear and nonlinear models with flexible component assignment and efficient alternating optimization.
result JULIA outperforms existing methods in large-scale tensor completion.

Transformer model predicts stock prices in Bangladesh's stock market.

problem Predicting volatile stock prices in the Bangladesh stock market.
method Transformer model applied to time series data for stock price prediction.
result Transformer model shows promising results in predicting stock price movements.

Layer normalization (LayerNorm) has been successfully applied to various deep neural networks to help stabilize training and boost model convergence because of its capability in handling re-centering and re-scaling of both inputs and weight matrix. However, the computational overhead introduced by LayerNorm makes these…

2019-10-16abs ↗pdf ↗

We study the stability vis a vis adversarial noise of matrix factorization algorithm for matrix completion. In particular, our results include: (I) we bound the gap between the solution matrix of the factorization method and the ground truth in terms of root mean square error; (II) we treat the matrix factorization as …

2012-06-18abs ↗pdf ↗

Enhanced ensemble filters use machine learning to improve accuracy in filtering models.

problem Accuracy limitations of traditional ensemble Kalman filters.
method Introduces a measure neural mapping (MNM) to map joint predicted state and observation to updated state estimates.
result Superior root-mean-square-error performance compared to leading methods in filtering models.

A new sparse benchmark metabench identifies key abilities from large benchmarks.

problem Redundancy and compression in existing benchmarks.
method Data from 5000+ LLMs to identify most informative items, distilling a sparse benchmark.
result Sparse benchmark metabench captures underlying abilities with high accuracy.

Efficiently computes matrix square roots and their inverses for large matrices.

problem Computing matrix square roots and inverses for large matrices efficiently.
method Combines Krylov subspace methods with rational approximation for quadratic-time computation.
result Achieves 4 decimal places of accuracy with fewer than 100 matrix-vector multiplications.

Hybrid QML model improves recovery rate prediction accuracy.

problem Complex nonlinear dependencies, high-dimensional feature spaces, and limited sample sizes in recovery rate forecasting.
method Hybrid Quantum Machine Learning (QML) with Amplitude Encoding, leveraging PQC and qubit data compression.
result Significantly lower RMSE (0.228) compared to classical models.

Study differential properties of matrix square roots in specific cases.

problem Understanding matrix square roots in semi-simple, symmetric, and orthogonal cases.
method Analysis of differential and metric structures of real square roots of matrices under specific conditions.
result Differential properties of matrix square roots in semi-simple, symmetric, and orthogonal cases.

New model identifies patient-specific disease root causes.

problem Identifying root causes of complex diseases varying between patients.
method Generalized Root Causal Inference (GRCI) algorithm for heteroscedastic noise model.
result GRCI accurately extracts patient-specific root causes.

Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to compute the inverse or inverse square root of a matrix whose size is quadratic of …

2018-04-16abs ↗pdf ↗

This paper presents a general framework for norm-based capacity control for Lp,qL_{p,q} weight normalized deep neural networks. We establish the upper bound on the Rademacher complexities of this family. With an Lp,qL_{p,q} normalization where qpq\le p^*, and 1/p+1/p=11/p+1/p^{*}=1, we discuss properties of a width-independent ca…

2018-10-03abs ↗pdf ↗

We describe a novel algorithm for noisy global optimisation and continuum-armed bandits, with good convergence properties over any continuous reward function having finitely many polynomial maxima. Over such functions, our algorithm achieves square-root regret in bandits, and inverse-square-root error in optimisation, …

2013-02-11abs ↗pdf ↗

Double Q-learning has the same mean-squared error as Q-learning under certain conditions.

problem Comparing the mean-squared error of Double Q-learning and Q-learning.
method Theoretical analysis based on Lyapunov equations for both tabular and linear function approximation settings.
result The asymptotic mean-squared error of Double Q-learning is exactly equal to that of Q-learning under specific conditions.

Study evaluates different mathematical models for three case studies using statistical fitting.

problem Estimating outcomes in population dynamics, temperature variations, and market equilibrium.
method Applied various statistical equations (e.g., fractional exponential, sinusoidal) to three case studies.
result Optimal models differ by case study (fractional exponential for population dynamics, sinusoidal for temperature and market equilibrium).

New algorithms reduce contextual bandits' regret without knowing reward noise variances.

problem Reducing regret in contextual bandits with unknown reward noise variances.
method Developed new algorithms based on the optimism principle.
result Regret scales as the square root of the sum of measurement variances, not the time horizon.

Develops asymptotic analysis for RandNLA sampling estimators in least-squares problems.

problem Lack of distributional information for RandNLA estimators in statistical inference.
method Asymptotic analysis of sampling estimators for least-squares problems in two settings.
result Sampling estimators are asymptotically normally distributed under mild conditions.

Paper proposes combining GAM and DNN for accurate peak demand estimation from lower-resolution data.

problem Predicting high-resolution peak demand from limited lower-resolution data.
method Combines generalized additive models (GAM) and deep neural networks (DNN) for half-hourly load forecasting.
result Proposed method reduces out-of-sample RMSE by 57.4% compared to benchmark.

XGBoost predicts NEPSE Index log returns with low error and high directional accuracy.

problem Forecasting daily log-returns in the NEPSE Index with high accuracy.
method XGBoost machine learning, feature engineering, hyperparameter optimization, walk-forward validation.
result Optimal XGBoost configuration achieves lowest log-return RMSE and MAE.

Optimizes Gaussian process hyperparameters using Bayesian autoregression.

problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.

A visualization aids in comparing regression models by highlighting errors and correlations.

problem Comparing regression models is difficult due to varying hyper-parameters and metrics.
method Introduces a novel visualization approach using 2D residual space, Mahalanobis distance, and colormaps.
result Enhanced understanding of regression model performance differences and error distributions.