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

250500749999 · Jun 202019922001200920172026
48 results for Mean Absolute Error Random Sampling

We study in this paper the consequences of using the Mean Absolute Percentage Error (MAPE) as a measure of quality for regression models. We show that finding the best model under the MAPE is equivalent to doing weighted Mean Absolute Error (MAE) regression. We show that universal consistency of Empirical Risk Minimiza…

2015-06-12abs ↗pdf ↗

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.

The paper bounds the mean absolute error in DNN vector-to-vector regression.

problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.

We study in this paper the consequences of using the Mean Absolute Percentage Error (MAPE) as a measure of quality for regression models. We prove the existence of an optimal MAPE model and we show the universal consistency of Empirical Risk Minimization based on the MAPE. We also show that finding the best model under…

2016-05-09abs ↗pdf ↗

Near-optimal algorithms for mean estimation and linear regression with Gaussian covariates and Huber contamination.

problem Gaussian mean estimation and linear regression with Gaussian covariates in the presence of Huber contamination.
method Near-optimal algorithms with optimal error guarantees, achieving sample complexity n=ildeO(d/ε2)n = ilde{O}(d/ε^2) and almost linear runtime.
result First sample near-optimal and almost linear-time algorithms with optimal error guarantees for both problems.

The paper explores MAE as a loss function for DNN vector-to-vector regression, proving its advantages over MSE.

problem Improving loss function for deep neural network based vector-to-vector regression.
method Presenting performance bounds and new properties of MAE, deriving generalized upper bounds, and interpreting MAE as a Laplacian distribution.
result MAE is a more suitable loss function than MSE for DNN based vector-to-vector regression, especially when errors follow a Laplacian distribution.

Study loop corrections in random feature models affecting training and test errors.

problem Analyzing loop corrections in random feature models to understand training and test errors.
method Statistical physics and effective field theory approach to study loop corrections.
result Derived loop corrections to training error, test error, and generalization gap.

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.

Paper introduces MADL loss function for better AIS model optimization.

problem Optimizing machine learning models for AIS construction.
method Proposes Mean Absolute Directional Loss (MADL) function.
result MADL function improves hyperparameter selection and investment strategy efficiency.

LALR adapts learning rate for faster convergence in regression and neural nets.

problem Finding optimal learning rates for faster convergence in regression and neural networks.
method Lipschitz continuity theory applied to Mean Absolute Error and Quantile loss functions.
result Adaptive learning rate policy enables up to 20x faster convergence.

Paper proposes a new metric to evaluate survival models, especially for censored data.

problem Challenges in evaluating survival prediction models due to censored data.
method Developed a novel approach to estimate Mean Absolute Error (MAE) for survival datasets with censored data.
result The proposed MAE metric using pseudo-observations accurately ranks model performance and closely matches true MAE.

Models predict probabilities of causation from limited data.

problem Estimating probabilities of causation requires unreliable or impractical experimental and observational data.
method Proposed Exact-MLP and Mask-MLP models trained on reliable subpopulations.
result Models achieve average MAEs of roughly 0.03, reducing MAE by 80%.

Optimizes sample reweighting to match laws under covariate shift using Wasserstein distance.

problem Matching laws of samples with different distributions under covariate shift.
method Minimizes Wasserstein distance between empirical measures of samples using Nearest Neighbors weights.
result Consistent reweighting leads to asymptotic convergence of empirical measures.

Study improves prediction accuracy and uncertainty for mobile sensor data using randomized neural networks.

problem Improving prediction accuracy and uncertainty for mobile sensor data.
method Cross-validation and uncertainty determination for randomized neural networks.
result Improved out-of-sample performance and confidence intervals for prediction error.

The paper proposes a method to improve forecast combination accuracy using portfolio theory.

problem Improving forecast accuracy by combining multiple forecasts.
method Generates forecast combinations using a portfolio analogy, allowing negative weights for hedging.
result Demonstrates improved performance in weighted random forest forecasts.

This paper achieves optimal regret bounds for locally private linear contextual bandit.

problem Designing locally private linear contextual bandit algorithms with optimal regret bounds.
method New algorithmic and analytical ideas, including mean absolute deviation analysis and layered principal component regression.
result Achieves an ildeO(T) ilde O(\sqrt{T}) regret upper bound for locally private linear contextual bandit.

Neural network training process takes long time when the size of training data is huge, without the large set of training values the neural network is unable to learn features. This dilemma between time and size of data is often solved using fast GPUs, but we present a better solution for a subset of those problems. To…

2018-09-30abs ↗pdf ↗

The purpose of this paper is to propose a time-varying vector autoregressive model (TV-VAR) for forecasting multivariate time series. The model is casted into a state-space form that allows flexible description and analysis. The volatility covariance matrix of the time series is modelled via inverted Wishart and singul…

2008-02-01abs ↗pdf ↗

LU-Net improves cardiac segmentation accuracy and robustness.

problem Robustness and accuracy of deep learning cardiac segmentation.
method Multi-task end-to-end network designed to improve cardiac segmentation.
result Outperforms current best deep learning solution, reducing outliers and improving clinical indices.

Study uses machine learning to predict soil organic carbon content in northern Iran.

problem Estimating soil organic carbon content for understanding soil functions.
method Applied machine learning algorithms including DNN, SVM, ANN, etc., with genetic algorithm feature selection.
result DNN model showed highest accuracy with low prediction error and uncertainty.

Model predicts viscosity of multicomponent systems efficiently.

problem Expensive experimental viscosity measurements in various industries.
method Artificial neural networks trained on a database of chemical systems and temperatures.
result Model Viskositas provides more accurate predictions with lower errors, variability, and outliers.

Paper shows MoM is optimal under adversarial contamination for certain distributions.

problem Optimality of MoM under adversarial contamination.
method Upper and lower bounds for MoM's error under adversarial contamination.
result MoM is (minimax) optimal for distributions with finite variance and infinite variance with finite absolute moments.

Estimates sample size for subgroup analysis in randomized experiments.

problem Determining sample size for accurate subgroup analysis.
method Turns inference problem into simultaneous inference, calculates sample size based on confidence level and margin of error.
result Allows inversion of sample size to feasible number of treatment arms or partition complexity.

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.

Study evaluates 41 ML models for Bitcoin trading performance.

problem Predicting Bitcoin prices for algorithmic trading.
method Examined 21 classifiers and 20 regressors under various market conditions.
result Certain models like Random Forest and Stochastic Gradient Descent outperform others in profit and risk management.

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.

A novel SVR parameter optimization method using GSA outperforms other meta-heuristics in stock market forecasting.

problem Optimizing SVR parameters for reliable regression performance on small sample sizes.
method Golden Sine Algorithm (GSA) for parameter tuning of SVR.
result The GSA-based SVR outperforms eleven other meta-heuristics in terms of accuracy and computing time.

New framework reduces private mean estimation error with optimal efficiency.

problem Locally private mean estimation of high-dimensional vectors.
method ProjUnit framework: random projections, normalization, and optimal algorithm execution in lower dimensions.
result Optimal error up to a 1+o(1)-factor with computational efficiency and low communication complexity.