Local search algorithms are well-known methods for solving large, hard instances of the satisfiability problem (SAT). The performance of these algorithms crucially depends on heuristics for setting noise parameters and scoring variables. The optimal setting for these heuristics varies for different instance distributions. In this paper, we present an approach for learning effective variable scoring functions and noise parameters by using reinforcement learning. We consider satisfiability problems from different instance distributions and learn specialized heuristics for each of them. Our experimental results show improvements with respect to both a WalkSAT baseline and another local search learned heuristic.
MobEvolve: An Agentic Self-Evolving Heuristic System for Interpretable Human Mobility Generation
The Hong Kong Polytechnic University(香港理工大学);McGill University(麦吉尔大学);MIT(麻省理工学院);Tsinghua University(清华大学);Autorité régionale de transport métropolitain(大都会交通地区管理局);Université de Montréal(蒙特利尔大学);Mila – Quebec AI Institute(魁北克人工智能研究所)
Learning-Aided Heuristics Design for Storage System
Huawei Noah’s Ark Lab(华为诺亚方舟实验室);Shanghai Jiao Tong University(上海交通大学);University of Pennsylvania(宾夕法尼亚大学);University of Science and Technology of China(中国科学技术大学)
Approximating the Backbone in the Weighted Maximum Satisfiability Problem
School of Software, Dalian University of Technology(大连理工大学软件学院);The State Key Laboratory of Computer Science, Institute of Software, CAS(中国科学院软件研究所计算机科学国家重点实验室)
加权最大可满足性问题(weighted Maximum Satisfiability problem,简称MAX-SAT)是一个NP难问题,在人工智能中有着广泛的应用。主干作为一种有效的启发式设计工具,已被应用于许多NP难问题的启发式设计中。本文研究了在加权MAX-SAT中检索骨干的计算复杂性,并提出了一种新的算法来解决这个问题。我们证明了在以下假设下检索完整的主干是困难的。此外,它是棘手的,以恢复一个固定的骨干部分,以及。在此基础上,提出了一种基于Walksat算子的骨干引导局部搜索算法(BGLS)。BGLS包括两个阶段:第一阶段从局部最优解中抽取骨干信息,骨干阶段在骨干的指导下进行局部搜索。在基准测试上的大量实验结果表明,BGLS在解的质量和运行时间方面都优于现有的算法。
Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
Max Planck Institute for the Physics of Complex Systems(马克斯·普朗克复杂系统物理研究所);Institute of Theoretical Physics, Technische Universität Dresden and Würzburg-Dresden Cluster of Excellence ct.qmat(理论物理研究所,德累斯顿技术大学和弗赖贝格-德累斯顿卓越中心ct.qmat)
MeLA: A Metacognitive LLM-Driven Architecture for Automatic Heuristic Design
School of Computer Science, University of Nottingham Ningbo China(诺丁汉大学宁波分校计算机科学学院);College of Teacher Education, Zhejiang Normal University(浙江师范大学教师教育学院)
Medical Heuristic Learning: An LLM-Driven Framework for Interpretable and Auditable Clinical Decision Rules
Centre for Artificial Intelligence Driven Drug Discovery, Macao Polytechnic University(人工智能驱动药物发现中心,澳门理工学院);Key Laboratory of Short-Range Radio Equipment Testing and Evaluation, Ministry of Industry and Information Technology Terahertz Science Application Center (TSAC), Beijing Institute of Technology(工业和信息化部短距离无线电设备测试与评估重点实验室,太赫兹科学应用中心(TSAC),北京理工大学);Department of Critical Care Medicine, Yantai Yuhuangding Hospital, Qingdao University(重症医学科,烟台友谊医院,青岛大学);Faculty of Education, The University of Hong Kong(教育学院,香港大学);College of Information Engineering, Dalian University(信息工程学院,大连大学)
LogicSolver: Towards Interpretable Math Word Problem Solving with Logical Prompt-enhanced Learning
Shenzhen Campus of Sun Yat-sen University(中山大学深圳校区);Sun Yat-sen University(中山大学);Guangdong University of Technology(广东工业大学);Dark Matter AI Inc.(暗物质人工智能公司)
Interpretable Operator Learning for Inverse Problems via Adaptive Spectral Filtering: Convergence and Discretization Invariance
School of Instrumentation Science and Engineering, Harbin Institute of Technology(仪器科学与工程学院,哈尔滨工业大学);School of Mathematics, Jilin University(吉林大学数学学院);School of Mathematics, Inner Mongolia University(内蒙古大学数学学院)
MurTree: Optimal Classification Trees via Dynamic Programming and Search
Delft University of Technology(代尔夫特理工大学);LAAS CNRS(法国国家科学研究中心LAAS实验室);RMIT University(皇家墨尔本理工大学);University of Melbourne(墨尔本大学);Monash University(莫纳什大学);DATA61(DATA61研究所)