Yang Gao

Bio: Yang Gao is an academic researcher from University of Surrey. The author has contributed to research in topics: Large Hadron Collider & Higgs boson. The author has an hindex of 168, co-authored 2047 publications receiving 146301 citations. Previous affiliations of Yang Gao include China Agricultural University & University of Kassel.

Measurement of the differential cross-sections of prompt and non-prompt production of J/ψ and ψ(2S) in pp collisions at √s =7 and 8 TeV with the ATLAS detector

Abstract: The production rates of prompt and non-prompt J/psi and psi(2S) mesons in their dimuon decay modes are measured using 2.1 and 11.4 fb(-1) of data collected with the ATLAS experiment at the Large Ha ...

GraphNAS: Graph Neural Architecture Search with Reinforcement Learning

Abstract: Graph Neural Networks (GNNs) have been popularly used for analyzing non-Euclidean data such as social network data and biological data. Despite their success, the design of graph neural networks requires a lot of manual work and domain knowledge. In this paper, we propose a Graph Neural Architecture Search method (GraphNAS for short) that enables automatic search of the best graph neural architecture based on reinforcement learning. Specifically, GraphNAS first uses a recurrent network to generate variable-length strings that describe the architectures of graph neural networks, and then trains the recurrent network with reinforcement learning to maximize the expected accuracy of the generated architectures on a validation data set. Extensive experimental results on node classification tasks in both transductive and inductive learning settings demonstrate that GraphNAS can achieve consistently better performance on the Cora, Citeseer, Pubmed citation network, and protein-protein interaction network. On node classification tasks, GraphNAS can design a novel network architecture that rivals the best human-invented architecture in terms of test set accuracy.

Performance of top-quark and W -boson tagging with ATLAS in Run 2 of the LHC

Abstract: The performance of identification algorithms (“taggers”) for hadronically decaying top quarks and W bosons in pp collisions at s = 13 TeV recorded by the ATLAS experiment at the Large Hadron Collider is presented. A set of techniques based on jet shape observables are studied to determine a set of optimal cut-based taggers for use in physics analyses. The studies are extended to assess the utility of combinations of substructure observables as a multivariate tagger using boosted decision trees or deep neural networks in comparison with taggers based on two-variable combinations. In addition, for highly boosted top-quark tagging, a deep neural network based on jet constituent inputs as well as a re-optimisation of the shower deconstruction technique is presented. The performance of these taggers is studied in data collected during 2015 and 2016 corresponding to 36.1 fb - 1 for the tt¯ and γ+ jet and 36.7 fb - 1 for the dijet event topologies. © 2019, CERN for the benefit of the ATLAS collaboration.

Measurement of dijet angular distributions and search for quark compositeness in pp collisions at √s=7TeV

Abstract: Dijet angular distributions are measured over a wide range of dijet invariant masses in pp collisions at root s = 7 TeV, at the CERN LHC. The event sample, recorded with the CMS detector, corresponds to an integrated luminosity of 36 pb(-1). The data are found to be in good agreement with the predictions of perturbative QCD, and yield no evidence of quark compositeness. With a modified frequentist approach, a lower limit on the contact interaction scale for left-handed quarks of Lambda(+) = 5.6 TeV (Lambda(-) = 6.7 TeV) for destructive (constructive) interference is obtained at the 95% confidence level.

Muon reconstruction efficiency and momentum resolution of the ATLAS experiment in proton–proton collisions at √s=7 TeV in 2010

Abstract: This paper presents a study of the performance of the muon reconstruction in the analysis of proton-proton collisions at root s = 7TeV at the LHC, recorded by the ATLAS detector in 2010. This performance is described in terms of reconstruction and isolation efficiencies and momentum resolutions for different classes of reconstructed muons. The results are obtained from an analysis of J/psi meson and Z boson decays to dimuons, reconstructed from a data sample corresponding to an integrated luminosity of 40 pb(-1). The measured performance is compared to Monte Carlo predictions and deviations from the predicted performance are discussed.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

The Design and Analysis of Experiments

Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

Machine learning

Abstract: Machine Learning is the study of methods for programming computers to learn. Computers are applied to a wide range of tasks, and for most of these it is relatively easy for programmers to design and implement the necessary software. However, there are many tasks for which this is difficult or impossible. These can be divided into four general categories. First, there are problems for which there exist no human experts. For example, in modern automated manufacturing facilities, there is a need to predict machine failures before they occur by analyzing sensor readings. Because the machines are new, there are no human experts who can be interviewed by a programmer to provide the knowledge necessary to build a computer system. A machine learning system can study recorded data and subsequent machine failures and learn prediction rules. Second, there are problems where human experts exist, but where they are unable to explain their expertise. This is the case in many perceptual tasks, such as speech recognition, hand-writing recognition, and natural language understanding. Virtually all humans exhibit expert-level abilities on these tasks, but none of them can describe the detailed steps that they follow as they perform them. Fortunately, humans can provide machines with examples of the inputs and correct outputs for these tasks, so machine learning algorithms can learn to map the inputs to the outputs. Third, there are problems where phenomena are changing rapidly. In finance, for example, people would like to predict the future behavior of the stock market, of consumer purchases, or of exchange rates. These behaviors change frequently, so that even if a programmer could construct a good predictive computer program, it would need to be rewritten frequently. A learning program can relieve the programmer of this burden by constantly modifying and tuning a set of learned prediction rules. Fourth, there are applications that need to be customized for each computer user separately. Consider, for example, a program to filter unwanted electronic mail messages. Different users will need different filters. It is unreasonable to expect each user to program his or her own rules, and it is infeasible to provide every user with a software engineer to keep the rules up-to-date. A machine learning system can learn which mail messages the user rejects and maintain the filtering rules automatically. Machine learning addresses many of the same research questions as the fields of statistics, data mining, and psychology, but with differences of emphasis. Statistics focuses on understanding the phenomena that have generated the data, often with the goal of testing different hypotheses about those phenomena. Data mining seeks to find patterns in the data that are understandable by people. Psychological studies of human learning aspire to understand the mechanisms underlying the various learning behaviors exhibited by people (concept learning, skill acquisition, strategy change, etc.).