arXiv subjects

Lorenzo Valente

Publications and source records attributed to Lorenzo Valente.

4 recordsLinked to original sources

arXiv2026

Transferable Fast Calorimeter Shower Generation via Multi-Geometry Pre-training

Detailed Geant4 simulation of calorimeter showers dominates the computing budget of high-energy physics experiments. Deep generative surrogates reduce this cost, but they have remained tied to the detector they were trained on, so each new geometry needs a large in-domain dataset. We study whether a single point cloud shower generator can be pre-trained on multiple detectors and transferred to unseen calorimeters. The pre-training geometries come from synthetic geometric variation rather than real-detector data. We introduce SimpleBox, a family of $10^4$ box calorimeters spanning the plane of sampling fraction and longitudinal segmentation, and benchmark it against pre-training on realistic detectors. On a calorimeter unseen in pre-training, with $10^3$ target showers for fine-tuning, the two priors reduce the aggregated sliced Wasserstein distance to Geant4 by factors of 5.2 (synthetic) and 8.0 (realistic) relative to training from scratch. At larger target sizes the synthetic prior performs better than the realistic one. Geometric diversity alone is therefore a practical way to pre-train a transferable shower generator.

physics.ins-det↗

arXiv2026

CaloClouds3: Ultra-Fast Geometry-Independent Highly-Granular Calorimeter Simulation

We present CaloClouds3, a model for the fast simulation of photon showers in the barrel of a high granularity detector. This iteration demonstrates for the first time how a pointcloud model can employ angular conditioning to replicate photons at all incident angles. Showers produced by this model can be used across the whole detector barrel, due to specially produced position agnostic training data. With this flexibility, the model is usable in a full simulation and reconstruction chain, which offers a further handle for evaluating physics performance of the model. As inference time is a crucial consideration for a generative model, the pre-processing and hyperparameters are aggressively optimised, achieving a speed up factor of two orders of magnitude over Geant4 at inference.

physics.ins-det↗

arXiv2025

Cross-Geometry Transfer Learning in Fast Electromagnetic Shower Simulation

Accurate particle shower simulation remains a critical computational bottleneck for high-energy physics. Traditional Monte Carlo methods, such as Geant4, are computationally prohibitive, while existing machine learning surrogates are tied to specific detector geometries and require complete retraining for each design change or alternative detector. We present a transfer learning methodology for generative calorimeter simulation models that enables adaptation across diverse geometries with high data efficiency. Using point cloud representations and pre-training on the International Large Detector, our approach handles new configurations without re-voxelizing showers for each geometry. On the CaloChallenge dataset, transfer learning with only 100 target-domain samples achieves a $51\%$ improvement on the geometric mean of Wasserstein distance over training from scratch. Parameter-efficient fine-tuning with bias-only adaptation achieves competitive performance while updating only $17\%$ of model parameters. Our analysis provides insight into adaptation mechanisms for particle shower development, establishing a baseline for future progress of point cloud approaches in calorimeter simulation.

physics.ins-det↗

arXiv2019

A study for Image compression using Re-Pair algorithm

The compression is an important topic in computer science which allows we to storage more amount of data on our data storage. There are several techniques to compress any file. In this manuscript will be described the most important algorithm to compress images such as JPEG and it will be compared with another method to retrieve good reason to not use this method on images. So to compress the text the most encoding technique known is the Huffman Encoding which it will be explained in exhaustive way. In this manuscript will showed how to compute a text compression method on images in particular the method and the reason to choice a determinate image format against the other. The method studied and analyzed in this manuscript is the Re-Pair algorithm which is purely for grammatical context to be compress. At the and it will be showed the good result of this application.

cs.MM↗