Pub Date : 2022-02-06DOI: 10.1142/9789811234033_bmatter
P. Calafiura, D. Rousseau, K. Terao
{"title":"BACK MATTER","authors":"P. Calafiura, D. Rousseau, K. Terao","doi":"10.1142/9789811234033_bmatter","DOIUrl":"https://doi.org/10.1142/9789811234033_bmatter","url":null,"abstract":"","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"169 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126066423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-15DOI: 10.1142/9789811234033_0020
D. Rousseau, Andrey Ustyuzhanin
A number of scientific competitions have been organised in the last few years with the objective of discovering innovative techniques to perform typical High Energy Physics tasks, like event reconstruction, classification and new physics discovery. Four of these competitions are summarised in this chapter, from which guidelines on organising such events are derived. In addition, a choice of competition platforms and available datasets are described
{"title":"Machine Learning Scientific Competitions and Datasets","authors":"D. Rousseau, Andrey Ustyuzhanin","doi":"10.1142/9789811234033_0020","DOIUrl":"https://doi.org/10.1142/9789811234033_0020","url":null,"abstract":"A number of scientific competitions have been organised in the last few years with the objective of discovering innovative techniques to perform typical High Energy Physics tasks, like event reconstruction, classification and new physics discovery. Four of these competitions are summarised in this chapter, from which guidelines on organising such events are derived. In addition, a choice of competition platforms and available datasets are described","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116100590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-02DOI: 10.1142/9789811234033_0012
Javier Mauricio Duarte, J. Vlimant
Machine learning methods have a long history of applications in high energy physics (HEP). Recently, there is a growing interest in exploiting these methods to reconstruct particle signatures from raw detector data. In order to benefit from modern deep learning algorithms that were initially designed for computer vision or natural language processing tasks, it is common practice to transform HEP data into images or sequences. Conversely, graph neural networks (GNNs), which operate on graph data composed of elements with a set of features and their pairwise connections, provide an alternative way of incorporating weight sharing, local connectivity, and specialized domain knowledge. Particle physics data, such as the hits in a tracking detector, can generally be represented as graphs, making the use of GNNs natural. In this chapter, we recapitulate the mathematical formalism of GNNs and highlight aspects to consider when designing these networks for HEP data, including graph construction, model architectures, learning objectives, and graph pooling. We also review promising applications of GNNs for particle tracking and reconstruction in HEP and summarize the outlook for their deployment in current and future experiments.
{"title":"Graph Neural Networks for Particle Tracking and Reconstruction","authors":"Javier Mauricio Duarte, J. Vlimant","doi":"10.1142/9789811234033_0012","DOIUrl":"https://doi.org/10.1142/9789811234033_0012","url":null,"abstract":"Machine learning methods have a long history of applications in high energy physics (HEP). Recently, there is a growing interest in exploiting these methods to reconstruct particle signatures from raw detector data. In order to benefit from modern deep learning algorithms that were initially designed for computer vision or natural language processing tasks, it is common practice to transform HEP data into images or sequences. Conversely, graph neural networks (GNNs), which operate on graph data composed of elements with a set of features and their pairwise connections, provide an alternative way of incorporating weight sharing, local connectivity, and specialized domain knowledge. Particle physics data, such as the hits in a tracking detector, can generally be represented as graphs, making the use of GNNs natural. In this chapter, we recapitulate the mathematical formalism of GNNs and highlight aspects to consider when designing these networks for HEP data, including graph construction, model architectures, learning objectives, and graph pooling. We also review promising applications of GNNs for particle tracking and reconstruction in HEP and summarize the outlook for their deployment in current and future experiments.","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"27 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116429974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-27DOI: 10.1142/9789811234033_0004
B. Nachman
Modern machine learning tools offer exciting possibilities to qualitatively change the paradigm for new particle searches. In particular, new methods can broaden the search program by gaining sensitivity to unforeseen scenarios by learning directly from data. There has been a significant growth in new ideas and they are just starting to be applied to experimental data. This chapter introduces these new anomaly detection methods, which range from fully supervised algorithms to unsupervised, and include weakly supervised methods.
{"title":"Anomaly Detection for Physics Analysis and Less Than Supervised Learning","authors":"B. Nachman","doi":"10.1142/9789811234033_0004","DOIUrl":"https://doi.org/10.1142/9789811234033_0004","url":null,"abstract":"Modern machine learning tools offer exciting possibilities to qualitatively change the paradigm for new particle searches. In particular, new methods can broaden the search program by gaining sensitivity to unforeseen scenarios by learning directly from data. There has been a significant growth in new ideas and they are just starting to be applied to experimental data. This chapter introduces these new anomaly detection methods, which range from fully supervised algorithms to unsupervised, and include weakly supervised methods.","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124360234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-13DOI: 10.1142/9789811234026_0016
J. Brehmer, Kyle Cranmer
Our predictions for particle physics processes are realized in a chain of complex simulators. They allow us to generate high-fidelity simulated data, but they are not well-suited for inference on the theory parameters with observed data. We explain why the likelihood function of high-dimensional LHC data cannot be explicitly evaluated, why this matters for data analysis, and reframe what the field has traditionally done to circumvent this problem. We then review new simulation-based inference methods that let us directly analyze high-dimensional data by combining machine learning techniques and information from the simulator. Initial studies indicate that these techniques have the potential to substantially improve the precision of LHC measurements. Finally, we discuss probabilistic programming, an emerging paradigm that lets us extend inference to the latent process of the simulator.
{"title":"Simulation-Based Inference Methods for Particle Physics","authors":"J. Brehmer, Kyle Cranmer","doi":"10.1142/9789811234026_0016","DOIUrl":"https://doi.org/10.1142/9789811234026_0016","url":null,"abstract":"Our predictions for particle physics processes are realized in a chain of complex simulators. They allow us to generate high-fidelity simulated data, but they are not well-suited for inference on the theory parameters with observed data. We explain why the likelihood function of high-dimensional LHC data cannot be explicitly evaluated, why this matters for data analysis, and reframe what the field has traditionally done to circumvent this problem. We then review new simulation-based inference methods that let us directly analyze high-dimensional data by combining machine learning techniques and information from the simulator. Initial studies indicate that these techniques have the potential to substantially improve the precision of LHC measurements. Finally, we discuss probabilistic programming, an emerging paradigm that lets us extend inference to the latent process of the simulator.","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125706125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-27DOI: 10.1142/9789811234026_0019
S. Forte, J. Huston, R. Thorne, S. Carrazza, Jun Gao, Z. Kassabov, P. Nadolsky, J. Rojo
We discuss the determination of the parton substructure of hadrons by casting it as a peculiar form of pattern recognition problem in which the pattern is a probability distribution, and we present the way this problem has been tackled and solved. Specifically, we review the NNPDF approach to PDF determination, which is based on the combination of a Monte Carlo approach with neural networks as basic underlying interpolators. We discuss the current NNPDF methodology, based on genetic minimization, and its validation through closure testing. We then present recent developments in which a hyperoptimized deep-learning framework for PDF determination is being developed, optimized, and tested.
{"title":"Parton Distribution Functions","authors":"S. Forte, J. Huston, R. Thorne, S. Carrazza, Jun Gao, Z. Kassabov, P. Nadolsky, J. Rojo","doi":"10.1142/9789811234026_0019","DOIUrl":"https://doi.org/10.1142/9789811234026_0019","url":null,"abstract":"We discuss the determination of the parton substructure of hadrons by casting it as a peculiar form of pattern recognition problem in which the pattern is a probability distribution, and we present the way this problem has been tackled and solved. Specifically, we review the NNPDF approach to PDF determination, which is based on the combination of a Monte Carlo approach with neural networks as basic underlying interpolators. We discuss the current NNPDF methodology, based on genetic minimization, and its validation through closure testing. We then present recent developments in which a hyperoptimized deep-learning framework for PDF determination is being developed, optimized, and tested.","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127494152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-08-19DOI: 10.1142/9789811234033_0007
A. Butter, T. Plehn
LHC physics crucially relies on our ability to simulate events efficiently from first principles. Modern machine learning, specifically generative networks, will help us tackle simulation challenges for the coming LHC runs. Such networks can be employed within established simulation tools or as part of a new framework. Since neural networks can be inverted, they also open new avenues in LHC analyses.
{"title":"Generative Networks for LHC Events","authors":"A. Butter, T. Plehn","doi":"10.1142/9789811234033_0007","DOIUrl":"https://doi.org/10.1142/9789811234033_0007","url":null,"abstract":"LHC physics crucially relies on our ability to simulate events efficiently from first principles. Modern machine learning, specifically generative networks, will help us tackle simulation challenges for the coming LHC runs. Such networks can be employed within established simulation tools or as part of a new framework. Since neural networks can be inverted, they also open new avenues in LHC analyses.","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131833083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-05-30DOI: 10.1142/9789811234033_0002
Y. Coadou
Boosted decision trees are a very powerful machine learning technique. After introducing specific concepts of machine learning in the high-energy physics context and describing ways to quantify the performance and training quality of classifiers, decision trees are described. Some of their shortcomings are then mitigated with ensemble learning, using boosting algorithms, in particular AdaBoost and gradient boosting. Examples from high-energy physics and software used are also presented.
{"title":"Boosted Decision Trees","authors":"Y. Coadou","doi":"10.1142/9789811234033_0002","DOIUrl":"https://doi.org/10.1142/9789811234033_0002","url":null,"abstract":"Boosted decision trees are a very powerful machine learning technique. After introducing specific concepts of machine learning in the high-energy physics context and describing ways to quantify the performance and training quality of classifiers, decision trees are described. Some of their shortcomings are then mitigated with ensemble learning, using boosting algorithms, in particular AdaBoost and gradient boosting. Examples from high-energy physics and software used are also presented.","PeriodicalId":416365,"journal":{"name":"Artificial Intelligence for High Energy Physics","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129412575","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：