English

Convex Techniques for Model Selection

Optimization and Control 2014-12-03 v2 Machine Learning

Abstract

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 same concept extends to more complex models. We then compare its performance with standard methods.

Keywords

Cite

@article{arxiv.1411.7596,
  title  = {Convex Techniques for Model Selection},
  author = {Dustin Tran},
  journal= {arXiv preprint arXiv:1411.7596},
  year   = {2014}
}

Comments

Originally written on May 16, 2014

R2 v1 2026-06-22T07:14:27.232Z