Searcharxiv⌕ Search

arXiv subjects

Jon A. Wellner

Publications and source records attributed to Jon A. Wellner.

57 records · Page 4Linked to original sources

Estimation of a k-monotone density, part 1: characterizations consistency, and minimax lower bounds

Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to be k-monotone if its successive derivatives up to order k-2 are alternately negative or positive, with the k-2 derivative convex (or concave) according as k is even (or odd) respectively. g is simply nonincreasing if k=1. These classes of shape constrained densities bridge the gap between the classes of monotone (1-monotone) and convex decreasing (2-monotone) densities for which asymptotic results are known, and the class of completely monotone densities with k infinite. In this series of four papers we consider both (nonparametric) Maximum Likelihood estimators and Least Squares estimators of a k-monotone density. In this first part (part 1), we prove existence of the estimators and give characterizations. We also establish consistency properties, and show that the estimators are splines of order k (degree k-1) with simple knots. We further provide asymptotic minimax risk lower bounds for estimating a k-monotone density g_0 (x_0) and its derivatives g_0^{(j)}(x_0), for j=1, ..., k-1, at a fixed point x_0 under the assumption that the k-th derivative of g_0 at x_0 is non-zero.

math.ST↗

Information bounds for Cox regression models with missing data

We derive information bounds for the regression parameters in Cox models when data are missing at random. These calculations are of interest for understanding the behavior of efficient estimation in case-cohort designs, a type of two-phase design often used in cohort studies. The derivations make use of key lemmas appearing in Robins, Rotnitzky and Zhao [J. Amer. Statist. Assoc. 89 (1994) 846-866] and Robins, Hsieh and Newey [J. Roy. Statist. Soc. Ser. B 57 (1995) 409-424], but in a form suited for our purposes here. We begin by summarizing the results of Robins, Rotnitzky and Zhao in a form that leads directly to the projection method which will be of use for our model of interest. We then proceed to derive new information bounds for the regression parameters of the Cox model with data Missing At Random (MAR). In the final section we exemplify our calculations with several models of interest in cohort studies, including an i.i.d. version of the classical case-cohort design of Prentice [Biometrika 73 (1986) 1-11]

math.ST↗

The suppport reduction algorithm for computing nonparametric function estimates in mixture models

Vertex direction algorithms have been around for a few decades in the experimental design and mixture models literature. We briefly review this type of algorithm and describe a new member of the family: the support reduction algorithm. The support reduction algorithm is applied to the problem of computing nonparametric estimates in two inverse problems: convex density estimation and the Gaussian deconvolution problem. Usually, VD algorithms solve a finite dimensional (version of the) optimization problem of interest. We introduce a method to solve the true infinite dimensional optimization problem.

math.ST↗