Related papers: Cram\'{e}r type large deviations for trimmed L-sta…
The asymptotic behavior of the stochastic gradient algorithm with a biased gradient estimator is analyzed. Relying on arguments based on the dynamic system theory (chain-recurrence) and the differential geometry (Yomdin theorem and…
In various disordered systems or non-equilibrium dynamical models, the large deviations of some observables have been found to display different scalings for rare values bigger or smaller than the typical value. In the present paper, we…
In this paper we derive a Large Deviation Principle (LDP) for inhomogeneous U/V-statistics of a general order. Using this, we derive a LDP for two types of statistics: random multilinear forms, and number of monochromatic copies of a…
The asymptotic distribution of a wide class of V- and U-statistics with estimated parameters is derived in the case when the kernel is not necessarily differentiable along the parameter. The results have their application in goodness-of-fit…
Simulation from the truncated multivariate normal distribution in high dimensions is a recurrent problem in statistical computing, and is typically only feasible using approximate MCMC sampling. In this article we propose a minimax tilting…
Computing the similarity between two probability distributions is a recurring theme across control. We introduce a unified family of distances between the probability distributions of two random variables that is based on the discrepancy…
Sorted L-One Penalized Estimator (SLOPE) is a relatively new convex optimization procedure for selecting predictors in large data bases. Contrary to LASSO, SLOPE has been proved to be asymptotically minimax in the context of sparse…
We study the large deviation principle (LDP) for locally damped nonlinear wave equations perturbed by a bounded noise. When the noise is sufficiently non-degenerate, we establish the LDP for empirical distributions with lower bound of a…
Let $(\xi_i,\mathcal{F}_i)_{i\geq1}$ be a sequence of martingale differences. Set $X_n=\sum_{i=1}^n \xi_i $ and $ \langle X \rangle_n=\sum_{i=1}^n \mathbf{E}(\xi_i^2|\mathcal{F}_{i-1}).$ We prove Cram\'er's moderate deviation expansions for…
An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are…
We develop a quantitative large deviations theory for random hypergraphs, which rests on tensor decomposition and counting lemmas under a novel family of cut-type norms. As our main application, we obtain sharp asymptotics for joint upper…
Thomas' partial likelihood estimator of regression parameters is widely used in the analysis of nested case-control data with Cox's model. This paper proposes a new estimator of the regression parameters, which is consistent and…
This paper introduces the Trimmed Functional Empirical Process (TFEP) as a robust framework for statistical inference when dealing with heavy-tailed or skewed distributions, where classical moments such as the mean or variance may be…
A telegraph process with an elastic barrier at the origin was studied in [5]; in particular the number of visits of the origin before the absorption is a geometric distributed random variable M. Some asymptotic results (large and moderate…
High-dimensional limit theorems have been shown useful to derive tuning rules for finding the optimal scaling in random-walk Metropolis algorithms. The assumptions under which weak convergence results are proved are however restrictive: the…
This article carries out a large dimensional analysis of standard regularized discriminant analysis classifiers designed on the assumption that data arise from a Gaussian mixture model with different means and covariances. The analysis…
Explicit discretizations of stochastic differential equations often encounter instability when the coefficients are not globally Lipschitz. The truncated schemes and tamed schemes have been proposed to handle this difficulty, but truncated…
We study estimation of large Dynamic Factor models implemented through the Expectation Maximization (EM) algorithm, jointly with the Kalman smoother. We prove that as both the cross-sectional dimension, $n$, and the sample size, $T$,…
The $W$-random graphs provide a flexible framework for modeling large random networks. Using the Large Deviation Principle (LDP) for $W$-random graphs from [9], we prove the LDP for the corresponding class of random symmetric…
We revisit the estimation of the extreme value index for randomly censored data from a heavy tailed distribution. We introduce a new class of estimators which encompasses earlier proposals given in Worms and Worms (2014) and Beirlant et al.…