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,657 papers · 148 categories

Trend · papers per month

5101419 · Jun 202019922001200920172026
48 results for Leave-One-Out Cross-Validation

Optimizes hyperparameter tuning for models using approximate leave-one-out cross-validation.

problem Finding optimal hyperparameters for regularized models using approximate leave-one-out cross-validation.
method Derive efficient formulas for gradient and hessian of approximate leave-one-out cross-validation, apply second-order optimization.
result Demonstrates the effectiveness of the approach on real-world data sets.

ALO-CV approximates leave-one-out error in proportional regime.

problem Estimating generalization error in high-dimensional settings.
method Developed new analysis for ALO-CV, showed consistency under strong convexity.
result ALO-CV approximates leave-one-out error up to negligible error.

The paper improves ALO for 1\ell_1-regularized models.

problem Estimating out-of-sample error for 1\ell_1-regularized models.
method Developed a novel theory for 1\ell_1-regularized problems, bounding ALO error.
result For 1\ell_1-regularized problems, ALO error goes to zero as p goes to infinity.

Model inference, such as model comparison, model checking, and model selection, is an important part of model development. Leave-one-out cross-validation (LOO) is a general approach for assessing the generalizability of a model, but unfortunately, LOO does not scale well to large datasets. We propose a combination of u…

2019-04-24abs ↗pdf ↗

Study improves understanding of non-differentiable penalties in high-dimensional settings.

problem Theoretical understanding of non-differentiable penalties like generalized LASSO and nuclear norm in high-dimensional settings.
method Proportional high-dimensional regime analysis with finite sample upper bounds on expected squared error.
result LO provides accurate estimation of out-of-sample risk in high-dimensional settings.

Algorithm identifies and corrects noisy labels using Gaussian process regression.

problem Detecting and correcting real-valued noisy labels from mixed data.
method Gaussian process regression with heteroscedastic noise model and leave-one-out cross-validation.
result The method can pinpoint corrupted sample points and improve regression models.

A new method improves robustness and efficiency of Bayesian LOO-CV.

problem Computational expense and unreliability of classical LOO-CV in high-dimensional Bayesian models.
method Proposes a mixture estimator to compute Bayesian LOO-CV criteria with finite asymptotic variance.
result Improved robustness and efficiency in high-dimensional problems.

We speed up Gaussian process cross-validation calculations and improve model diagnostics.

problem Efficiently calculating cross-validation residuals and their covariances in Gaussian processes.
method Generalized fast Gaussian process leave-one-out formulae to multiple-fold cross-validation, highlighting covariance structures.
result Correcting for residual covariances in cross-validation improves back to Maximum Likelihood Estimation.

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 ↗

Paper accelerates conformal prediction by using approximate leave-one-out estimators.

problem Limited computational cost for conformal prediction.
method Incorporates approximate leave-one-out estimators to accelerate conformal prediction.
result ALO-based methods achieve comparable coverage and efficiency to exact methods but with significantly reduced runtime.

Cross-validation (CV) is a technique for evaluating the ability of statistical models/learning systems based on a given data set. Despite its wide applicability, the rather heavy computational cost can prevent its use as the system size grows. To resolve this difficulty in the case of Bayesian linear regression, we dev…

2016-10-25abs ↗pdf ↗

Analysis of cross-validation for early-stopped gradient descent in high-dimensional regression.

problem Inconsistency of GCV for early-stopped GD in high-dimensional least squares regression.
method Theoretical analysis of GCV and LOOCV applied to early-stopped GD in high-dimensional least squares regression.
result LOOCV converges uniformly to the prediction risk of early-stopped GD, while GCV is generically inconsistent.

FastMuyGPs speeds up GP predictions for large datasets.

problem High cost of Gaussian process predictions for large data.
method Combines cross-validation, batching, nearest neighbors sparsification, and precomputation.
result Superior accuracy and competitive runtime compared to other methods.

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.

MuyGPs efficiently estimates GP hyperparameters using local cross-validation.

problem Efficiently estimating GP hyperparameters for large datasets.
method Uses nearest neighbors structure and leave-one-out cross-validation.
result Outperforms state-of-the-art competitors in time and prediction accuracy.

This paper introduces Kernel-based Information Criterion (KIC) for model selection in regression analysis. The novel kernel-based complexity measure in KIC efficiently computes the interdependency between parameters of the model using a variable-wise variance and yields selection of better, more robust regressors. Expe…

2014-08-25abs ↗pdf ↗

New method improves online nonparametric estimators with minimal extra computation.

problem Model selection and hyperparameter tuning for online nonparametric estimators.
method Weighted rolling validation procedure for online cross-validation.
result Improves base estimators to achieve better heuristic performance and adaptive convergence rate.

Bayesian EM method improves ridge regression tuning without LOOCV's limitations.

problem Tuning ridge regression hyper-parameter λλ efficiently and accurately.
method Bayesian formulation of ridge regression with expectation maximization (EM) procedure.
result Guaranteed unique optimal solution for large nn without candidate λλ specification.

The study evaluates different parameter selection methods for Gaussian process interpolation.

problem Choosing optimal parameters for Gaussian process interpolation.
method Empirical study using scoring rules and leave-one-out selection criteria.
result The choice of model family is often more important than the selection criterion.

We propose a novel algorithm for greedy forward feature selection for regularized least-squares (RLS) regression and classification, also known as the least-squares support vector machine or ridge regression. The algorithm, which we call greedy RLS, starts from the empty feature set, and on each iteration adds the feat…

2010-03-18abs ↗pdf ↗

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 investigate the issue of model selection and the use of the nonconformity (strangeness) measure in batch learning. Using the nonconformity measure we propose a new training algorithm that helps avoid the need for Cross-Validation or Leave-One-Out model selection strategies. We provide a new generalisation error boun…

2009-09-12abs ↗pdf ↗

We consider the parametric learning problem, where the objective of the learner is determined by a parametric loss function. Employing empirical risk minimization with possibly regularization, the inferred parameter vector will be biased toward the training samples. Such bias is measured by the cross validation procedu…

2017-11-14abs ↗pdf ↗

Leave-one-out cross-validation (LOOCV) can be particularly accurate among cross-validation (CV) variants for machine learning assessment tasks -- e.g., assessing methods' error or variability. But it is expensive to re-fit a model NN times for a dataset of size NN. Previous work has shown that approximations to LOOCV…

2019-05-31abs ↗pdf ↗

Adaptive importance sampling is a class of techniques for finding good proposal distributions for importance sampling. Often the proposal distributions are standard probability distributions whose parameters are adapted based on the mismatch between the current proposal and a target distribution. In this work, we prese…

2019-06-20abs ↗pdf ↗