Scientific computing has experienced a surge empowered by advancements in technologies such as neural networks. However, certain important tasks are less amenable to these technologies, benefiting from innovations to traditional inference schemes. One such task is protein re-design. Recently a new re-design algorithm, AOBB-K*, was introduced and was competitive with state-of-the-art BBK* on small protein re-design problems. However, AOBB-K* did not scale well. In this work we focus on scaling up AOBB-K* and introduce three new versions: AOBB-K*-b (boosted), AOBB-K*-DH (with dynamic heuristics), and AOBB-K*-UFO (with underflow optimization) that significantly enhance scalability.
@article{arxiv.2309.00408,
title = {Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO},
author = {Bobak Pezeshki and Radu Marinescu and Alexander Ihler and Rina Dechter},
journal= {arXiv preprint arXiv:2309.00408},
year = {2023}
}
Comments
In proceedings of the 39th Conference on Uncertainty in Artificial Intelligence (UAI 2023) and published in Proceedings of Machine Learning Research (PMLR)