mlsanityData to 14 Oct 2026

Model Selection Through Model Sorting

arXiv 2409.09674 ↗First posted 15 Sep 2024cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We propose a novel approach to select the best model of the data. Based on the exclusive properties of the nested models, we find the most parsimonious model containing the risk minimizer predictor. We prove the existence of probable approximately correct (PAC) bounds on the difference of the minimum empirical risk of two successive nested models, called successive empirical excess risk (SEER). Based on these bounds, we propose a model order selection method called nested empirical risk (NER). By the sorted NER (S-NER) method to sort the models intelligently, the minimum risk decreases. We construct a test that predicts whether expanding the model decreases the minimum risk or not. With a high probability, the NER and S-NER choose the true model order and the most parsimonious model containing the risk minimizer predictor, respectively. We use S-NER model selection in the linear regression and show that, the S-NER method without any prior information can outperform the accuracy of feature sorting algorithms like orthogonal matching pursuit (OMP) that aided with prior knowledge of the true model order. Also, in the UCR data set, the NER method reduces the complexity of the classification of UCR datasets dramatically, with a negligible loss of accuracy.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 51 references that are in the map. First posted on arXiv 15 Sep 2024.

Builds on

2 of 51 references.

References · 2

  1. 2021User-friendly introduction to PAC-Bayes boundscited by 239
  2. 2018Signal and Noise Statistics Oblivious Orthogonal Matching Pursuitcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.