Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis
Alexander Tornede, Marcel Wever, Stefan Werner, Felix Mohr, Eyke, H\"ullermeier

TL;DR
Run2Survive introduces a decision-theoretic algorithm selection method leveraging survival analysis to effectively handle censored runtime data, prioritizing timeout avoidance and outperforming many existing approaches in benchmark tests.
Contribution
This work applies survival analysis to algorithm selection, enabling proper handling of censored data and introducing a risk-averse decision strategy for improved performance.
Findings
Highly competitive with state-of-the-art methods
Often outperforms existing approaches in benchmarks
Effectively manages censored runtime data
Abstract
Algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidate algorithms most suitable for a specific instance of an algorithmic problem class, where "suitability" often refers to an algorithm's runtime. Due to possibly extremely long runtimes of candidate algorithms, training data for algorithm selection models is usually generated under time constraints in the sense that not all algorithms are run to completion on all instances. Thus, training data usually comprises censored information, as the true runtime of algorithms timed out remains unknown. However, many standard AS approaches are not able to handle such information in a proper way. On the other side, survival analysis (SA) naturally supports censored data and offers appropriate ways to use such data for learning distributional models of algorithm runtime, as we demonstrate in this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Advanced Bandit Algorithms Research
