65 citations · 100 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
Efficient Active Search for Combinatorial Optimization Problems
André Hottung, Yeong-Dae Kwon, Kevin Tierney
Recently numerous machine learning based methods for combinatorial optimization problems have been proposed that learn to construct solutions in a sequential decision process via r…
cs.LG2021
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations
Carlos Ansotegui, Meinolf Sellmann, Tapan Shah +1
We consider black-box optimization in which only an extremely limited number of function evaluations, on the order of around 100, are affordable and the function evaluations must b…