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

Trend · papers per month

88176264352 · Jun 202019922001200920172026
48 results for approximate 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.

New method approximates CV for model assessment and selection.

problem Efficient model assessment and selection with large number of folds.
method Approximates expensive refitting with a single Newton step warm-started from full training set optimizer.
result Uniform non-asymptotic, deterministic model assessment guarantees for approximate CV.

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.

Cross-validation estimates model performance on unseen data, not training data.

problem Understanding how cross-validation estimates prediction error and its limitations.
method Analyzing linear models and popular prediction error estimates, introducing nested cross-validation.
result Cross-validation estimates the average prediction error of models fit on other unseen training sets, not the model at hand.

The paper assesses quality measures for machine learning models using cross-validation.

problem Evaluating the accuracy and robustness of quality measures for machine learning models.
method Cross-validation approach to estimate prediction error and quantify explained variation. Confidence bounds and local quality measures derived from residuals.
result The reliability and robustness of quality measures are assessed through numerical examples and confidence bounds.

New ACV method speeds up CV in high dimensions with approximate low-rank data.

problem Accurate model assessment in high-dimensional, large data settings with expensive algorithms.
method Developed a new ACV algorithm that uses low-rank approximations of the Hessian matrix.
result The new method is fast and accurate in the presence of approximate low-rank data.

Paper analyzes holdout cross-validation for large non-Gaussian covariance estimation.

problem Estimating large covariance matrices for non-Gaussian data.
method Use of Weingarten calculus and Ledoit-Péché formula for theoretical error derivation.
result Optimal train-test split ratio is proportional to square root of matrix dimension.

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.

A method for efficient CV estimates in Bayesian hierarchical models.

problem Computational infeasibility of cross-validation in Bayesian hierarchical regression models.
method Conditioning on variance-covariance parameters to transform CV into an optimization problem.
result Equivalent or improved predictive estimates compared to full cross-validation.

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 ↗

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 ↗

Improved GP decoder training with SAS approximations.

problem Training expensive Gaussian process decoders is challenging and computationally expensive.
method Developed a new stochastic estimate of log-marginal likelihood based on cross-validation.
result SAS-GP improves robustness and reduces computational cost compared to variational autoencoders.

Paper introduces NICc for fast cluster-based validation of prediction models.

problem Validation of prediction models on clustered data.
method Derived NICc to approximate leave-one-cluster-out deviance for standard regression models.
result NICc provides more accurate model size and variable selection, especially with strong clustering.

Manifold regularization, such as laplacian regularized least squares (LapRLS) and laplacian support vector machine (LapSVM), has been widely used in semi-supervised learning, and its performance greatly depends on the choice of some hyper-parameters. Cross-validation (CV) is the most popular approach for selecting the …

2019-02-13abs ↗pdf ↗

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 ↗

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.

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.

Efficiently estimates shrinkage coefficient for RTME using LOOCV approximation.

problem Estimating optimal shrinkage coefficient for Regularized Tyler's M-estimator.
method Proposes an approximate LOOCV method to estimate αα efficiently.
result Significant speedup and accuracy improvement over existing methods.

This work improves AutoML systems by dynamically evaluating fitness to reduce overfitting.

problem Overfitting in AutoML systems, especially during internal cross-validation iterations.
method Introducing dynamic fitness evaluations that approximate repeated k-fold cross-validation.
result Significant improvement in generalization/testing performance over baseline methods.

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 ↗

New algorithms delete user data from machine learning models efficiently.

problem Deleting user data from machine learning models trained with empirical risk minimization.
method Developed an online unlearning algorithm using the infinitesimal jackknife, targeting non-smooth regularizers.
result Empirically improved runtime while maintaining memory requirements and test accuracy.

New cross-validation methods for Gaussian process regression with efficient gradient computation.

problem Estimating parameters of Gaussian process covariance functions.
method Derive new cross-validation criteria and efficient adjoint computation of gradients.
result Efficient method for evaluating cross-validation criteria and their gradients.

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.

The paper develops a cross-validation method for improving signal denoising techniques.

problem Improving signal denoising methods for nonparametric regression.
method Develops a general cross-validation framework for signal denoising and applies it to Trend Filtering and Dyadic CART.
result Cross validated versions of Trend Filtering and Dyadic CART achieve nearly optimal convergence rates.

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.

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 ↗

This text is a survey on cross-validation. We define all classical cross-validation procedures, and we study their properties for two different goals: estimating the risk of a given estimator, and selecting the best estimator among a given family. For the risk estimation problem, we compute the bias (which can also be …

2017-03-09abs ↗pdf ↗