Best subset selection in linear regression via bi-objective mixed integer linear programming

04/21/2018
by   Hadi Charkhgard, et al.
0

We study the problem of choosing the best subset of p features in linear regression given n observations. This problem naturally contains two objective functions including minimizing the amount of bias and minimizing the number of predictors. The existing approaches transform the problem into a single-objective optimization problem. We explain the main weaknesses of existing approaches, and to overcome their drawbacks, we propose a bi-objective mixed integer linear programming approach. A computational study shows the efficacy of the proposed approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2022

COMBSS: Best Subset Selection via Continuous Optimization

We consider the problem of best subset selection in linear regression, w...
research
09/06/2022

Novel bi-objective optimization algorithms minimizing the max and sum of vectors of functions

We study a bi-objective optimization problem, which for a given positive...
research
03/16/2017

A Visual Web Tool to Perform What-If Analysis of Optimization Approaches

In Operation Research, practical evaluation is essential to validate the...
research
07/23/2020

Blackout Resilient Optical Core Network

A disaster may not necessarily demolish the telecommunications infrastru...
research
07/07/2020

Kidney Exchange with Inhomogeneous Edge Existence Uncertainty

Motivated by kidney exchange, we study a stochastic cycle and chain pack...
research
04/03/2023

Distributionally robust mixed-integer programming with Wasserstein metric: on the value of uncertain data

This study addresses a class of linear mixed-integer programming (MIP) p...
research
06/05/2023

Efficient Algorithms for Modeling SBoxes Using MILP

Mixed Integer Linear Programming (MILP) is a well-known approach for the...

Please sign up or login with your details

Forgot password? Click here to reset