skip to main content
Explore Scholarly Publications and Datasets in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 3

Search for: All records

Creators/Authors contains: "Cranmer, Kyle"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ( , Physical Review D)
    Free, publicly-accessible full text available March 1, 2023
  2. ; ; ; ; ; ; ; ; ( , Physical Review D)
    Free, publicly-accessible full text available December 1, 2022
  3. ; ; ; ; ; ; ; ( , The European Physical Journal C)
    Abstract Jet classification is an important ingredient in measurements and searches for new physics at particle colliders, and secondary vertex reconstruction is a key intermediate step in building powerful jet classifiers. We use a neural network to perform vertex finding inside jets in order to improve the classification performance, with a focus on separation of bottom vs. charm flavor tagging. We implement a novel, universal set-to-graph model, which takes into account information from all tracks in a jet to determine if pairs of tracks originated from a common vertex. We explore different performance metrics and find our method to outperformmore »traditional approaches in accurate secondary vertex reconstruction. We also find that improved vertex finding leads to a significant improvement in jet classification performance.« less
    Full Text Available 
  4. ; ; ; ( , Journal of Open Source Software)
    Full Text Available 
  5. ; ; ; ( , Computing and Software for Big Science)
    Full Text Available 
  6. ; ; ; ; ; ; ; ( , Physical Review D)
    Full Text Available 
  7. ; ; ; ; ; ; ; ; ; ; et al ( , SciPost Physics)
    The statistical models used to derive the results of experimental analyses are of incredible scientific value andare essential information for analysis preservation and reuse. In this paper, we make the scientific case for systematically publishing the full statistical models and discuss the technical developments that make this practical. By means of a variety of physics cases -including parton distribution functions, Higgs boson measurements, effective field theory interpretations, direct searches for new physics, heavy flavor physics, direct dark matter detection, world averages, and beyond the Standard Model global fits -we illustrate how detailed information on the statistical modelling can enhance themore »short- and long-term impact of experimental results.« less
    Free, publicly-accessible full text available January 1, 2023
  8. ; ; ; ; ; ; ; ( , AISTATS)
    Accepted Manuscript Full Text Available
  9. ; ; ; ; ; ; ; ; ( , UAI)
    Accepted Manuscript Full Text Available
  10. ; ; ; ; ; ; ; ; ( , The Conference on Uncertainty in Artificial Intelligence (UAI))
    Hierarchical clustering is a critical task in numerous domains. Many approaches are based on heuristics and the properties of the resulting clusterings are studied post hoc. However, in several applications, there is a natural cost function that can be used to characterize the quality of the clustering. In those cases, hierarchical clustering can be seen as a combinatorial optimization problem. To that end, we introduce a new approach based on A* search. We overcome the prohibitively large search space by combining A* with a novel \emph{trellis} data structure. This combination results in an exact algorithm that scales beyond previous statemore »of the art, from a search space with 10^12 trees to 10^15 trees, and an approximate algorithm that improves over baselines, even in enormous search spaces that contain more than 10^1000 trees. We empirically demonstrate that our method achieves substantially higher quality results than baselines for a particle physics use case and other clustering benchmarks. We describe how our method provides significantly improved theoretical bounds on the time and space complexity of A* for clustering.« less
    Accepted Manuscript Full Text Available