On asymptotics of the discrete convex LSE of a pmf
classification
🧮 math.ST
stat.TH
keywords
convexdistributionalgorithmarticleasymptoticscertaindefinedderive
read the original abstract
In this article, we derive the weak limiting distribution of the least squares estimator (LSE) of a convex probability mass function (pmf) with a finite support. We show that it can be defined via a certain convex projection of a Gaussian vector. Furthermore, samples of any given size from this limit distribution can be generated using an efficient Dykstra-like algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.