超参数
计算机科学
复制(统计)
编码(集合论)
钥匙(锁)
人工智能
机器学习
语言模型
训练集
自然语言处理
程序设计语言
统计
数学
计算机安全
集合(抽象数据类型)
作者
Yinhan Liu,Myle Ott,Goyal, Naman,Jingfei Du,Mandar Joshi,Danqi Chen,Omer Levy,Mike Lewis,Luke Zettlemoyer,Veselin Stoyanov
标识
DOI:10.4230/lipics.cp.2025.31
摘要
Given a combinatorial optimisation problem, there are typically multiple ways of modelling it for presentation to an automated solver. Choosing the right combination of model and target solver can have a significant impact on the effectiveness of the solving process. The best combination of model and solver can also be instance-dependent: there may not exist a single combination that works best for all instances of the same problem. We consider the task of building machine learning models to automatically select the best combination for a problem instance. Critical to the learning process is to define instance features, which serve as input to the selection model. Our contribution is the automatic learning of instance features directly from the high-level representation of a problem instance using a transformer encoder. We evaluate the performance of our approach using the Essence modelling language via a case study of three problem classes.
科研通智能强力驱动
Strongly Powered by AbleSci AI