Recognition: unknown
Asymptotics for minimisers of convex processes
read the original abstract
By means of two simple convexity arguments we are able to develop a general method for proving consistency and asymptotic normality of estimators that are defined by minimisation of convex criterion functions. This method is then applied to a fair range of different statistical estimation problems, including Cox regression, logistic and Poisson regression, least absolute deviation regression outside model conditions, and pseudo-likelihood estimation for Markov chains. Our paper has two aims. The first is to exposit the method itself, which in many cases, under reasonable regularity conditions, leads to new proofs that are simpler than the traditional proofs. Our second aim is to exploit the method to its limits for logistic regression and Cox regression, where we seek asymptotic results under as weak regularity conditions as possible. For Cox regression in particular we are able to weaken previously published regularity conditions substantially.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Nonparametric Empirical Bayes Confidence Intervals
NP-EBCIs achieve asymptotic exact coverage for individual effects at logarithmic rates and shorten intervals in simulations compared to isolated treatment.
-
A Robust Framework for Two-Sample Mendelian Randomization under Population Heterogeneity
A model-free estimator for causal effects in two-sample Mendelian randomization that is consistent and asymptotically normal under population heterogeneity between samples.
-
Separating Geometry from Probability in the Analysis of Generalization
Generalization bounds can be obtained deterministically via sensitivity analysis of optimization problems, with probabilistic assumptions used ex post to bound the error term measuring closeness of out-of-sample to in...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.