Related papers: ExSample -- A Library for Sampling Sudakov-Type Di…
Sampling a target probability distribution with an unknown normalization constant is a fundamental challenge in computational science and engineering. Recent work shows that algorithms derived by considering gradient flows in the space of…
Software repositories is one of the sources of data in Empirical Software Engineering, primarily in the Mining Software Repositories field, aimed at extracting knowledge from the dynamics and practice of software projects. With the…
An important step for photonic quantum technologies is the demonstration of a quantum advantage through boson sampling. In order to prevent classical simulability of boson sampling, the photons need to be almost perfectly identical and…
We address the design of distributed systems with synchronous dataflow programming languages. As modular design entails handling both architectural and functional modularity, our first contribution is to extend an existing synchronous…
We present a novel approach for the integration of scattering cross sections and the generation of partonic event samples in high-energy physics. We propose an importance sampling technique capable of overcoming typical deficiencies of…
We discuss two topics in this talk. One is a brief overview of nuclear parton distributions, and the other is SU(2)-flavor-symmetry breaking in {\it nuclear} antiquark distributions. First, we show that nuclear structure functions…
Inference-time algorithms are an emerging paradigm in which pre-trained models are used as subroutines to solve downstream tasks. Such algorithms have been proposed for tasks ranging from inverse problems and guided image generation to…
This paper presents a kernel-based discriminative learning framework on probability measures. Rather than relying on large collections of vectorial training examples, our framework learns using a collection of probability distributions that…
We show for a first time ever a prototype of a fully exclusive QCD NLO parton shower for the initial state (albeit for a limited set of diagrams). It is based on the rigorous theorems of the collinear factorisation, however the standard…
We introduce SpDISTAL, a compiler for sparse tensor algebra that targets distributed systems. SpDISTAL combines separate descriptions of tensor algebra expressions, sparse data structures, data distribution, and computation distribution.…
This work covers methodology of solving QCD evolution equation of the parton distribution using Markovian Monte Carlo (MMC) algorithms in a class of models ranging from DGLAP to CCFM. One of the purposes of the above MMCs is to test the…
The seasonal production of fruit and seeds resembles opening a feeding station, such as a restaurant agents/ customers will arrive at a certain rate and pick fruit (get served) at a certain rate following some appropriate processes.…
The new generation of multi-PetaWatt laser facilities will allow tests of Strong Field QED, as well as provide an opportunity for novel photon and lepton sources. The first experiments are planned to study the (nearly) head-on scattering of…
Channel simulation algorithms can efficiently encode random samples from a prescribed target distribution $Q$ and find applications in machine learning-based lossy data compression. However, algorithms that encode exact samples usually have…
Despite the importance of sparse matrices in numerous fields of science, software implementations remain difficult to use for non-expert users, generally requiring the understanding of underlying details of the chosen sparse matrix storage…
The ensemble average of physical properties of molecules is closely related to the distribution of molecular conformations, and sampling such distributions is a fundamental challenge in physics and chemistry. Traditional methods like…
This thesis describes work on two applications of probabilistic programming: the learning of probabilistic program code given specifications, in particular program code of one-dimensional samplers; and the facilitation of sequential Monte…
Quantifying simulation uncertainties is a critical component of rigorous predictive simulation. A key component of this is forward propagation of uncertainties in simulation input data to output quantities of interest. Typical approaches…
We develop a novel framework for sparse multiscale kernel approximation of large scattered data problems based on a samplet representation. Samplets form a multiresolution analysis of localized discrete signed measures and enable…
Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse…