{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:15:27Z","timestamp":1770995727018,"version":"3.50.1"},"reference-count":20,"publisher":"IOP Publishing","issue":"2","license":[{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"vor","delay-in-days":5,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"tdm","delay-in-days":5,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000015","name":"US Department of Energy","doi-asserted-by":"crossref","award":["DE-SC0011939"],"award-info":[{"award-number":["DE-SC0011939"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"crossref","award":["PHY-1624356"],"award-info":[{"award-number":["PHY-1624356"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Mach. Learn.: Sci. Technol."],"published-print":{"date-parts":[[2022,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Particle production from secondary proton-proton collisions, commonly referred to as pile-up, impair the sensitivity of both new physics searches and precision measurements at large hadron collider (LHC) experiments. We propose a novel algorithm, <jats:sc>Puma<\/jats:sc>, for modeling pile-up with the help of deep neural networks based on sparse transformers. These attention mechanisms were developed for natural language processing but have become popular in other applications. In a realistic detector simulation, our method outperforms classical benchmark algorithms for pile-up mitigation in key observables. It provides a perspective for mitigating the effects of pile-up in the high luminosity era of the LHC, where up to 200 proton-proton collisions are expected to occur simultaneously.<\/jats:p>","DOI":"10.1088\/2632-2153\/ac7198","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T22:27:10Z","timestamp":1652999230000},"page":"025012","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Pile-up mitigation using attention"],"prefix":"10.1088","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5270-7540","authenticated-orcid":true,"given":"B","family":"Maier","sequence":"first","affiliation":[]},{"given":"S M","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"G","family":"de Castro","sequence":"additional","affiliation":[]},{"given":"M","family":"Goncharov","sequence":"additional","affiliation":[]},{"given":"Ch","family":"Paus","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4235-7265","authenticated-orcid":false,"given":"M","family":"Schott","sequence":"additional","affiliation":[]}],"member":"266","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"key":"mlstac7198bib1","doi-asserted-by":"publisher","DOI":"10.1088\/1748-0221\/12\/10\/p10003","volume":"12","author":"Sirunyan","year":"2017","journal-title":"J. Instrum."},{"key":"mlstac7198bib2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/JHEP10(2014)059","volume":"2014","author":"Bertolini","year":"2014","journal-title":"J. High Energy Phys."},{"key":"mlstac7198bib3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1140\/epjc\/s10052-015-3267-2","volume":"75","author":"Cacciari","year":"2015","journal-title":"Europhys. J. C"},{"key":"mlstac7198bib4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/JHEP12(2017)051","volume":"2017","author":"Komiske","year":"2017","journal-title":"J. High Energy Phys."},{"key":"mlstac7198bib5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1140\/epjp\/i2019-12710-3","volume":"134","author":"Mart\u00ednez","year":"2019","journal-title":"Europhys. J. Plus"},{"key":"mlstac7198bib6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1140\/epjp\/s13360-020-00497-3","volume":"135","author":"Mikuni","year":"2020","journal-title":"Europhys. J. Plus"},{"key":"mlstac7198bib7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/JHEP02(2014)057","volume":"2014","author":"de Favereau","year":"2014","journal-title":"J. High Energy Phys."},{"key":"mlstac7198bib8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cpc.2015.01.024","volume":"191","author":"Sj\u00f6strand","year":"2015","journal-title":"Comput. Phys. Commun."},{"key":"mlstac7198bib9","doi-asserted-by":"publisher","first-page":"032","DOI":"10.1007\/JHEP03(2011)032","volume":"2011","author":"Corke","year":"2011","journal-title":"J. High Energy Phys."},{"key":"mlstac7198bib10","first-page":"pp 1","article-title":"Neural machine translation by jointly learning to align and translate","author":"Bahdanau","year":"2015"},{"key":"mlstac7198bib11","first-page":"pp 5998","article-title":"Attention is all you need","author":"Vaswani","year":"2017"},{"key":"mlstac7198bib12","article-title":"Sparse transformer: concentrated attention through explicit selection","author":"Zhao","year":"2020"},{"key":"mlstac7198bib13","author":"Child","year":"2019"},{"key":"mlstac7198bib14","first-page":"pp 370","article-title":"Sparse and constrained attention for neural machine translation","author":"Malaviya","year":"2018"},{"key":"mlstac7198bib15","article-title":"Longformer: the long-document transformer","author":"Beltagy","year":"2020"},{"key":"mlstac7198bib16","first-page":"pp 8024","article-title":"Pytorch: an imperative style, high-performance deep learning library","author":"Paszke","year":"2019"},{"key":"mlstac7198bib17","author":"Wolf","year":"2019"},{"key":"mlstac7198bib18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0168-9002(97)00048-X","volume":"389","author":"Brun","year":"1997","journal-title":"Nucl. Instrum. Methods Phys. Res. A"},{"key":"mlstac7198bib19","author":"Kingma","year":"2014"},{"key":"mlstac7198bib20","first-page":"pp 464","article-title":"Cyclical learning rates for training neural networks","author":"Smith","year":"2017"}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T09:07:54Z","timestamp":1663060074000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ac7198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,1]]},"references-count":20,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,6,6]]},"published-print":{"date-parts":[[2022,6,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/ac7198","relation":{},"ISSN":["2632-2153"],"issn-type":[{"value":"2632-2153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,1]]},"assertion":[{"value":"Pile-up mitigation using attention","name":"article_title","label":"Article Title"},{"value":"Machine Learning: Science and Technology","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 2022 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2021-11-01","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2022-05-19","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2022-06-06","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}