<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection</title></titleInfo>





<name type="personal">
  <namePart type="given">Lukass</namePart>
  <namePart type="family">Fehring</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jonas Manuel</namePart>
  <namePart type="family">Hanselle</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">43980</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-1231-4985</description></name>
<name type="personal">
  <namePart type="given">Alexander</namePart>
  <namePart type="family">Tornede</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">38209</identifier></name>









<name type="conference">
  <namePart>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</namePart>
</name>



<name type="corporate">
  <namePart>SFB 901: SFB 901</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SFB 901 - B: SFB 901 - Project Area B</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>
<name type="corporate">
  <namePart>SFB 901 - B2: SFB 901 - Subproject B2</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">It is well known that different algorithms perform differently well on an
instance of an algorithmic problem, motivating algorithm selection (AS): Given
an instance of an algorithmic problem, which is the most suitable algorithm to
solve it? As such, the AS problem has received considerable attention resulting
in various approaches - many of which either solve a regression or ranking
problem under the hood. Although both of these formulations yield very natural
ways to tackle AS, they have considerable weaknesses. On the one hand,
correctly predicting the performance of an algorithm on an instance is a
sufficient, but not a necessary condition to produce a correct ranking over
algorithms and in particular ranking the best algorithm first. On the other
hand, classical ranking approaches often do not account for concrete
performance values available in the training data, but only leverage rankings
composed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon
foreSts - a new algorithm selector leveraging special forests, combining the
strengths of both approaches while alleviating their weaknesses. HARRIS&apos;
decisions are based on a forest model, whose trees are created based on splits
optimized on a hybrid ranking and regression loss function. As our preliminary
experimental study on ASLib shows, HARRIS improves over standard algorithm
selection approaches on some scenarios showing that combining ranking and
regression in trees is indeed promising for AS.</abstract>

<originInfo><dateIssued encoding="w3cdtf">2022</dateIssued><place><placeTerm type="text">Baltimore</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</title></titleInfo>
  <identifier type="arXiv">2210.17341</identifier>
<part>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>L. Fehring, J.M. Hanselle, A. Tornede, in: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.</short>
<chicago>Fehring, Lukass, Jonas Manuel Hanselle, and Alexander Tornede. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” In &lt;i&gt;Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022&lt;/i&gt;, 2022.</chicago>
<ieee>L. Fehring, J. M. Hanselle, and A. Tornede, “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection,” presented at the Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore, 2022.</ieee>
<apa>Fehring, L., Hanselle, J. M., &amp;#38; Tornede, A. (2022). HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. &lt;i&gt;Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022&lt;/i&gt;. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore.</apa>
<bibtex>@inproceedings{Fehring_Hanselle_Tornede_2022, title={HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}, booktitle={Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}, author={Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}, year={2022} }</bibtex>
<ama>Fehring L, Hanselle JM, Tornede A. HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. In: &lt;i&gt;Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022&lt;/i&gt;. ; 2022.</ama>
<mla>Fehring, Lukass, et al. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” &lt;i&gt;Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022&lt;/i&gt;, 2022.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>34103</recordIdentifier><recordCreationDate encoding="w3cdtf">2022-11-17T12:57:40Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-11-17T13:00:53Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
