Deterministic Inequalities for Smooth M-estimators
Not on the map. Why?
Abstract (arXiv)
Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of M-estimators with smooth/differentiable loss function. Although the Taylor series expansion is a purely deterministic tool, the realization that the asymptotic normality results can also be made deterministic (and so finite sample) received far less attention. With the advent of big data and high-dimensional statistics, the need for finite sample results has increased. In this paper, we use the (well-known) Banach fixed point theorem to derive various deterministic inequalities that lead to the classical results when studied under randomness. In addition, we provide applications of these deterministic inequalities for crossvalidation/subsampling, marginal screening and uniform-in-submodel results that are very useful for post-selection inference and in the study of post-regularization estimators. Our results apply to many classical estimators, in particular, generalized linear models, non-linear regression and cox proportional hazards model. Extensions to non-smooth and constrained problems are also discussed.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.
- 2024Scaling Laws for the Value of Individual Data Points in Machine Learningcited by 10
- 2021Sharper Sub-Weibull Concentrationscited by 8
- 2024Scaling Laws for the Value of Individual Data Points in Machine Learning30 May 2024
- 2021Sharper Sub-Weibull Concentrations4 Feb 2021