Related papers: The Cumulative Distribution Function Based Method …
We present a quantum cellular automaton model in one space-dimension which has the Dirac equation as emergent. This model, a discrete-time and causal unitary evolution of a lattice of quantum systems, is derived from the assumptions of…
We introduce a novel generative model for the representation of joint probability distributions of a possibly large number of discrete random variables. The approach uses measure transport by randomized assignment flows on the statistical…
Diffusion probabilistic models (DPMs) have emerged as a promising technique in generative modeling. The success of DPMs relies on two ingredients: time reversal of diffusion processes and score matching. In view of possibly unguaranteed…
We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…
In this article, we introduce a random (directed) graph model for the simultaneous forwards and backwards description of a rather broad class of Cannings models with a seed bank mechanism. This provides a simple tool to establish a sampling…
The notion of concept drift refers to the phenomenon that the data generating distribution changes over time; as a consequence machine learning models may become inaccurate and need adjustment. In this paper we consider the problem of…
The purpose of the present study is to search one-dimensional Cellular Automata (CA) rules which will solve the density classification task (DCT) perfectly. The mathematical analysis of number conserving functions over binary strings of…
Distributional regression aims at estimating the conditional distribution of a targetvariable given explanatory co-variates. It is a crucial tool for forecasting whena precise uncertainty quantification is required. A popular methodology…
In this paper, we study communication efficient distributed algorithms for distributionally robust federated learning via periodic averaging with adaptive sampling. In contrast to standard empirical risk minimization, due to the minimax…
In the context of continuously rising global air traffic, efficient and safe Conflict Detection and Resolution (CD&R) is paramount for air traffic management. Although Deep Reinforcement Learning (DRL) offers a promising pathway for CD&R…
In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution. Our variant allows for tighter…
Widely used models in genetics include the Wright-Fisher diffusion and its moment dual, Kingman's coalescent. Each has a multilocus extension but under neither extension is the sampling distribution available in closed-form, and their…
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be very efficient in solving high dimensional problems. Even though…
In subdivided populations, migration acts together with selection and genetic drift and determines their evolution. Building up on a recently proposed method, which hinges on the emergence of a time scale separation between local and global…
In this letter, a novel solution method of generalized robust chance constrained real-time dispatch (GRCC-RTD) considering wind power uncertainty is proposed. GRCC models are advantageous in dealing with distributional uncertainty, however,…
Simultaneously performing variable selection and inference in high-dimensional regression models is an open challenge in statistics and machine learning. The increasing availability of vast amounts of variables requires the adoption of…
Drift diffusion models (DDMs) have found widespread use in computational neuroscience and other fields. They model evidence accumulation in simple decision tasks as a stochastic process drifting towards a decision barrier. In models where…
We introduce a simple, accurate, and extremely efficient method for numerically solving the multi-marginal optimal transport (MMOT) problems arising in density functional theory. The method relies on (i) the sparsity of optimal plans [for…
We consider biased random walks on random networks constituted by a random comb comprising a backbone with quenched-disordered random-length branches. The backbone and the branches run in the direction of the bias. For the bare model as…
Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly…