Related papers: On normal approximations to $U$-statistics

This paper investigates weighted approximations for studentized $U$-statistics type processes, both with symmetric and antisymmetric kernels, only under the assumption that the distribution of the projection variate is in the domain of…

We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation…

We study a class of non-convex and non-smooth problems with \textit{rank} regularization to promote sparsity in optimal solution. We propose to apply the proximal gradient descent method to solve the problem and accelerate the process with…

In this paper we extend the work of Owen (2007) by deriving a second order expansion for the slope parameter in logistic regression, when the size of the majority class is unbounded and the minority class is finite. More precisely, we…

Minimization of the $L_\infty$ norm, which can be viewed as approximately solving the non-convex least median estimation problem, is a powerful method for outlier removal and hence robust regression. However, current techniques for solving…

Let U(N) denote the maximal length of arithmetic progressions in a random uniform subset of {0,1}^N. By an application of the Chen-Stein method, we show that U(N)- 2 log(N)/log(2) converges in law to an extreme type (asymmetric)…

The main contribution of this paper is a mathematical definition of statistical sparsity, which is expressed as a limiting property of a sequence of probability distributions. The limit is characterized by an exceedance measure~$H$ and a…

In this paper we prove convergence to a steady state as $t\to\infty$ for solutions to the subdiffusion equation \[ \partial_t^\alpha u - \mathbb{L} u = q(x)u - p(x)f(u) + r \] with the exponential ($\alpha=1$) or power law…

The commonly cited rule of thumb for regression analysis, which suggests that a sample size of $n \geq 30$ is sufficient to ensure valid inferences, is frequently referenced but rarely scrutinized. This research note evaluates the lower…

Uniform and nonuniform Berry--Esseen (BE) bounds of optimal orders on the closeness to normality for general abstract nonlinear statistics are given, which are then used to obtain optimal bounds on the rate of convergence in the delta…

The $L_2$-norm, or collision norm, is a core entity in the analysis of distributions and probabilistic algorithms. Batu and Canonne (FOCS 2017) presented an extensive analysis of algorithmic aspects of the $L_2$-norm and its connection to…

Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…

This paper investigates the zero relaxation limit for general linear hyperbolic relaxation systems and establishes the asymptotic convergence of slow variables under the unimprovable weakest stability condition, akin to the Lax equivalence…

Let $ r, s>0 $. For a given probability measure $P$ on $\mathbb{R}^d$, let $(\alpha_n)_{n \geq 1}$ be a sequence of (asymptotically) $L^r(P)$- optimal quantizers. For all $\mu \in \mathbb{R}^d $ and for every $\theta >0$, one defines the…

We study $L^2$-maximal regularity for non-autonomous evolution equations of the form \begin{equation}\label{Abstract equation} \dot u(t)+\mathcal A(t)u(t)=f(t)\ \ t\in[0,T],\ \ u(0)=u_0. \end{equation} where $\mathcal A(t),\ t\in [0,T]$…

Following the student t-statistic, normalization has been a widely used method in statistic and other disciplines including economics, ecology and machine learning. We focus on statistics taking the form of a ratio over (some power of) the…

We obtain minimax-optimal convergence rates in the supremum norm, including information-theoretic lower bounds, for estimating the covariance kernel of a stochastic process which is repeatedly observed at discrete, synchronous design…

We study the convergence rate of the optimal quantization for a probability measure sequence $(\mu_{n})_{n\in\mathbb{N}^{*}}$ on $\mathbb{R}^{d}$ converging in the Wasserstein distance in two aspects: the first one is the convergence rate…

We consider the Random Euclidean Assignment Problem in dimension $d=1$, with linear cost function. In this version of the problem, in general, there is a large degeneracy of the ground state, i.e. there are many different optimal matchings…

Uniform convergence rates are provided for asymptotic representations of sample extremes. These bounds which are universal in the sense that they do not depend on the extreme value index are meant to be extended to arbitrary samples…