Related papers: Generalized van Trees inequality: Local minimax bo…
We study the estimation capacity of the generalized Lasso, i.e., least squares minimization combined with a (convex) structural constraint. While Lasso-type estimators were originally designed for noisy linear regression problems, it has…
In this paper non-asymptotic exact exponential estimates are derived (under minimal conditions) for the tail of deviation of the MLE distribution in the so-called natural terms: natural function, natural distance, metric entropy, Banach…
In applications it is common that the exact form of a conditional expectation is unknown and having flexible functional forms can lead to improvements. Series method offers that by approximating the unknown function based on $k$ basis…
For fixed size sampling designs with high entropy it is well known that the variance of the Horvitz-Thompson estimator can be approximated by the H\'ajek formula. The interest of this asymptotic variance approximation is that it only…
Asymptotic equivalence in Le Cam's sense for nonparametric regression experiments is extended to the case of non-regular error densities, which have jump discontinuities at their endpoints. We prove asymptotic equivalence of such regression…
This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation…
We study a class of non-local functionals that was introduced by Brezis-Seeger-Van Schaftingen-Yung (2022), and can be used to characterize functions of bounded variation. We give a new lower bound for the liminf of these functionals,…
The least trimmed squares (LTS) estimator is a renowned robust alternative to the classic least squares estimator and is popular in location, regression, machine learning, and AI literature. Many studies exist on LTS, including its…
Le Cam's method (or the two-point method) is a commonly used tool for obtaining statistical lower bound and especially popular for functional estimation problems. This work aims to explain and give conditions for the tightness of Le Cam's…
The concept of biased data is well known and its practical applications range from social sciences and biology to economics and quality control. These observations arise when a sampling procedure chooses an observation with probability that…
We revisit the standard ``telescoping sum'' argument ubiquitous in the final steps of analyzing evaluation complexity of algorithms for smooth nonconvex optimization, and obtain a refined formulation of the resulting bound as a function of…
Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…
Many recent applications in machine learning and data fitting call for the algorithmic solution of structured smooth convex optimization problems. Although the gradient descent method is a natural choice for this task, it requires exact…
We consider the simplest optimal control problem with one nonregular mixed inequality constraint, i.e. when its gradient in the control can vanish on the zero surface. Using the Dubovitskii--Milyutin theorem on the approximate separation of…
The purpose of this note is to show how simple Optimal Transport arguments, on the real line, can be used in Superconcentration theory. This methodology is efficient to produce sharp non-asymptotic variance bounds for various functionals…
Local Asymptotic Normality (LAN) property for fractional Gaussian noise under high-frequency observations is proved with a non-diagonal rate matrix depending on the parameter to be estimated. In contrast to the LAN families in the…
We consider linear regression in the high-dimensional regime where the number of observations $n$ is smaller than the number of parameters $p$. A very successful approach in this setting uses $\ell_1$-penalized least squares (a.k.a. the…
We consider the minimization of integral functionals in one dimension and their approximation by $r$-adaptive finite elements. Including the grid of the FEM approximation as a variable in the minimization, we are able to show that the…
In sparse linear regression, the SLOPE estimator generalizes LASSO by penalizing different coordinates of the estimate according to their magnitudes. In this paper, we present a precise performance characterization of SLOPE in the…
A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…