A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911751329546240 |
|---|---|
| author | Iommazzo, Gabriele D'Ambrosio, Claudia Frangioni, Antonio Liberti, Leo |
| author_facet | Iommazzo, Gabriele D'Ambrosio, Claudia Frangioni, Antonio Liberti, Leo |
| contents | We propose a methodology, based on machine learning and optimization, for selecting a solver configuration for a given instance. First, we employ a set of solved instances and configurations in order to learn a performance function of the solver. Secondly, we formulate a mixed-integer nonlinear program where the objective/constraints explicitly encode the learnt information, and which we solve, upon the arrival of an unknown instance, to find the best solver configuration for that instance, based on the performance function. The main novelty of our approach lies in the fact that the configuration set search problem is formulated as a mathematical program, which allows us to a) enforce hard dependence and compatibility constraints on the configurations, and b) solve it efficiently with off-the-shelf optimization tools. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_04237 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A learning-based mathematical programming formulation for the automatic configuration of optimization solvers Iommazzo, Gabriele D'Ambrosio, Claudia Frangioni, Antonio Liberti, Leo Optimization and Control Machine Learning We propose a methodology, based on machine learning and optimization, for selecting a solver configuration for a given instance. First, we employ a set of solved instances and configurations in order to learn a performance function of the solver. Secondly, we formulate a mixed-integer nonlinear program where the objective/constraints explicitly encode the learnt information, and which we solve, upon the arrival of an unknown instance, to find the best solver configuration for that instance, based on the performance function. The main novelty of our approach lies in the fact that the configuration set search problem is formulated as a mathematical program, which allows us to a) enforce hard dependence and compatibility constraints on the configurations, and b) solve it efficiently with off-the-shelf optimization tools. |
| title | A learning-based mathematical programming formulation for the automatic configuration of optimization solvers |
| topic | Optimization and Control Machine Learning |
| url | https://arxiv.org/abs/2401.04237 |