arXiv subjects

Philippa Duckett

Publications and source records attributed to Philippa Duckett.

4 recordsLinked to original sources

arXiv2026

Better Queries, Cheaper Attention: Adapting Transformers for Efficient Sparse Reconstruction

Query-based transformer decoders are effective for object reconstruction from sparse scientific sensor measurements, but their scalability to high-multiplicity data is limited by fixed, input-independent query sets and costly decoder cross-attention. We introduce a geometry-aware dynamic-query decoder that couples input-conditioned query construction with structured sparse cross-attention. Decoder queries are initialised from selected encoder-level measurement representations that serve as candidate trajectory seeds, making both query content and query multiplicity input-dependent. Local Strided Cross-Attention (LSCA) exploits the induced geometric ordering by replacing learned mask-gated cross-attention with a geometry-defined local support that restricts attention to physically plausible query-hit interactions and exposes sparsity for block-sparse execution. We study this architecture for charged-particle trajectory reconstruction in a simplified High-Luminosity Large Hadron Collider detector, where thousands of trajectories must be reconstructed from tens of thousands of sparse measurements. In the nominal configuration, the dynamic-query (DQ) architecture increases trajectory reconstruction efficiency from 94.1% to 98.1% and reduces the fake rate by more than a factor of two relative to the fixed-query baseline. The DQ+LSCA model reduces end-to-end inference latency by nearly 50% and peak allocated inference memory by more than a factor of 10 relative to the fixed-query baseline.

hep-ex↗

arXiv2024

Language hooks: a modular framework for augmenting LLM reasoning that decouples tool usage from the model and its prompt

Prompting and fine-tuning have emerged as two competing paradigms for augmenting language models with new capabilities, such as the use of tools. Prompting approaches are quick to set up but rely on providing explicit demonstrations of each tool's usage in the model's prompt, thus coupling tool use to the task at hand and limiting generalisation. Fine-tuning removes the need for task-specific demonstrations of tool usage at runtime; however, this ties new capabilities to a single model, thus making already-heavier setup costs a recurring expense. In this paper, we introduce language hooks, a novel framework for augmenting language models with new capabilities that is decoupled both from the model's task-specific prompt and from the model itself. The language hook algorithm interleaves text generation by the base model with the execution of modular programs that trigger conditionally based on the existing text and the available capabilities. Upon triggering, programs may call external tools, auxiliary language models (e.g. using tool specific prompts), and modify the existing context. We benchmark our method against state-of-the-art baselines, find that it outperforms task-aware approaches, and demonstrate its ability to generalise to novel tasks.

cs.CL↗

arXiv2024

Transformers for Charged Particle Track Reconstruction in High Energy Physics

Reconstructing charged particle tracks is a fundamental task in modern collider experiments. The unprecedented particle multiplicities expected at the High-Luminosity Large Hadron Collider (HL-LHC) pose significant challenges for track reconstruction, where traditional algorithms become computationally infeasible. To address this challenge, we present a novel learned approach to track reconstruction that adapts recent advances in computer vision and object detection. Our architecture combines a Transformer hit filtering network with a MaskFormer reconstruction model that jointly optimises hit assignments and the estimation of the charged particles' properties. Evaluated on the TrackML dataset, our best performing model achieves state-of-the-art tracking performance with 97% efficiency for a fake rate of 0.6%, and inference times of 100ms. Our tunable approach enables specialisation for specific applications like triggering systems, while its underlying principles can be extended to other reconstruction challenges in high energy physics. This work demonstrates the potential of modern deep learning architectures to address emerging computational challenges in particle physics while maintaining the precision required for groundbreaking physics analysis.

hep-ex↗

arXiv2022

Reconstructing charged particle track segments with a quantum-enhanced support vector machine

Reconstructing the trajectories of charged particles from the collection of hits they leave in the detectors of collider experiments like those at the Large Hadron Collider (LHC) is a challenging combinatorics problem and computationally intensive. The ten-fold increase in the delivered luminosity at the upgraded High Luminosity LHC will result in a very densely populated detector environment. The time taken by conventional techniques for reconstructing particle tracks scales worse than quadratically with track density. Accurately and efficiently assigning the collection of hits left in the tracking detector to the correct particle will be a computational bottleneck and has motivated studying possible alternative approaches. This paper presents a quantum-enhanced machine learning algorithm that uses a support vector machine (SVM) with a quantum-estimated kernel to classify a set of three hits (triplets) as either belonging to or not belonging to the same particle track. The performance of the algorithm is then compared to a fully classical SVM. The quantum algorithm shows an improvement in accuracy versus the classical algorithm for the innermost layers of the detector that are expected to be important for the initial seeding step of track reconstruction.

hep-ex↗