Related papers: Cram\'er type moderate deviations for intermediate…

We obtain the upper error bounds of robust estimators for mean vector, using the median-of-means (MOM) method. The method is designed to handle data with heavy tails and contamination, with only a finite second moment, which is weaker than…

The transition between the two phases of 4D Euclidean Dynamical Triangulation [1] was long believed to be of second order until in 1996 first order behavior was found for sufficiently large systems [3,4]. However, one may wonder if this…

We prove an asymptotic Cram\'er's theorem, that is, if the sequence $(X_{n}+ Y_{n})_{n\geq 1}$ converges in law to the standard normal distribution and for every $n\geq 1$ the random variables $X_{n}$ and $Y_{n}$ are independent, then…

In this paper we consider the (weighted) spectral measure $\mu_n$ of a $n\times n$ random matrix, distributed according to a classical Gaussian, Laguerre or Jacobi ensemble, and show a moderate deviation principle for the standardised…

This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…

Clustering is a fundamental problem in many scientific applications. Standard methods such as $k$-means, Gaussian mixture models, and hierarchical clustering, however, are beset by local minima, which are sometimes drastically suboptimal.…

We study moderate deviations of suprema of parametrized sequences of sample bounded Gaussian processes $\{X _x(t), t\in T _x\}$, and first present recent sharp bounds in simple cases. In the almost periodic case, we prove an approximation…

We study a class of sampled stochastic optimization problems, where the underlying state process has diffusive dynamics of the mean-field type. We establish the existence of optimal relaxed controls when the sample set has finite size. The…

We give a new large deviation inequality for sums of random variables of the form $Z_k = f(X_k,X_t)$ for $k,t\in \mathbb{N}$, $t$ fixed, where the underlying process $X$ is $\beta$-mixing. The inequality can be used to derive concentration…

Stochastic majorization-minimization (SMM) is a class of stochastic optimization algorithms that proceed by sampling new data points and minimizing a recursive average of surrogate functions of an objective function. The surrogates are…

This paper deals with parameter estimation from extreme measurements. While being a special case of parameter estimation from partial data, in scenarios where only one sample from a given set of K measurements can be extracted, choosing…

This article presents identification results for the marginal treatment effect (MTE) when there is sample selection. We show that the MTE is partially identified for individuals who are always observed regardless of treatment, and derive…

In this paper we consider the use of the space vs. time Kronecker product decomposition in the estimation of covariance matrices for spatio-temporal data. This decomposition imposes lower dimensional structure on the estimated covariance…

We consider the problem of testing for a difference in means between clusters of observations identified via k-means clustering. In this setting, classical hypothesis tests lead to an inflated Type I error rate. To overcome this problem, we…

We investigate the finite sample performance of sample splitting, cross-fitting and averaging for the estimation of the conditional average treatment effect. Recently proposed methods, so-called meta-learners, make use of machine learning…

We address general-shaped clustering problems under very weak parametric assumptions with a two-step hybrid robust clustering algorithm based on trimmed k-means and hierarchical agglomeration. The algorithm has low computational complexity…

The problem of measuring a time-varying phase, even when the statistics of the variation is known, is considerably harder than that of measuring a constant phase. In particular, the usual bounds on accuracy - such as the $1/(4\bar{n})$…

Estimating the kernel mean in a reproducing kernel Hilbert space is a critical component in many kernel learning algorithms. Given a finite sample, the standard estimate of the target kernel mean is the empirical average. Previous works…

In multiparameter quantum metrology, the weighted-arithmetic-mean error of estimation is often used as a scalar cost function to be minimized during design optimization. However, other types of mean error can reveal different facets of…

We consider non-convex stochastic optimization using first-order algorithms for which the gradient estimates may have heavy tails. We show that a combination of gradient clipping, momentum, and normalized gradient descent yields convergence…