Related papers: Responsive Distribution of G-normal Random Variabl…

We consider the Bayesian nonparametric estimation of a nonlinear reaction function in a reaction-diffusion stochastic partial differential equation (SPDE). The likelihood is well-defined and tractable by the infinite-dimensional Girsanov…

We derive a novel variational expectation maximization approach based on truncated posterior distributions. Truncated distributions are proportional to exact posteriors within subsets of a discrete state space and equal zero otherwise. The…

Thurstone's latent-normal model, introduced a century ago to describe human preferences in psychometrics (1927), remains a cornerstone for modeling random rankings. Yet when the underlying normals differ in distribution, the joint law of…

We derive an efficient stochastic algorithm for inverse problems that present an unknown linear forcing term and a set of nonlinear parameters to be recovered. It is assumed that the data is noisy and that the linear part of the problem is…

This paper offers a precise analytical characterization of the distribution of returns for a portfolio constituted of assets whose returns are described by an arbitrary joint multivariate distribution. In this goal, we introduce a…

Consider a pair of cumulative distribution functions $F$ and $G$, where $F$ is unknown and $G$ is a known reference distribution. Given a sample from $F$, we propose tests to detect the convexity or the concavity of $G^{-1}\circ F$ versus…

The recursive and hierarchical structure of full rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. In most of these cases, the full rooted tree is…

Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize…

Let $X_1,\,X_2,\,\ldots,\,X_N$, $N\in\mathbb{N}$ be independent but not necessarily identically distributed discrete and integer-valued random variables. Assume that $X_1\geqslant m_1$, $X_2\geqslant m_2$, $\ldots$, $X_N\geqslant m_N$…

In this paper, we consider the stochastic optimal control problems under G-expectation. Based on the theory of backward stochastic differential equations driven by G-Brownian motion, which was introduced in [10.11], we can investigate the…

Motivated by numerous questions in random geometry, given a smooth manifold $M$, we approach a systematic study of the differential topology of Gaussian random fields (GRF) $X:M\to \mathbb{R}^k$, that we interpret as random variables with…

This paper is devoted to the development of adaptive control schemes for uncertain discrete-time systems, which guarantee robust, global, exponential convergence to the desired equilibrium point of the system. The proposed control scheme…

Our work is devoted to the study of Pontryagin's stochastic maximum principle for a mean-field optimal control problem under Peng's $G$-expectation. The dynamics of the controlled state process is given by a stochastic differential equation…

We consider a discrete time stochastic Markovian control problem under model uncertainty. Such uncertainty not only comes from the fact that the true probability law of the underlying stochastic process is unknown, but the parametric family…

We address the computational efficiency in solving the A-optimal Bayesian design of experiments problems for which the observational map is based on partial differential equations and, consequently, is computationally expensive to evaluate.…

Let $X_1,\dots,X_n$ be independent nonnegative random variables (r.v.'s), with $S_n:=X_1+\dots+X_n$ and finite values of $s_i:=E X_i^2$ and $m_i:=E X_i>0$. Exact upper bounds on $E f(S_n)$ for all functions $f$ in a certain class…

In certain problems in a variety of applied probability settings (from probabilistic analysis of algorithms to statistical physics), the central requirement is to solve a recursive distributional equation of the form X =^d…

Graph Neural Networks (GNNs) have emerged as a flexible and powerful approach for learning over graphs. Despite this success, existing GNNs are constrained by their local message-passing architecture and are provably limited in their…

We show that unconverged stochastic gradient descent can be interpreted as a procedure that samples from a nonparametric variational approximate posterior distribution. This distribution is implicitly defined as the transformation of an…

We consider fully connected and feedforward deep neural networks with dependent and possibly heavy-tailed weights, as introduced in [26], to address limitations of the standard Gaussian prior. It has been proved in [26] that, as the number…