Rajneil Baruah, Subhadeep Mondal, Sunando Kumar Patra, Satyajit Roy
{"title":"Probing intractable beyond-standard-model parameter spaces armed with machine learning","authors":"Rajneil Baruah, Subhadeep Mondal, Sunando Kumar Patra, Satyajit Roy","doi":"10.1140/epjs/s11734-024-01236-w","DOIUrl":null,"url":null,"abstract":"<p>This article attempts to summarize the effort by the particle physics community in addressing the tedious work of determining the parameter spaces of beyond-the-standard-model (BSM) scenarios, allowed by data. These spaces, typically associated with a large number of dimensions, especially in the presence of nuisance parameters, suffer from the curse of dimensionality and thus render naive sampling of any kind—even the computationally inexpensive ones—ineffective. Over the years, various new sampling (from variations of Markov Chain Monte Carlo (MCMC) to dynamic nested sampling) and machine learning (ML) algorithms have been adopted by the community to alleviate this issue. If not all, we discuss potentially the most important ones among them and the significance of their results, in detail.</p>","PeriodicalId":501403,"journal":{"name":"The European Physical Journal Special Topics","volume":"2012 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The European Physical Journal Special Topics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1140/epjs/s11734-024-01236-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This article attempts to summarize the effort by the particle physics community in addressing the tedious work of determining the parameter spaces of beyond-the-standard-model (BSM) scenarios, allowed by data. These spaces, typically associated with a large number of dimensions, especially in the presence of nuisance parameters, suffer from the curse of dimensionality and thus render naive sampling of any kind—even the computationally inexpensive ones—ineffective. Over the years, various new sampling (from variations of Markov Chain Monte Carlo (MCMC) to dynamic nested sampling) and machine learning (ML) algorithms have been adopted by the community to alleviate this issue. If not all, we discuss potentially the most important ones among them and the significance of their results, in detail.