Convex Techniques for Model Selection

11/27/2014
by   Dustin Tran, et al.
0

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 K-fold cross validation on ridge regression, although the same concept extends to more complex models. We then compare its performance with standard methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2021

Local asymptotics of cross-validation in least-squares density estimation

In model selection, several types of cross-validation are commonly used ...
research
09/10/2009

Data-driven calibration of linear estimators with minimal penalties

This paper tackles the problem of selecting among several linear estimat...
research
02/05/2008

V-fold cross-validation improved: V-fold penalization

We study the efficiency of V-fold cross-validation (VFCV) for model sele...
research
03/09/2022

Cross validation for model selection: a primer with examples from ecology

The growing use of model-selection principles in ecology for statistical...
research
07/06/2023

Evaluating the Evaluators: Are Current Few-Shot Learning Benchmarks Fit for Purpose?

Numerous benchmarks for Few-Shot Learning have been proposed in the last...
research
08/24/2019

EPP: interpretable score of model predictive power

The most important part of model selection and hyperparameter tuning is ...
research
01/08/2023

A Modelling Framework for Regression with Collinearity

This study addresses a fundamental, yet overlooked, gap between standard...

Please sign up or login with your details

Forgot password? Click here to reset