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

491317 · Jun 202019922001200920172026
48 results for K-fold cross-validation

Improves test set performance and reduces out-of-sample disappointment for unstable models.

problem Ensuring strong test set performance via cross-validation for unstable models.
method Nested k-fold cross-validation with hyperparameter selection based on a weighted sum of cross-validation metric and model stability measure.
result Improves out-of-sample MSE for sparse ridge regression and CART by 4% and 2% respectively, compared to k-fold cross-validation.

K-fold Cross Validation is commonly used to evaluate classifiers and tune their hyperparameters. However, it assumes that data points are Independent and Identically Distributed (i.i.d.) so that samples used in the training and test sets can be selected randomly and uniformly. In Human Activity Recognition datasets, we…

2019-04-04abs ↗pdf ↗

K-fold CV improves machine learning model selection but faces challenges with small datasets.

problem Challenges in validating machine learning models, especially with small datasets.
method K-fold cross-validation with K-fold CUBV (Upper Bound of the actual risk) and Upper Bound of the actual risk for linear classifiers.
result K-fold CUBV is a robust criterion for detecting effects and validating accuracy values from machine learning models.

Proposes a method to create prediction intervals for neural networks using cross-validation.

problem Lack of prediction intervals for neural networks.
method k-fold cross-validation to construct conformal prediction intervals.
result Proposed method produces narrower intervals with similar coverage compared to SC method.

We consider a priori generalization bounds developed in terms of cross-validation estimates and the stability of learners. In particular, we first derive an exponential Efron-Stein type tail inequality for the concentration of a general function of n independent random variables. Next, under some reasonable notion of s…

2017-06-19abs ↗pdf ↗

Echo State Networks (ESNs) are known for their fast and precise one-shot learning of time series. But they often need good hyper-parameter tuning for best performance. For this good validation is key, but usually, a single validation split is used. In this rather practical contribution we suggest several schemes for cr…

2019-08-22abs ↗pdf ↗

Study evaluates cross-validation methods for clinical ECG classification, finding leave-source-out more reliable.

problem Overoptimistic cross-validation estimates for new patient sources.
method Empirical evaluation of K-fold and leave-source-out cross-validation methods.
result Leave-source-out cross-validation provides more reliable performance estimates.

Optimal data splitting improves covariance matrix estimation in large datasets.

problem Improving large covariance matrix estimation in high-dimensional settings.
method Focus on holdout method, derive closed-form error expression, connect to eigenvalue variance.
result Optimal train-test split scales as square root of matrix dimension.

In this article, we derive concentration inequalities for the cross-validation estimate of the generalization error for subagged estimators, both for classification and regressor. General loss functions and class of predictors with both finite and infinite VC-dimension are considered. We slightly generalize the formali…

2010-11-23abs ↗pdf ↗

Study improves predictive performance testing for high-dimensional data using exhaustive nested cross-validation.

problem Reproducibility issues in KK-fold cross-validation for high-dimensional data.
method Proposes a novel predictive performance test based on exhaustive nested cross-validation, addressing computational complexity with a closed-form expression.
result Demonstrates the effectiveness of Ridge-based methods in high-dimensional predictive performance testing.

Statistical machine learning models should be evaluated and validated before putting to work. Conventional k-fold Monte Carlo Cross-Validation (MCCV) procedure uses a pseudo-random sequence to partition instances into k subsets, which usually causes subsampling bias, inflates generalization errors and jeopardizes the r…

2019-07-04abs ↗pdf ↗

We study the following three fundamental problems about ridge regression: (1) what is the structure of the estimator? (2) how to correctly use cross-validation to choose the regularization parameter? and (3) how to accelerate computation without losing too much accuracy? We consider the three problems in a unified larg…

2019-10-06abs ↗pdf ↗

K-fold cross-validation (CV) with squared error loss is widely used for evaluating predictive models, especially when strong distributional assumptions cannot be taken. However, CV with squared error loss is not free from distributional assumptions, in particular in cases involving non-i.i.d. data. This paper analyzes …

2019-04-04abs ↗pdf ↗

In Bayesian statistics, the marginal likelihood, also known as the evidence, is used to evaluate model fit as it quantifies the joint probability of the data under the prior. In contrast, non-Bayesian models are typically compared using cross-validation on held-out data, either through kk-fold partitioning or leave-$p…

2019-05-21abs ↗pdf ↗

We develop a robust convex algorithm to select the regularization parameter in model selection. In practice this would be automated in order to save practitioners time from having to tune it manually. In particular, we implement and test the convex method for KK-fold cross validation on ridge regression, although the …

2014-11-27abs ↗pdf ↗

New method for cross-validation in high-dimensional data with dependent or heavy-tailed covariates.

problem Inconsistent cross-validation in high-dimensional settings with dependent or heavy-tailed covariates.
method ROTI-GCV framework for cross-validation under proportional asymptotics regime.
result Demonstrated accuracy of ROTI-GCV in synthetic and semi-synthetic settings.

Study compares mutation validation and cross-validation for model selection.

problem Comparing model selection methods for generalization performance and computational efficiency.
method Empirical comparison using benchmark and real-world datasets with Bayesian tests.
result Both methods select models with equivalent generalization performance but MV selects simpler models and is computationally cheaper.

Recent advances in statistical theory, together with advances in the computational power of computers, provide alternative methods to do mass-univariate hypothesis testing in which a large number of univariate tests, can be properly used to compare MEEG data at a large number of time-frequency points and scalp location…

2014-06-25abs ↗pdf ↗

In machine learning, statistics, econometrics and statistical physics, cross-validation (CV) is used asa standard approach in quantifying the generalisation performance of a statistical model. A directapplication of CV in time-series leads to the loss of serial correlations, a requirement of preserving anynon-stationar…

2019-10-21abs ↗pdf ↗

Machine Learning improves macroeconomic forecasting by capturing nonlinearities.

problem Improving macroeconomic forecasting accuracy.
method Study four features (nonlinearities, regularization, cross-validation, loss function) in data-rich and data-poor environments.
result Nonlinearity is the key to improving forecasting accuracy.

Methodology creates holdout and test/train sets for ML studies, preserving data for future research.

problem Preserving data for future research studies that are analysis-naive.
method Modification of k-fold cross-validation, randomization, and three-way split (holdout, test, training).
result Efficiently creates holdout and test/train sets without forcing.

The objective of this research is to enhance performance of Stochastic Gradient Descent (SGD) algorithm in text classification. In our research, we proposed using SGD learning with Grid-Search approach to fine-tuning hyper-parameters in order to enhance the performance of SGD classification. We explored different setti…

2019-02-18abs ↗pdf ↗

We construct the full linearisation functor which takes a graded bundle of degree kk (a particular kind of graded manifold) and produces a kk-fold vector bundle. We fully characterise the image of the full linearisation functor and show that we obtain a subcategory of kk-fold vector bundles consisting of symmetric $…

2015-12-08abs ↗pdf ↗

Hybrid QNN-LSTM predicts financial stock market trends using quantum computing.

problem Complex temporal dependencies and market fluctuations in financial time-series forecasting.
method Custom QNN regressor with hybrid optimization strategies.
result Hybrid models integrate quantum computing into financial forecasting workflows.