Parallel algorithm configuration

F Hutter, HH Hoos, K Leyton-Brown - International Conference on …, 2012 - Springer
State-of-the-art algorithms for solving hard computational problems often expose many
parameters whose settings critically affect empirical performance. Manually exploring the …

Discrete-convex-analysis-based framework for warm-starting algorithms with predictions

S Sakaue, T Oki - Advances in Neural Information …, 2022 - proceedings.neurips.cc
Augmenting algorithms with learned predictions is a promising approach for going beyond
worst-case bounds. Dinitz, Im, Lavastida, Moseley, and Vassilvitskii~(2021) have …

What works best when? A systematic evaluation of heuristics for Max-Cut and QUBO

I Dunning, S Gupta, J Silberholz - INFORMS Journal on …, 2018 - pubsonline.informs.org
Though empirical testing is broadly used to evaluate heuristics, there are shortcomings with
how it is often applied in practice. In a systematic review of Max-Cut and quadratic …

Deep learning for algorithm portfolios

A Loreggia, Y Malitsky, H Samulowitz… - Proceedings of the aaai …, 2016 - ojs.aaai.org
It is well established that in many scenarios there is no single solver that will provide optimal
performance across a wide range of problem instances. Taking advantage of this …

On the power of multitask representation learning in linear mdp

R Lu, G Huang, SS Du - arXiv preprint arXiv:2106.08053, 2021 - arxiv.org
While multitask representation learning has become a popular approach in reinforcement
learning (RL), theoretical understanding of why and when it works remains limited. This …