赛门铁克:一种有效的符号回归方法,用于科学及其他领域的可解释和简约模型发现

IF 3.9 3区 工程技术 Q2 ENGINEERING, CHEMICAL
Madhav R. Muthyala, Farshud Sorourifar, You Peng, Joel A. Paulson
{"title":"赛门铁克:一种有效的符号回归方法,用于科学及其他领域的可解释和简约模型发现","authors":"Madhav R. Muthyala, Farshud Sorourifar, You Peng, Joel A. Paulson","doi":"10.1021/acs.iecr.4c03503","DOIUrl":null,"url":null,"abstract":"Symbolic regression (SR) is an emerging branch of machine learning focused on discovering simple and interpretable mathematical expressions from data. Although a wide-variety of SR methods have been developed, they often face challenges such as high computational cost, poor scalability with respect to the number of input dimensions, fragility to noise, and an inability to balance accuracy and complexity. This work introduces SyMANTIC, a novel SR algorithm that addresses these challenges. SyMANTIC efficiently identifies (potentially several) low-dimensional descriptors from a large set of candidates (from ∼10<sup>5</sup> to ∼10<sup>10</sup> or more) through a unique combination of mutual information-based feature selection, adaptive feature expansion, and recursively applied <i></i><math display=\"inline\"><msub><mrow><mi mathvariant=\"script\">l</mi></mrow><mrow><mn>0</mn></mrow></msub></math>-based sparse regression. In addition, it employs an information-theoretic measure to produce an approximate set of Pareto-optimal equations, each offering the best-found accuracy for a given complexity. Furthermore, our open-source implementation of SyMANTIC, built on the PyTorch ecosystem, facilitates easy installation and GPU acceleration. We demonstrate the effectiveness of SyMANTIC across a range of problems, including synthetic examples, scientific benchmarks, real-world material property predictions, and chaotic dynamical system identification from small datasets. Extensive comparisons show that SyMANTIC uncovers similar or more accurate models at a fraction of the cost of existing SR methods.","PeriodicalId":39,"journal":{"name":"Industrial & Engineering Chemistry Research","volume":"14 1","pages":""},"PeriodicalIF":3.9000,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SyMANTIC: An Efficient Symbolic Regression Method for Interpretable and Parsimonious Model Discovery in Science and Beyond\",\"authors\":\"Madhav R. Muthyala, Farshud Sorourifar, You Peng, Joel A. Paulson\",\"doi\":\"10.1021/acs.iecr.4c03503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Symbolic regression (SR) is an emerging branch of machine learning focused on discovering simple and interpretable mathematical expressions from data. Although a wide-variety of SR methods have been developed, they often face challenges such as high computational cost, poor scalability with respect to the number of input dimensions, fragility to noise, and an inability to balance accuracy and complexity. This work introduces SyMANTIC, a novel SR algorithm that addresses these challenges. SyMANTIC efficiently identifies (potentially several) low-dimensional descriptors from a large set of candidates (from ∼10<sup>5</sup> to ∼10<sup>10</sup> or more) through a unique combination of mutual information-based feature selection, adaptive feature expansion, and recursively applied <i></i><math display=\\\"inline\\\"><msub><mrow><mi mathvariant=\\\"script\\\">l</mi></mrow><mrow><mn>0</mn></mrow></msub></math>-based sparse regression. In addition, it employs an information-theoretic measure to produce an approximate set of Pareto-optimal equations, each offering the best-found accuracy for a given complexity. Furthermore, our open-source implementation of SyMANTIC, built on the PyTorch ecosystem, facilitates easy installation and GPU acceleration. We demonstrate the effectiveness of SyMANTIC across a range of problems, including synthetic examples, scientific benchmarks, real-world material property predictions, and chaotic dynamical system identification from small datasets. Extensive comparisons show that SyMANTIC uncovers similar or more accurate models at a fraction of the cost of existing SR methods.\",\"PeriodicalId\":39,\"journal\":{\"name\":\"Industrial & Engineering Chemistry Research\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":3.9000,\"publicationDate\":\"2025-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Industrial & Engineering Chemistry Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1021/acs.iecr.4c03503\",\"RegionNum\":3,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, CHEMICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Industrial & Engineering Chemistry Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1021/acs.iecr.4c03503","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, CHEMICAL","Score":null,"Total":0}
引用次数: 0

摘要

符号回归(SR)是机器学习的一个新兴分支,专注于从数据中发现简单且可解释的数学表达式。尽管已经开发了各种各样的SR方法,但它们经常面临诸如高计算成本,相对于输入维度数量的可扩展性差,易受噪声影响以及无法平衡准确性和复杂性等挑战。这项工作介绍了赛门铁克,一种解决这些挑战的新型SR算法。赛门铁克通过基于相互信息的特征选择、自适应特征扩展和递归应用的基于10的稀疏回归的独特组合,从大量候选(从~ 105到~ 1010或更多)中有效地识别(潜在的几个)低维描述符。此外,它采用了一种信息论的方法来产生一组近似的帕累托最优方程,每个方程都提供了给定复杂性的最佳精度。此外,我们的赛门铁克的开源实现,建立在PyTorch生态系统,便于安装和GPU加速。我们在一系列问题上展示了赛门铁克的有效性,包括合成示例、科学基准、现实世界材料特性预测以及从小数据集识别混沌动态系统。广泛的比较表明,赛门铁克发现了类似或更准确的模型,而成本只是现有SR方法的一小部分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

SyMANTIC: An Efficient Symbolic Regression Method for Interpretable and Parsimonious Model Discovery in Science and Beyond

SyMANTIC: An Efficient Symbolic Regression Method for Interpretable and Parsimonious Model Discovery in Science and Beyond
Symbolic regression (SR) is an emerging branch of machine learning focused on discovering simple and interpretable mathematical expressions from data. Although a wide-variety of SR methods have been developed, they often face challenges such as high computational cost, poor scalability with respect to the number of input dimensions, fragility to noise, and an inability to balance accuracy and complexity. This work introduces SyMANTIC, a novel SR algorithm that addresses these challenges. SyMANTIC efficiently identifies (potentially several) low-dimensional descriptors from a large set of candidates (from ∼105 to ∼1010 or more) through a unique combination of mutual information-based feature selection, adaptive feature expansion, and recursively applied l0-based sparse regression. In addition, it employs an information-theoretic measure to produce an approximate set of Pareto-optimal equations, each offering the best-found accuracy for a given complexity. Furthermore, our open-source implementation of SyMANTIC, built on the PyTorch ecosystem, facilitates easy installation and GPU acceleration. We demonstrate the effectiveness of SyMANTIC across a range of problems, including synthetic examples, scientific benchmarks, real-world material property predictions, and chaotic dynamical system identification from small datasets. Extensive comparisons show that SyMANTIC uncovers similar or more accurate models at a fraction of the cost of existing SR methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Industrial & Engineering Chemistry Research
Industrial & Engineering Chemistry Research 工程技术-工程:化工
CiteScore
7.40
自引率
7.10%
发文量
1467
审稿时长
2.8 months
期刊介绍: ndustrial & Engineering Chemistry, with variations in title and format, has been published since 1909 by the American Chemical Society. Industrial & Engineering Chemistry Research is a weekly publication that reports industrial and academic research in the broad fields of applied chemistry and chemical engineering with special focus on fundamentals, processes, and products.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信