CORTEXA
← Browse
arxivstat.MLcs.LGhep-exhep-thphysics.data-an2026-06-29

Factorizable Normalizing Flows for parameter-dependent density morphing

Davide Valsecchi, Mauro Donegà, Rainer Wallny

Normalizing Flows excel at modeling a single fixed density, yet many problems across the sciences, such as high energy physics, instead require modeling how that density deforms as a function of continuous parameters: the strength of a physical effect, a calibration constant, or a source of systematic uncertainty. Learning a separate flow for every parameter configuration quickly becomes intractable, since the number of joint settings grows exponentially with the number of parameters. We introduce Factorizable Normalizing Flows (FNFs), which represent the parameter-dependent density as a fixed, high-fidelity flow for a reference configuration composed with a learnable transformation that is polynomial in the parameters and factorized over them. This structure has a practical consequence: each parameter's effect is learned in isolation, from samples in which that parameter alone is varied. The combined response of many parameters is then recovered by summation at inference, without ever sampling their combinatorially large joint space. On a controlled problem with two interpretable deformations applied jointly to the data, the learned transformation reproduces the true deformations and matches the optimal likelihood, while optional interaction terms capture residual correlations when several parameters vary strongly at once. The resulting model is interpretable, scales linearly with the number of parameters, and keeps the likelihood tractable. This provides a general tool for any inference workflow requiring continuous density morphing, and directly enables the next generation of unbinned likelihood fits in high energy physics.

View free PDFSource page

Related papers

arxivcs.LGcond-mat.softcs.AIphysics.data-anstat.ML2026-07-21

Deep learning-based prediction of time-resolved adhesive forces in viscoelastic Hertzian contacts

Ali Maghami, Merten Stender, Michele Ciavarella, Antonio Papangelo

Fast prediction of the response of adhesive soft viscoelastic contacts represents a current challenge in soft robotics and for gripping and manipulation tasks. Determining the complete time-resolved force trajectory requires full numerical simulations, whose computational cost is…

View free PDFSource page
arxivcs.LGastro-ph.COastro-ph.GAhep-exhep-phstat.ML2026-07-23

An Introduction to Bayesian and Frequentist Simulation-Based Inference with Machine Learning

Maximilian Dax, Theo Heimel, Gilles Louppe

Simulation-based inference (SBI) with machine learning is an increasingly important tool for solving inverse problems in science and engineering, including parameter inference and the inversion of detector effects. We provide an overview of the Bayesian and frequentist statistica…

View free PDFSource page
arxivstat.MLcs.LG2026-07-01

Neural Network-Based Estimation of Time-Dependent Parameters in AR(p) Processes

Agnieszka Kopeć, Paweł Przybyłowicz, Martyna Wiącek

We investigate a forecasting framework based on a simple discrete-time dynamic model with coefficients varying in time. The parameters of the model are recovered within a deep learning framework, which makes it possible to retain a transparent parametric structure while simultane…

View free PDFSource page
arxivcs.LGcs.IReess.SPstat.ML2026-07-15

Gauge-Invariant, Parameter-Insensitive Regularization for Potential Recovery from Flow on Directed Graphs

Mohammad Forouhesh

Recovering a latent potential from observed flow on a directed graph (a discrete Poisson problem with Dirichlet boundaries) is ill-posed, and the standard fix backfires: ridge regularization shrinks toward a gauge-meaningless origin, collapsing and reversing the recovered orderin…

View free PDFSource page
arxivstat.MLcs.LG2026-07-02

Born Discrete, Made Smooth: Variational Formulation of Shallow Neural Networks

Matej Benko, Pierre Bousquet, Iwona Chlebicka, Błażej Miasojedow

Although neural networks are remarkably effective, their underlying optimization principles remain theoretically elusive, often characterized by non-convex landscapes and stochastic heuristics. In this work, we propose a paradigm shift by replacing the discrete training problem o…

View free PDFSource page