The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However, in this method, the initialization is assigned in a random manner, which impacts the effectiveness of SLS solvers. To address this problem, we propose NLocalSAT. NLocalSAT combines SLS with a solution prediction model, which boosts SLS by changing initialization assignments with a neural network. We evaluated NLocalSAT on five SLS solvers (CCAnr, Sparrow, CPSparrow, YalSAT, and probSAT) with instances in the random track of SAT Competition 2018. The experimental results show that solvers with NLocalSAT achieve 27% ~ 62% improvement over the original SLS solvers.
EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning
School of Computer Science and Technology, University of Science and Technology of China(中国科学技术大学计算机科学与技术学院);Department of Data Science, City University of Hong Kong(香港城市大学数据科学系);iFLYTEK Research(iFLYTEK研究院)
Boosting In-Silicon Directed Evolution with Fine-Tuned Protein Language Model and Tree Search
Department of Computer Science(计算机科学与工程系);Engineering, The Chinese University of Hong Kong(香港中文大学);Hangzhou Institute of Medicine, Chinese Academy of Sciences(中国科学院杭州医学研究所)
GI-NAS: Boosting Gradient Inversion Attacks Through Adaptive Neural Architecture Search
Tsinghua Shenzhen International Graduate School, Tsinghua University(清华大学深圳国际研究生院);School of Computer Science and Technology, Harbin Institute of Technology(哈尔滨工业大学计算机科学与技术学院);School of Computer Science and Engineering, Sun Yat-sen University(中山大学计算机科学与工程学院);Shenzhen ShenNong Information Technology Co., Ltd.(深圳神农信息技术有限公司);Department of Computer Science and Technology, Tsinghua University(清华大学计算机科学与技术系)
Achieving Olympiad-Level Geometry Large Language Model Agent via Complexity Boosting Reinforcement Learning
Shanghai AI Laboratory(上海人工智能实验室);Shanghai Jiao Tong University(上海交通大学);Peking University(北京大学);ICMAT Spanish National Research Council(西班牙国家研究委员会ICMAT);The Chinese University of Hong Kong(香港中文大学)
Boosting Gradient Ascent for Continuous DR-submodular Maximization
University of Chinese Academy of Sciences(中国科学院大学);City University of Hong Kong(香港城市大学);ByteDance(字节跳动);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所)