Related papers: Finite-sample bounds to the normal limit under gro…
This paper provides a solution to the evaluation of treatment effects in selective samples when neither instruments nor parametric assumptions are available. We provide sharp bounds for average treatment effects under a conditional…
We study distribution-free nonparametric regression following a notion of average smoothness initiated by Ashlagi et al. (2021), which measures the "effective" smoothness of a function with respect to an arbitrary unknown underlying…
In this contribution, we derive explicit bounds on the Kolmogorov distance for multivariate max-stable distributions with Fr\'echet margins. We formulate those bounds in terms of (i) Wasserstein distances between de Haan representers, (ii)…
It is known that state-dependent, multi-step Lyapunov bounds lead to greatly simplified verification theorems for stability for large classes of Markov chain models. This is one component of the "fluid model" approach to stability of…
This paper establishes asymptotic results for the maximum likelihood and restricted maximum likelihood (REML) estimators of the parameters in the nested error regression model for clustered data when both of the number of independent…
Learning the minimum/maximum mean among a finite set of distributions is a fundamental sub-task in planning, game tree search and reinforcement learning. We formalize this learning task as the problem of sequentially testing how the minimum…
We establish inequalities for assessing the distance between the distribution of errors of partially observed high-frequency statistics of multidimensional L\'evy processes and that of a mixed Gaussian random variable. Furthermore, we…
We study nonparametric estimation of the sub-distribution functions for current status data with competing risks. Our main interest is in the nonparametric maximum likelihood estimator (MLE), and for comparison we also consider a simpler…
The Ising spin glass is a one-parameter exponential family model for binary data with quadratic sufficient statistic. In this paper, we show that given a single realization from this model, the maximum pseudolikelihood estimate (MPLE) of…
In this paper, we analyze the finite sample complexity of stochastic system identification using modern tools from machine learning and statistics. An unknown discrete-time linear system evolves over time under Gaussian noise without…
The inference procedure for the mean of a stationary time series is usually quite different under various model assumptions because the partial sum process behaves differently depending on whether the time series is short or long-range…
Stochastic Gradient Descent (SGD) based methods have been widely used for training large-scale machine learning models that also generalize well in practice. Several explanations have been offered for this generalization performance, a…
The Highly-Adaptive-Lasso(HAL)-TMLE is an efficient estimator of a pathwise differentiable parameter in a statistical model that at minimal (and possibly only) assumes that the sectional variation norm of the true nuisance parameters are…
One of the most common methods for statistical inference is the maximum likelihood estimator (MLE). The MLE needs to compute the normalization constant in statistical models, and it is often intractable. Using unnormalized statistical…
Consider a measure $\mu_\lambda = \sum_x \xi_x \delta_x$ where the sum is over points $x$ of a Poisson point process of intensity $\lambda$ on a bounded region in $d$-space, and $\xi_x$ is a functional determined by the Poisson points near…
In real life we often deal with independent but not identically distributed observations (i.n.i.d.o), for which the most well-known statistical model is the multiple linear regression model (MLRM) without random covariates. While the…
We consider Ewens random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$ and to study the asymptotic behaviour as $n\to\infty$. We obtain very precise information on the joint distribution of…
The normality assumption for random errors is fundamental in the analysis of variance (ANOVA) models. However, it is rarely subjected to formal testing in practice, and theoretically justified procedures are largely unavailable, especially…
Let $S_{n}$ be a sum of independent identically distribution random variables with finite first moment and $h_{M}$ be a call function defined by $g_{M}(x)=\max\{x-M,0\}$ for $x\in\mathbb{R}$, $M>0$. In this paper, we assume the random…
Early stopping of iterative algorithms is an algorithmic regularization method to avoid over-fitting in estimation and classification. In this paper, we show that early stopping can also be applied to obtain the minimax optimal testing in a…