added some simple bibtex file with example latex file

2023-09-27 11:29:26 +02:00
parent 6de08dee25
commit f767742401
2 changed files with 374 additions and 0 deletions
@@ -0,0 +1,131 @@
+%%%%%%%%%%%%%%%% README %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+% Place the BIBTeX entry in the right category 
+% 
+% BIBTeX labels:  {SurnameYear}, as in Albertsson2018
+% Capitalized words in titles must be placed in {...}, as in:
+%                       title = {Beyond the proton drip line: {Bayesian} analysis}
+% Journal abbreviations:should be done according to the ISO4 standard:
+%                       https://academic-accelerator.com/Journal-Abbreviation/System
+% doi - include if possible
+% url - include if possible
+% do not include: abstract; eprint data, report numbers  for published papers;
+
+
+%%%%%%%%%%%%%%%%%  Published scientific articles  %%%%%%%%%%%%%%%%%%%
+
+
+@article{Cristoforetti:2012su,
+    author = "Cristoforetti, Marco and Di Renzo, Francesco and Scorzato, Luigi",
+    collaboration = "AuroraScience",
+    title = "{New approach to the sign problem in quantum field theories: High density QCD on a Lefschetz thimble}",
+    doi = "10.1103/PhysRevD.86.074506",
+    journal = "Phys. Rev. D",
+    volume = "86",
+    pages = "074506",
+    year = "2012"
+}
+
+
+%%%%%%%%%%%%%%%%%  Books  %%%%%%%%%%%%%%%%%%%
+
+@book{Goodfellow2016,
+author ={Goodfellow, Ian and Bengio, Yoshua and Courville, Aaron},
+title = {Deep Learning},
+publisher = {The MIT Press, Cambridge, Massachusetts},
+year = {2016}
+}
+
+@book{Bishop2006,
+author = {Bishop, Christopher M.},
+title = {Pattern Recognition and Machine Learning},
+year = {2006},
+publisher = {Springer Verlag, Berlin}
+}
+
+@book{Hastie2009,
+  author = {Hastie, Trevor and Tibshirani, Robert and Friedman, Jerome},
+  publisher = {Springer Verlag, Berlin},
+  title = {The Elements of Statistical Learning: Data Mining, Inference and Prediction},
+  year = {2009}
+}
+
+
+@book{Murphy2012,
+author = {Murphy, Kevin P.},
+title = {Machine Learning: A Probabilistic Perspective},
+year = {2012},
+publisher = {The MIT Press, Cambdridge, Massachusetts}
+}
+
+@book{Schuld2018,
+author = {Schuld, Maria and Petruccione, Francesco},
+title = {Supervised Learning with Quantum Computers},
+year = {2018},
+publisher = {Springer Verlag, Berlin}
+}
+
+
+@book{Burkard2012, 
+    author = {R.E. Burkard and M. Dell'Amico and S. Martello},
+    title = {Assignment Problems},
+    publisher = {SIAM, Philadelphia, USA},
+    year = {2012}
+}    
+
+@BOOK{NAS-Models2012,
+  author    = "{National Research Council}",
+  title     = "Assessing the Reliability of Complex Models: Mathematical and Statistical Foundations of Verification, Validation, and Uncertainty Quantification",
+  isbn      = "978-0-309-25634-6",
+  doi       = "10.17226/13395",
+  url       = "https://www.nap.edu/catalog/13395/assessing-the-reliability-of-complex-models-mathematical-and-statistical-foundations",
+  year      = 2012,
+  publisher = "The National Academies Press",
+  address   = "Washington, DC"
+}
+
+%%%%%%%%%%%%%%%%%  REPORTS and THESES %%%%%%%%%%%%%%%%%%%
+
+@techreport{Young2009,
+  title = {Scientific grand challenges: forefront questions in nuclear science and the role of computing at the extreme scale},
+  author = {Young, G. and Dean, D.J. and Savage, M.J.},
+  year = {2009},
+  address = {{Washington, D.C.}},
+  institution = {U.S. Department of Energy},
+  url="https://science.osti.gov/-/media/ascr/pdf/program-documents/docs/Np_report.pdf"
+}
+
+
+
+@phdthesis{Bradt2017,
+author = {Bradt, Joshua William},
+school = {Michigan State University},
+title = {{Measurement of isobaric analogue resonances of 47Ar with the active target time projection chamber}},
+URL={http://publications.nscl.msu.edu/thesis/\%20Brandt_2017_5279.pdf},
+year = {2017}
+}
+
+
+%%%%%%%%%%%%%%%%%  Preprints %%%%%%%%%%%%%%%%%%%%%%%%%
+
+@misc{pescia2021,
+      title={Neural-Network Quantum States for Periodic Systems in Continuous Space}, 
+      author={Gabriel Pescia and Jiequn Han and Alessandro Lovato and Jianfeng Lu and Giuseppe Carleo},
+      year={2021},
+      eprint={2112.11957},
+      archivePrefix={arXiv},
+      primaryClass={quant-ph}
+}
+
+
+%%%%%%%%%%%%%%%%%  Conference proceedings  %%%%%%%%%%%%%%%%%%%%%%%%%
+
+@inproceedings{Chen:2021jey,
+    author = "Chen, Shi-Yang and Ding, Heng-Tong and Liu, Fei-Yi and Papp, Gabor and Yang, Chun-Bin",
+    title = "{Machine learning Hadron Spectral Functions in Lattice QCD}",
+    eprint = "2112.00460",
+    archivePrefix = "arXiv",
+    primaryClass = "hep-lat",
+    month = "12",
+    year = "2021"
+}
+
@@ -0,0 +1,243 @@
+
+\documentclass[aps,rmp,reprint,amsmath,amssymb,graphicx,longbibliography]{revtex4-1}
+
+\usepackage{bm}
+\usepackage{graphicx}
+\usepackage{epstopdf}
+\usepackage{wrapfig}
+\usepackage{array} 
+\usepackage{listings}
+\usepackage[para,online,flushleft]{threeparttablex}
+\usepackage{booktabs,dcolumn}
+\usepackage{color}
+ 
+
+\usepackage{textpos}
+\usepackage{booktabs}
+\usepackage{multirow,bigdelim}
+\usepackage{float}
+
+\usepackage{upgreek} %upalpha in Saxena2021 Reference
+
+\usepackage[utf8]{inputenc}
+\usepackage{hyperref}
+\hypersetup{breaklinks=true,colorlinks=true,linkcolor=blue,citecolor=blue,filecolor=magenta,urlcolor=blue}
+
+
+
+
+\usepackage{xcolor}
+%\newcommand{\contrib}[1]{\textcolor{red}{#1}}
+%\newcommand{\comment}[1]{\textcolor{blue}{#1}}
+
+%\newcommand{\WN}[1]{{\color{red} #1}}
+
+\makeatletter
+\def\@bibdataout@aps{%
+\immediate\write\@bibdataout{%
+@CONTROL{%
+apsrev41Control%
+\longbibliography@sw{%
+    ,author="08",editor="1",pages="1",title="0",year="1"%
+    }{%
+    ,author="08",editor="1",pages="1",title="",year="1"%
+    }%
+  }%
+}%
+\if@filesw \immediate \write \@auxout {\string \citation {apsrev41Control}}\fi
+}
+\makeatother
+
+
+%\usepackage[left]{lineno}
+%\linenumbers
+
+
+\begin{document}
+%\pagenumbering{gobble} 
+
+\title{Artificial Intelligence and Machine Learning for Nuclear Physics}
+
+\author{Morten Hjorth-Jensen and many other}
+\affiliation{Facility for Rare Isotope Beams and Department of Physics and Astronomy, Michigan State University, MI 48824, USA}
+\affiliation{Department of Physics and Center for Computing in Science Education, University of Oslo, N-0316 Oslo, Norway}
+
+
+\begin{abstract}
+    Advances in artificial intelligence/machine learning methods provide tools that have broad applicability in scientific research.  These techniques are being applied across the diversity of nuclear physics research topics, leading to advances that will facilitate scientific discoveries and societal applications. 
+    This review provides a snapshot of nuclear physics research  which has been transformed by  artificial intelligence and machine learning techniques. 
+\end{abstract}
+
+\maketitle
+
+\tableofcontents
+
+
+\section{Introduction} 
+
+This Review represents an up-to-date summary of  work in the application of artificial intelligence (AI) and machine learning (ML)
+in nuclear science, covering topics in nuclear theory, experimental methods, accelerator technology, and nuclear data.
+
+
+Nuclear physics is a well-established field, with more than a century of fundamental discoveries covering a huge span of degrees of freedom, energy scales and length scales, ranging from our basic understanding of  fundamental constituents of matter  to the structure of stars and the synthesis of the elements in the Cosmos. Experiments 
+produce data volumes that range in complexity and heterogeneity, thereby posing enormous challenges to their 
+ design,  their execution, and
+the statistical data analysis.
+ 
+ Theoretical modeling of nuclear properties is, in most physical cases
+ of interest, limited by the large amount of degrees of freedom in
+ quantum-mechanical calculations. The analysis of experimental data
+ and the theoretical modeling of nuclear systems aims, as is the case
+ in all fields of physics, at uncovering the basic laws of motion in
+ order to make predictions and estimations, as well as finding
+ correlations and causations for strongly interacting matter. The
+ broad aims of nuclear physics as a field correspond to a highly
+ distributed scientific enterprise. Experimental efforts utilize many
+ laboratories worldwide, each with unique operation, data acquisition,
+ and analysis methods. Similarly, the scales of focus spanned in
+ theoretical nuclear physics lead to broad needs for algorithmic
+ methods and uncertainty quantification. These efforts, utilizing
+ arrays of data types across size and energy scales, create a perfect
+ environment for applications of AI/ML methods.
+
+
+
+
+\section{Artificial Intelligence and Machine Learning for nuclear physics in broad strokes}
+
+
+ Statistics, data science, and AI/ML form important fields of research
+ in modern science. They describe how to learn and make predictions
+ from data, and enable the extraction of key information about
+ physical processes and the underlying scientific laws based on large
+ datasets. As such, recent advances in AI capabilities are being
+ applied to advance scientific discoveries in the physical sciences.
+
+
+
+
+Ideally, AI represents the science of building models to perform a
+task without being explicitly programmed. ML tasks fall under the
+broader AI umbrella. We will henceforth refer to the methods discussed
+as ``AI/ML''. The idea is that there exist generic algorithms which
+can be used to find patterns in a broad class of datasets without
+having to write code specifically for each problem. The algorithm
+builds its own logic based on the data. The attentive reader should
+however always keep in mind that machines and algorithms are to a
+large extent developed by humans. The choice of a specific AI/ML
+algorithm is governed by the insights and knowledge about a specific
+system.
+
+
+
+There exist many AI/ML approaches; they are often split into two main
+categories, supervised and unsupervised. In supervised learning, data
+are labeled and one lets a specific ML algorithm learn and deduce
+patterns in the datasets. This allows one to make predictions about
+future events and/or data not included in the training set.  On the
+other hand, unsupervised learning is a method for finding patterns and
+relationship in datasets without any prior knowledge of the
+system. Many researchers also operate with a third category, dubbed
+reinforcement learning. This is a paradigm of learning inspired by
+behavioral psychology, where actions are learned to maximize reward.
+One may encounter reinforcement learning being accompanied by
+supervised deep learning methods. Furthermore, what is often referred
+to as semi-supervised learning, entails developing algorithms that aim
+at learning from a dataset that includes both labeled and unlabeled
+data.
+
+
+Another way to categorize AI/ML tasks is to consider the desired output of a system. Some of the most common tasks are:
+\makeatletter
+\renewenvironment{description}%
+               {\list{}{\leftmargin=10pt % <------- Adjust this length
+                        \labelwidth\z@ \itemindent-\leftmargin
+                        \let\makelabel\descriptionlabel}}%
+               {\endlist}
+\makeatother
+\begin{description}
+    \item[Classification] Outputs are divided into two or more classes. The goal is to produce a model that assigns inputs into one of these classes. An example is to identify digits based on pictures of hand-written numbers. 
+\item[Regression] Finding a functional relationship between an input dataset and a reference dataset. The goal is to construct a function that maps input data into continuous output values.
+\item[Clustering] Data are divided into groups with certain common traits, without knowing the different groups beforehand. This AI/ML task falls  under the category of unsupervised learning.
+\item[Generation] Building a model to generate data that are akin to a training dataset in both examples and distributions of examples. Most generative models are types of unsupervised learning.
+\end{description}
+In Table\,\ref{tab:acronyms} we list many of the methods encountered in this work, with their respective abbreviations.
+\begin{table*}[!htb]
+ \caption{Table of AI/ML with indication on the main type of learning (S: supervised,  U: unsupervised,  Semi-S: semi-supervised).
+ }
+    \label{tab:acronyms}
+\begin{ruledtabular}
+    \begin{tabular}{cll} 
+    Acronym & Method & Type of Learning \\ \hline 
+    AE & Autoencoders & U \\
+    ANN     & Artificial Neural Networks & S  \\ 
+  BED & Bayesian Experimental Design   & S \\
+        BM & Boltzmann Machines & U \\
+    BMA & Bayesian Model Averaging & S \\
+    BMM & Bayesian Model Mixing & Semi-S \\
+    BO & Bayesian Optimization & S \\
+    BNN & Bayesian Neural Networks & S \\
+%  CL & Clustering Methods & U \\ %MPK none found in text 
+    CNN & Convolutional Neural Networks & S \\
+     EMB  & Ensemble Methods  and Boosting, including Decision Trees and Random Forests & S \\
+  %  FFNN & Feed Forward Neural Network & S \\  %MPK changed in text
+    GAN & Generative Adversarial Networks  & U \\
+    GP & Gaussian Processes  & Semi-S \\
+    KNN & $k$-nearest neighbors & U \\
+    KR & Kernel Regression & S \\
+    LR & Logistic Regression & S\\ 
+    LSTM & Long short-term memory & S\\
+%    MLP & Multilayer Perceptron & S\\ %MPK changed in text
+    PCA & Principal Component Analysis \& Dimensionality Reduction & U \\
+    REG    & Linear Regression  & S \\
+    RL & Reinforcement Learning & Neither S nor U \\
+    RNN & Recurrent Neural Networks & S \\
+    SVM & Support Vector Machines & S \\
+    VAE & Variational Auto Encoders & U 
+     \end{tabular}
+ \end{ruledtabular}  
+\end{table*}
+
+
+The methods we cover here have three central elements in common,
+irrespective of whether we deal with supervised, unsupervised, or
+semi-supervised learning. The first element is some dataset (which can
+be subdivided into training, validation, and test data), the second
+element is a model, which is normally a function of some parameters to
+be determined by the chosen optimization process. The model reflects
+our prior knowledge of the system (or lack thereof). As an example, if
+we know that our data show a behavior similar to what would be
+predicted by a polynomial, fitting the data to a polynomial of some
+degree would determine our model.  The last element is a so-called
+cost (or loss, error, penalty, or risk) function which allows us to
+present an estimate on how good our model is in reproducing the data
+it is supposed to train. This is the function which is optimized in
+order to obtain the best prediction for the data under study. The
+simplest cost function in a regression analysis (fitting a continuous
+function to the data) is the so-called mean squared error function
+while for a binary classification problem, the so-called cross entropy
+is widely used, see, e.g., \cite{Murphy2012,Bishop2006,Hastie2009} for
+more details. We will henceforth refer to this element as the
+assessment of a given method.
+
+
+ 
+Traditionally, the field of AI/ML has had its main focus on
+predictions and correlations.  In AI/ML and prediction-based tasks, we
+are often interested in developing algorithms that are capable of
+learning patterns from existing data in an automated fashion, and then
+using these learned patterns to make predictions or assessments of new
+data. In some cases, our primary concern is the quality of the
+predictions or assessments, with perhaps less focus on the underlying
+patterns (and probability distributions) that were learned in order to
+make these predictions.  However, in many nuclear physics studies, we
+are equally interested in being able to estimate errors and find
+causations.  In this Colloquium, we emphasize the role of predictions
+and correlations as well as error estimation and causations in
+statistical learning and ML.  For general references on these topics
+and discussions of frequentist and Bayesian methodologies, see, e.g.,
+\cite{Bishop2006, Goodfellow2016, Murphy2012, Hastie2009}.
+
+
+\bibliography{References} % add  references to this file
+\end{document}