Instance-specific algorithm selection via multi-output learning

被引:0
|
作者
Chen K. [1 ]
Dou Y. [1 ]
Lv Q. [1 ]
Liang Z. [2 ]
机构
[1] National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha
[2] College of Computer, National University of Defense Technology, Changsha
来源
Chen, Kai (kaenchan.nudt@gmail.com) | 1600年 / Tsinghua University卷 / 22期
基金
中国国家自然科学基金;
关键词
algorithm selection; multi-output learning; extremely randomized trees; performance prediction; constraint satisfaction;
D O I
10.23919/TST.2017.7889642
中图分类号
学科分类号
摘要
Instance-specific algorithm selection technologies have been successfully used in many research fields, such as constraint satisfaction and planning. Researchers have been increasingly trying to model the potential relations between different candidate algorithms for the algorithm selection. In this study, we propose an instancespecific algorithm selection method based on multi-output learning, which can manage these relations more directly. Three kinds of multi-output learning methods are used to predict the performances of the candidate algorithms: (1) multi-output regressor stacking; (2) multi-output extremely randomized trees; and (3) hybrid single-output and multioutput trees. The experimental results obtained using 11 SAT datasets and 5 MaxSAT datasets indicate that our proposed methods can obtain a better performance over the state-of-the-art algorithm selection methods. © 1996-2012 Tsinghua University Press.
引用
收藏
页码:210 / 217
页数:7
相关论文
共 50 条
  • [1] Instance-Specific Algorithm Selection via Multi-Output Learning
    Kai Chen
    Yong Dou
    Qi Lv
    Zhengfa Liang
    Tsinghua Science and Technology, 2017, (02) : 210 - 217
  • [2] Instance-Specific Algorithm Selection via Multi-Output Learning
    Chen, Kai
    Dou, Yong
    Lv, Qi
    Liang, Zhengfa
    TSINGHUA SCIENCE AND TECHNOLOGY, 2017, 22 (02) : 210 - 217
  • [3] Instance-Specific Algorithm Selection via Multi-Output Learning
    Kai Chen
    Yong Dou
    Qi Lv
    Zhengfa Liang
    Tsinghua Science and Technology, 2017, 22 (02) : 210 - 217
  • [4] Instance-specific algorithm configuration
    Yuri Malitsky
    Constraints, 2015, 20 (4) : 474 - 474
  • [5] DISC: Learning from Noisy Labels via Dynamic Instance-Specific Selection and Correction
    Li, Yifan
    Han, Hu
    Shan, Shiguang
    Chen, Xilin
    2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 24070 - 24079
  • [6] ISAC - Instance-Specific Algorithm Configuration
    Kadioglu, Serdar
    Malitsky, Yuri
    Sellmann, Meinolf
    Tierney, Kevin
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 750 - 755
  • [7] Learning Instance-Specific Predictive Models
    Visweswaran, Shyam
    Cooper, Gregory F.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2010, 11 : 3333 - 3369
  • [8] Instance-specific algorithm configuration via unsupervised deep graph clustering
    Song, Wen
    Liu, Yi
    Cao, Zhiguang
    Wu, Yaoxin
    Li, Qiqiang
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 125
  • [9] Learning instance-specific predictive models
    Visweswaran, Shyam
    Cooper, Gregory F.
    Journal of Machine Learning Research, 2010, 11 : 3333 - 3369
  • [10] MaxSAT by Improved Instance-Specific Algorithm Configuration
    Ansotegui, Carlos
    Malitsky, Yuri
    Sellmann, Meinolf
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2594 - 2600