arXiv Machine Learning

Mono-Z Dark Matter Search with Neural Spline Flows Using CMS Run 2015D Open Data

arXiv:2607. 13771v1 Announce Type: new Abstract: We report a search for dark matter (DM) produced in association with a leptonically decaying \(Z\) boson at \(\sqrt{s}=13\) TeV using CMS Run 2015D open data corresponding to an integrated luminosity of \(2.

arXiv Machine Learning
Sep 4

Hadronic Mono-Z Dark Matter Sensitivity with Flow Matching on CMS Open Data

The paper projects the sensitivity of a hadronic mono‑Z dark‑matter search using CMS Run 2015D HTMHT open data (2.256 fb⁻¹). A conditional flow‑matching normalizing flow models backgrounds, with careful handling of missing features and a sentinel imputation strategy. The baseline analysis yields expected significances of 2.89σ, 7.62σ, and 7.41σ for three benchmark models, and an ablation study shows that extra‑jet kinematics contribute 53–71% of the discriminating power.

By Hitesh Rasineni (VIT-AP University, Amaravati, India), Bhavishya Chebrolu (Mohan Babu University, Tirupati, India)
arXiv Machine Learning
Sep 10

Likelihood-Based Unsupervised Anomaly Detection in CMS Dijet Events

arXiv:2609.06686v1 Announce Type: cross Abstract: We present an unsupervised search for anomalous dijet events in proton--proton collision data using neural spline flow density estimation. A normaliz...

By Bhavishya Chebrolu (VIT-AP University, Amaravati, India), Hitesh Rasineni (VIT-AP University, Amaravati, India), Prajwal Aaryan Immadi (VIT-AP University, Amaravati, India)
arXiv AI
Sep 7

Phase Transition Frequency as a Training Time Predictor of Test Accuracy in ResNets

The study investigates whether the number of discrete class‑separability jumps (phase transitions) observed during ResNet fine‑tuning can predict final test accuracy. Across 75 experiments on four benchmarks (CIFAR‑10, CIFAR‑100, TinyImageNet, CIFAR‑10‑C) and three ResNet variants, a strong negative correlation is found on standard i.i.d. datasets (r = −0.84 on CIFAR‑10, r = −0.87 on CIFAR‑100), while the correlation weakens under distributional stress. Additional analyses show that the transition count retains predictive power after controlling for architecture depth and outperforms other training‑curve signals on in‑distribution benchmarks, though it is dominated by other signals on stressed datasets.

By Arunan J
arXiv Machine Learning
Sep 23

Practical Scaling Laws: Converting Compute into Performance in a Data-Constrained World

The paper introduces a new closed‑form scaling law that extends Chinchilla’s original formula to handle data‑constrained regimes. It decomposes loss into undercapacity, undertraining, and overfitting components, saturating between an irreducible loss and an uninformed baseline. The authors validate the model on diverse architectures and domains, achieving state‑of‑the‑art RMSE across multiple LLM scaling‑law grids and enabling cost‑aware training allocations.

By Christopher M. Bryant, Hao Liu