arXiv subjects

Shunan Zhang

Publications and source records attributed to Shunan Zhang.

7 recordsLinked to original sources

arXiv2026

Decorrelation of neural networks from particle lifetimes in the LHCb topological $b$ trigger

The LHCb topological beauty trigger is the primary set of algorithms for selecting collision events containing $b$-hadrons in the fully software-based LHCb trigger. The algorithms apply monotonic Lipschitz neural networks (NNs) to select vertices of charged particles consistent with the distinct topology of a $b$ decay, i.e., those with large lifetimes and transverse momentum. Many analyses of the events recorded require that the selection must be unbiased with respect to the $b$-hadron lifetime at large lifetimes. Accurate reconstruction is challenging in busier detector environments, in which several visible proton-proton collisions occur simultaneously per bunch crossing, such that misassociation of decay products can result in vertices with artificially large measured lifetimes. This paper presents two approaches to mitigate correlations between NN scores and candidate lifetimes at large lifetime, and evaluates the performance of the resulting models.

hep-ex↗

arXiv2025

HealthiVert-GAN: A Novel Framework of Pseudo-Healthy Vertebral Image Synthesis for Interpretable Compression Fracture Grading

Osteoporotic vertebral compression fractures (OVCFs) are prevalent in the elderly population, typically assessed on computed tomography (CT) scans by evaluating vertebral height loss. This assessment helps determine the fracture's impact on spinal stability and the need for surgical intervention. However, the absence of pre-fracture CT scans and standardized vertebral references leads to measurement errors and inter-observer variability, while irregular compression patterns further challenge the precise grading of fracture severity. While deep learning methods have shown promise in aiding OVCFs screening, they often lack interpretability and sufficient sensitivity, limiting their clinical applicability. To address these challenges, we introduce a novel vertebra synthesis-height loss quantification-OVCFs grading framework. Our proposed model, HealthiVert-GAN, utilizes a coarse-to-fine synthesis network designed to generate pseudo-healthy vertebral images that simulate the pre-fracture state of fractured vertebrae. This model integrates three auxiliary modules that leverage the morphology and height information of adjacent healthy vertebrae to ensure anatomical consistency. Additionally, we introduce the Relative Height Loss of Vertebrae (RHLV) as a quantification metric, which divides each vertebra into three sections to measure height loss between pre-fracture and post-fracture states, followed by fracture severity classification using a Support Vector Machine (SVM). Our approach achieves state-of-the-art classification performance on both the Verse2019 dataset and in-house dataset, and it provides cross-sectional distribution maps of vertebral height loss. This practical tool enhances diagnostic accuracy in clinical settings and assisting in surgical decision-making.

eess.IV↗

arXiv2025

The LHCb Sprucing and Analysis Productions

The LHCb detector underwent a comprehensive upgrade in preparation for the third data-taking run of the Large Hadron Collider (LHC), known as LHCb Upgrade I. The increased data rate of Run 3 not only posed data collection (Online) challenges but also significant Offline data processing and analysis ones. The offline processing and analysis model was consequently upgraded to handle the factor 30 increase in data volume and the associated demands of ever-growing analyst-level datasets, led by the LHCb Data Processing and Analysis (DPA) project. This paper documents the LHCb "Sprucing" - the centralised offline processing, selections and streaming of data - and "Analysis Productions" - the centralised and highly automated declarative nTuple production system. The DaVinci application used by analysis productions for tupling spruced data is described as well as the apd and lbconda tools for data retrieval and analysis environment configuration. These tools allow for greatly improved analyst workflows and analysis preservation. Finally, the approach to data processing and analysis in the High-Luminosity Large Hadron Collider (HL-LHC) era - LHCb Upgrade II - is discussed.

hep-ex↗

arXiv2025

A Comprehensive Bandwidth Testing Framework for the LHCb Upgrade Trigger System

The LHCb experiment at CERN has undergone a comprehensive upgrade, including a complete re-design of the trigger system into a hybrid-architecture, software-only system that delivers ten times more interesting signals per unit time than its predecessor. This increased efficiency - as well as the growing diversity of signals physicists want to analyse - makes conforming to crucial operational targets on bandwidth and storage capacity ever more challenging. To address this, a comprehensive, automated testing framework has been developed that emulates the entire LHCb trigger and offline-processing software stack on simulated and real collision data. Scheduled both nightly and on-demand by software testers during development, these tests measure the online- and offline-processing's key operational performance metrics (such as rate and bandwidth), for each of the system's 4000 distinct physics selection algorithms, and their cumulative totals. The results are automatically delivered via concise summaries - to GitLab merge requests and instant messaging channels - that further link to an extensive dashboard of per-algorithm information. The dashboard and pages therein facilitate test-driven trigger development by 100s of physicists, whilst the concise summaries enable efficient, data-driven decision-making by management and software maintainers. This novel bandwidth-testing framework has been helping LHCb build an operationally-viable trigger and data-processing system whilst maintaining the efficiency to satisfy its physics goals.

physics.ins-det↗

arXiv2024

Federated Data Model

In artificial intelligence (AI), especially deep learning, data diversity and volume play a pivotal role in model development. However, training a robust deep learning model often faces challenges due to data privacy, regulations, and the difficulty of sharing data between different locations, especially for medical applications. To address this, we developed a method called the Federated Data Model (FDM). This method uses diffusion models to learn the characteristics of data at one site and then creates synthetic data that can be used at another site without sharing the actual data. We tested this approach with a medical image segmentation task, focusing on cardiac magnetic resonance images from different hospitals. Our results show that models trained with this method perform well both on the data they were originally trained on and on data from other sites. This approach offers a promising way to train accurate and privacy-respecting AI models across different locations.

cs.CV↗

arXiv2021

Sensitivity studies on the CKM angle $γ$ in $Λ_b^0 \to DΛ$ decays

The sensitivity of the CKM angle $γ$ in $Λ_b^0 \to D Λ$ decays has been studied using the decay parameter $α$ as an observable in addition to the decay rate asymmetry. Feasibility studies show that adding this observable improves the sensitivity on $γ$ by up to 60\% and makes the decays one of the most promising places to measure angle $γ$ and to search for $C\!P$ violation in $b$-baryon decays.

hep-ph↗

arXiv2017

Towards Bursting Filter Bubble via Contextual Risks and Uncertainties

A rising topic in computational journalism is how to enhance the diversity in news served to subscribers to foster exploration behavior in news reading. Despite the success of preference learning in personalized news recommendation, their over-exploitation causes filter bubble that isolates readers from opposing viewpoints and hurts long-term user experiences with lack of serendipity. Since news providers can recommend neither opposite nor diversified opinions if unpopularity of these articles is surely predicted, they can only bet on the articles whose forecasts of click-through rate involve high variability (risks) or high estimation errors (uncertainties). We propose a novel Bayesian model of uncertainty-aware scoring and ranking for news articles. The Bayesian binary classifier models probability of success (defined as a news click) as a Beta-distributed random variable conditional on a vector of the context (user features, article features, and other contextual features). The posterior of the contextual coefficients can be computed efficiently using a low-rank version of Laplace's method via thin Singular Value Decomposition. Efficiencies in personalized targeting of exceptional articles, which are chosen by each subscriber in test period, are evaluated on real-world news datasets. The proposed estimator slightly outperformed existing training and scoring algorithms, in terms of efficiency in identifying successful outliers.

stat.ML↗