Show simple item record

dc.contributor.advisorJustin M. Solomon.en_US
dc.contributor.authorSarda, Nilai Manish.en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2020-09-15T22:01:52Z
dc.date.available2020-09-15T22:01:52Z
dc.date.copyright2020en_US
dc.date.issued2020en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/127518
dc.descriptionThesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May, 2020en_US
dc.descriptionCataloged from the official PDF of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 123-136).en_US
dc.description.abstractIn this thesis, we explore concepts related to anomaly detection at particle accelerators. In an extremely high-energy proton-proton collision, sprays of subatomic particles are generated and destroyed at extremely short timescales. Detecting anomalies in these event signatures is a crucial step in experimentally verifying new theories of physics beyond the Standard Model. Towards this end, we analyze the geometric structure of event signatures, which can be represented as discrete distributions of energy on the surface of a cylinder. Therefore, we approach the problem from the framework of optimal transportation. The optimal transport distance is the map between two measures which minimizes the total work required to transform one measure into another. First, we provide theoretical improvements in learning with transport-type distances. We show that minimizing the transport distance also leads to a coreset with respect to a broad class of functions, by showing a bound on the quadrature error of a Monte Carlo integration. In addition, we develop an unbiased estimator for a Gaussian kernel based on the sliced Wasserstein distance, which is based on the one-dimensional version of optimal transport. Next, we use these kernels within the framework of discriminative anomaly detection. The methods we consider apply transport distance-based kernels to classify anomalies on an event-by-event basis. We apply these techniques to two datasets, one from the field of particle physics and one inspired by biology. This comparison allows us to argue empirically which models are most effective for which types of anomalies. Finally, we move to the generative setting, and build a topic model based on the dijet factorization theorem to perform anomaly detection and quark/gluon discrimination. This approach leverages the fact that each jet in a dijet pair is statistically independent, and uses matrix factorization to disentangle the component distributions.en_US
dc.description.statementofresponsibilityby Nilai Manish Sarda.en_US
dc.format.extent136 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleOn anomaly detection in particle acceleratorsen_US
dc.typeThesisen_US
dc.description.degreeM. Eng.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.identifier.oclc1193029286en_US
dc.description.collectionM.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Scienceen_US
dspace.imported2020-09-15T22:01:52Zen_US
mit.thesis.degreeMasteren_US
mit.thesis.departmentEECSen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record