arXiv subjects

Stefano Rosati

Publications and source records attributed to Stefano Rosati.

4 recordsLinked to original sources

arXiv2026

Learning to Reconstruct: A Differentiable Approach to Muon Tracking at the LHC

Reconstructing the trajectories of charged particles in high-energy collisions requires high precision to ensure reliable event reconstruction and accurate downstream physics analyses. In particular, both precise hit selection and transverse momentum estimation are essential to improve the overall resolution of reconstructed physics observables. Enhanced momentum resolution also enables more efficient trigger threshold settings, leading to more effective data selection within the given data acquisition constraints. In this paper, we introduce a novel end-to-end tracking approach that employs the differentiable programming paradigm to incorporate physics priors directly into a machine learning model. This results in an optimized pipeline capable of simultaneously reconstructing tracks and accurately determining their transverse momenta. The model combines a graph attention network with differentiable clustering and fitting routines, and is trained using a composite loss that, due to its differentiable design, allows physical constraints to be back-propagated effectively through both the neural network and the fitting procedures. This proof of concept shows that introducing differentiable connections within the reconstruction process improves overall performance compared to an equivalent factorized and more standard-like approach, highlighting the potential of integrating physics information through differentiable programming.

hep-ex↗

arXiv2015

UAVs using Bayesian Optimization to Locate WiFi Devices

We address the problem of localizing non-collaborative WiFi devices in a large region. Our main motive is to localize humans by localizing their WiFi devices, e.g. during search-and-rescue operations after a natural disaster. We use an active sensing approach that relies on Unmanned Aerial Vehicles (UAVs) to collect signal-strength measurements at informative locations. The problem is challenging since the measurement is received at arbitrary times and they are received only when the UAV is in close proximity to the device. For these reasons, it is extremely important to make prudent decision with very few measurements. We use the Bayesian optimization approach based on Gaussian process (GP) regression. This approach works well for our application since GPs give reliable predictions with very few measurements while Bayesian optimization makes a judicious trade-off between exploration and exploitation. In field experiments conducted over a region of 1000 $\times$ 1000 $m^2$, we show that our approach reduces the search area to less than 100 meters around the WiFi device within 5 minutes only. Overall, our approach localizes the device in less than 15 minutes with an error of less than 20 meters.

cs.AI↗

arXiv2013

Speed-Aware Routing for UAV Ad-Hoc Networks

In this paper we examine mobile ad-hoc networks (MANET) composed by unmanned aerial vehicles (UAVs). Due to the high-mobility of the nodes, these networks are very dynamic and the existing routing protocols partly fail to provide a reliable communication. We present Predictive-OLSR an extension to the Optimized Link-State Routing (OLSR) protocol: it enables efficient routing in very dynamic conditions. The key idea is to exploit GPS information to aid the routing protocol. Predictive-OLSR weights the expected transmission count (ETX) metric, taking into account the relative speed between the nodes. We provide numerical results obtained by a MAC-layer emulator that integrates a flight simulator to reproduce realistic flight conditions. These numerical results show that Predictive-OLSR significantly outperforms OLSR and BABEL, providing a reliable communication even in very dynamic conditions.

cs.NI↗

arXiv2013

LLR Compression for BICM Systems Using Large Constellations

Digital video broadcasting (DVB-C2) and other modern communication standards increase diversity by means of a symbol-level interleaver that spans over several codewords. De-interleaving at the receiver requires a large memory, which has a significant impact on the implementation cost. In this paper, we propose a technique that reduces the de-interleaver memory size. By quantizing log-likelihood ratios with bit-specific quantizers and compressing the quantized output, we can significantly reduce the memory size with a negligible increase in computational complexity. Both the quantizer and compressor are designed via a GMI-based maximization procedure. For a typical DVB-C2 scenario, numerical results show that the proposed solution enables a memory saving up to 30%.

cs.IT↗