Related papers: Approximation by mixtures of multivariate Erlang d…
Embedding complex objects as vectors in low dimensional spaces is a longstanding problem in machine learning. We propose in this work an extension of that approach, which consists in embedding objects as elliptical probability…
In many modern applications, difficulty in evaluating the posterior density makes performing even a single MCMC step slow. This difficulty can be caused by intractable likelihood functions, but also appears for routine problems with large…
Assuming that $\phi(t)=o(t^2)$ as $t\to0$, we establish a lemma on simultaneous polynomial approximation in Orlicz-Beurling-Sobolev spaces $\ell_a^{\phi}$. These spaces, endowed with the Luxemburg norm $\Vert \cdot \Vert_{\ell^{\phi}}$,…
In this paper, we study the convergence rates of empirical spectral distribution of large dimensional quaternion sample covariance matrix. Assume that the entries of $\mathbf X_n$ ($p\times n$) are independent quaternion random variables…
Finite mixture models have long been used across a variety of fields in engineering and sciences. Recently there has been a great deal of interest in quantifying the convergence behavior of the \emph{mixing measure}, a fundamental object…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…
We introduce a family of random $c$-L\"uroth transformations $\{L_c\}_{c \in [0, \frac12]}$, obtained by randomly combining the standard and alternating L\"uroth maps with probabilities $p$ and $1-p$, $0 < p < 1$, both defined on the…
We introduce multilevel Picard (MLP) approximations for McKean--Vlasov stochastic differential equations (SDEs) with nonconstant diffusion coefficient. Under standard Lipschitz assumptions on the coefficients, we show that the MLP algorithm…
We investigated the asymptotics of high-rate constrained quantization errors for a compactly supported probability measure P on Euclidean spaces whose quantizers are confined to a closed set S. The key tool is the metric projection of K…
We study minimax density estimation on the product space $\mathbb{R}^{d_1}\times\mathbb{R}^{d_2}$. We consider $L^p$-risk for probability density functions defined over regularity spaces that allow for different level of smoothness in each…
We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some linear methods of this approximation for univariate functions in the class induced by the convolution…
In this paper, we investigate the almost surely pointwise convergence problem of free KdV equation, free wave equation, free elliptic and non-elliptic Schr\"odinger equation respectively. We firstly establish some estimates related to the…
We study frequentist risk properties of predictive density estimators for mean mixtures of multivariate normal distributions, involving an unknown location parameter $\theta \in \mathbb{R}^d$, and which include multivariate skew normal…
We study the Finite-Dimensional Distributions (FDDs) of deep neural networks with randomly initialized weights that have finite-order moments. Specifically, we establish Gaussian approximation bounds in the Wasserstein-$1$ norm between the…
We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…
We introduce a novel concept of convergence for Markovian processes within Orlicz spaces, extending beyond the conventional approach associated with $L_p$ spaces. After showing that Markovian operators are contractive in Orlicz spaces, our…
The K-means algorithm is among the most commonly used data clustering methods. However, the regular K-means can only be applied in the input space and it is applicable when clusters are linearly separable. The kernel K-means, which extends…
Strong convergence and convergence in probability were generalized to the setting of a Riesz space with conditional expectation operator, $T$, in [{{\sc Y. Azouzi, W.-C. Kuo, K. Ramdane, B. A. Watson}, {Convergence in Riesz spaces with…
We prove a weak converse estimate for the simultaneous approximation by several forms of the Bernstein polynomials with integer coefficients. It is stated in terms of moduli of smoothness. In particular, it yields a big $O$-characterization…