Searcharxiv⌕ Search

arXiv subjects

Lutz Duembgen

Publications and source records attributed to Lutz Duembgen.

At least 37 records · Page 2Linked to original sources

Monotone Least Squares and Isotonic Quantiles

We consider bivariate observations $(X_1,Y_1), \ldots, (X_n,Y_n)$ such that, conditional on the $X_i$, the $Y_i$ are independent random variables with distribution functions $F_{X_i}$, where $(F_x)_x$ is an unknown family of distribution functions. Under the sole assumption that $x \mapsto F_x$ is isotonic with respect to stochastic order, one can estimate $(F_x)_x$ in two ways: (i) For any fixed $y$ one estimates the antitonic function $x \mapsto F_x(y)$ via nonparametric monotone least squares, replacing the responses $Y_i$ with the indicators $1_{[Y_i \le y]}$. (ii) For any fixed $β\in (0,1)$ one estimates the isotonic quantile function $x \mapsto F_x^{-1}(β)$ via a nonparametric version of regression quantiles. We show that these two approaches are closely related, with (i) being more flexible than (ii). Then, under mild regularity conditions, we establish rates of convergence for the resulting estimators $\hat{F}_x(y)$ and $\hat{F}_x^{-1}(β)$, uniformly over $(x,y)$ and $(x,β)$ in certain rectangles as well as uniformly in $y$ or $β$ for a fixed $x$.

math.ST↗

Inference on a Distribution Function from Ranked Set Samples

Consider independent observations $(X_1,R_1)$, $(X_2,R_2)$, \ldots, $(X_n,R_n)$ with random or fixed ranks $R_i \in \{1,2,\ldots,k\}$, while conditional on $R_i = r$, the random variable $X_i$ has the same distribution as the $r$-th order statistic within a random sample of size $k$ from an unknown continuous distribution function $F$. Such observation schemes are utilized in situations in which ranking observations is much easier than obtaining their precise values. Two well-known special cases are ranked set sampling (McIntyre 1952) and judgement post-stratification (MacEachern et al. 2004). Within a general setting including unbalanced ranked set sampling we derive and compare the asymptotic distributions of three different estimators of the distribution function $F$ as $n \to \infty$ with fixed $k$: The stratified estimator of Stokes and Sager (1988), the nonparametric maximum-likelihood estimator of Kvam and Samaniego (1994) and a moment-based estimator of Chen (2001). Our functional central limit theorems generalize and refine previous asymptotic analyses. In addition we discuss briefly pointwise and simultaneous confidence intervals for the distribution function $F$ with guaranteed coverage probability for finite sample sizes. The methods are illustrated with a real data example, and the potential impact of imperfect rankings is investigated in a small simulation experiment. All in all, the moment-based estimator seems to offer a good compromise between efficiency and robustness versus imperfect ranking, in addition to computational efficiency.

stat.ME↗

Bi-log-concave distribution functions

Nonparametric statistics for distribution functions F or densities f=F' under qualitative shape constraints provides an interesting alternative to classical parametric or entirely nonparametric approaches. We contribute to this area by considering a new shape constraint: F is said to be bi-log-concave, if both log(F) and log(1 - F) are concave. Many commonly considered distributions are compatible with this constraint. For instance, any c.d.f. F with log-concave density f = F' is bi-log-concave. But in contrast to the latter constraint, bi-log-concavity allows for multimodal densities. We provide various characterizations. It is shown that combining any nonparametric confidence band for F with the new shape-constraint leads to substantial improvements, particularly in the tails. To pinpoint this, we show that these confidence bands imply non-trivial confidence bounds for arbitrary moments and the moment generating function of F.

stat.ME↗

(Ab)Using Regression for Data Adjustment

In various economic applications, people want to compare $n$ units with respect to certain quantities $Y_1, Y_2, \ldots, Y_n$ measuring their performance. The latter, however, is often influenced by certain factors which are beyond control of the units, and one would like to extract an adjusted performance from the data. Specifically, let $X_i \in \mathcal{X}$ summarize the factors of the $i$-th unit. Then one could think of a model equation $Y_i = f_o(X_i) + ε_i$ with a regression function $f_o : \mathcal{X} \to \mathbb{R}$ describing the unavoidable influence of the factors $X_i$ and $ε_i$ being the adjusted performance of the $i$-th unit. Now a common proposal is to estimate $f_o$ via regression methods by a function $\hat{f}$ depending on the current data $(X_i,Y_i)$, possibly augmented by additional past data, and to use the residuals $\hatε_i := Y_i - \hat{f}(X_i)$ as surrogates for the adjusted performances $ε_i$. In the present report we discuss this approach, its potential pitfalls and (mis)interpretation. In particular, an unavoidable property of the residuals $\hatε_i$ is that they measure only parts of the adjusted performance while the remaining parts get hidden in the estimated function $\hat{f}$. Possible alternatives are mentioned briefly.

math.ST↗

Geodesic Convexity and Regularized Scatter Estimators

As observed by Auderset et al. (2005) and Wiesel (2012), viewing covariance matrices as elements of a Riemannian manifold and using the concept of geodesic convexity provide useful tools for studying M-estimators of multivariate scatter. In this paper, we begin with a mathematically rigorous self-contained overview of Riemannian geometry on the space of symmetric positive definite matrices and of the notion of geodesic convexity. The overview contains both a review as well as new results. In particular, we introduce and utilize first and second order Taylor expansions with respect to geodesic parametrizations. This enables us to give sufficient conditions for a function to be geodesically convex. In addition, we introduce the concept of geodesic coercivity, which is important in establishing the existence of a minimum to a geodesic convex function. We also develop a general partial Newton algorithm for minimizing smooth and strictly geodesically convex functions. We then use these results to generate a fairly complete picture of the existence, uniqueness and computation of regularized M-estimators of scatter defined using additive geodescially convex penalty terms. Various such penalties are demonstrated which shrink an estimator towards the identity matrix or multiples of the identity matrix. Finally, we propose a cross-validation method for choosing the scaling parameter for the penalty function, and illustrate our results using a numerical example.

stat.ME↗

On an Auxiliary Function for Log-Density Estimation

In this note we provide explicit expressions and expansions for a special function which appears in nonparametric estimation of log-densities. This function returns the integral of a log-linear function on a simplex of arbitrary dimension. In particular it is used in the R-package "LogCondDEAD" by Cule et al. (2007).

stat.CO↗

New Algorithms for $M$-Estimation of Multivariate Scatter and Location

We present new algorithms for $M$-estimators of multivariate scatter and location and for symmetrized $M$-estimators of multivariate scatter. The new algorithms are considerably faster than currently used fixed-point and related algorithms. The main idea is to utilize a second order Taylor expansion of the target functional and to devise a partial Newton-Raphson procedure. In connection with symmetrized $M$-estimators we work with incomplete $U$-statistics to accelerate our procedures initially.

stat.CO↗

M-Functionals of Multivariate Scatter

This survey provides a self-contained account of $M$-estimation of multivariate scatter. In particular, we present new proofs for existence of the underlying $M$-functionals and discuss their weak continuity and differentiability. This is done in a rather general framework with matrix-valued random variables. By doing so we reveal a connection between Tyler's (1987) $M$-functional of scatter and the estimation of proportional covariance matrices. Moreover, this general framework allows us to treat a new class of scatter estimators, based on symmetrizations of arbitrary order. Finally these results are applied to $M$-estimation of multivariate location and scatter via multivariate $t$-distributions.

math.ST↗

A law of the iterated logarithm for Grenander's estimator

In this note we prove the following law of the iterated logarithm for the Grenander estimator of a monotone decreasing density: If $f(t_0) > 0$, $f'(t_0) < 0$, and $f'$ is continuous in a neighborhood of $t_0$, then \begin{eqnarray*} \limsup_{n\rightarrow \infty} \left ( \frac{n}{2\log \log n} \right )^{1/3} ( \widehat{f}_n (t_0 ) - f(t_0) ) = \left| f(t_0) f'(t_0)/2 \right|^{1/3} 2M \end{eqnarray*} almost surely where $ M \equiv \sup_{g \in {\cal G}} T_g = (3/4)^{1/3}$ and $ T_g \equiv \mbox{argmax}_u \{ g(u) - u^2 \} $; here ${\cal G}$ is the two-sided Strassen limit set on $R$. The proof relies on laws of the iterated logarithm for local empirical processes, Groeneboom's switching relation, and properties of Strassen's limit set analogous to distributional properties of Brownian motion.

math.ST↗

Maximum-Likelihood Estimation of a Log-Concave Density based on Censored Data

We consider nonparametric maximum-likelihood estimation of a log-concave density in case of interval-censored, right-censored and binned data. We allow for the possibility of a subprobability density with an additional mass at $+\infty$, which is estimated simultaneously. The existence of the estimator is proved under mild conditions and various theoretical aspects are given, such as certain shape and consistency properties. An EM algorithm is proposed for the approximate computation of the estimator and its performance is illustrated in two examples.

stat.ME↗

Optimal Confidence Bands for Shape-Restricted Curves

Let $Y$ be a stochastic process on $[0,1]$ satisfying $dY(t) = n^{1/2} f(t) dt + dW(t)$, where $n \ge 1$ is a given scale parameter (``sample size''), $W$ is standard Brownian motion and $f$ is an unknown function. Utilizing suitable multiscale tests we construct confidence bands for $f$ with guaranteed given coverage probability, assuming that $f$ is isotonic or convex. These confidence bands are computationally feasible and shown to be asymptotically sharp optimal in an appropriate sense.

math.ST↗

Multiscale Methods for Shape Constraints in Deconvolution: Confidence Statements for Qualitative Features

We derive multiscale statistics for deconvolution in order to detect qualitative features of the unknown density. An important example covered within this framework is to test for local monotonicity on all scales simultaneously. We investigate the moderately ill-posed setting, where the Fourier transform of the error density in the deconvolution model is of polynomial decay. For multiscale testing, we consider a calibration, motivated by the modulus of continuity of Brownian motion. We investigate the performance of our results from both the theoretical and simulation based point of view. A major consequence of our work is that the detection of qualitative features of a density in a deconvolution problem is a doable task although the minimax rates for pointwise estimation are very slow.

math.ST↗

On Low-Dimensional Projections of High-Dimensional Distributions

Let $P$ be a probability distribution on $q$-dimensional space. The so-called Diaconis-Freedman effect means that for a fixed dimension $d << q$, most $d$-dimensional projections of $P$ look like a scale mixture of spherically symmetric Gaussian distributions. The present paper provides necessary and sufficient conditions for this phenomenon in a suitable asymptotic framework with increasing dimension $q$. It turns out, that the conditions formulated by Diaconis and Freedman (1984) are not only sufficient but necessary as well. Moreover, letting $\hat{P}$ be the empirical distribution of $n$ independent random vectors with distribution $P$, we investigate the behavior of the empirical process $\sqrt{n}(\hat{P} - P)$ under random projections, conditional on $\hat{P}$.

math.ST↗

Stochastic Search for Semiparametric Linear Regression Models

This paper introduces and analyzes a stochastic search method for parameter estimation in linear regression models in the spirit of Beran and Millar (1987). The idea is to generate a random finite subset of a parameter space which will automatically contain points which are very close to an unknown true parameter. The motivation for this procedure comes from recent work of Duembgen, Samworth and Schuhmacher (2011) on regression models with log-concave error distributions.

stat.ME↗

Approximation by log-concave distributions, with applications to regression

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if and only if $P$ has finite first moments and is not supported by some hyperplane. Furthermore we show that this approximation depends continuously on $P$ with respect to Mallows distance $D_1(\cdot,\cdot)$. This result implies consistency of the maximum likelihood estimator of a log-concave density under fairly general conditions. It also allows us to prove existence and consistency of estimators in regression models with a response $Y=μ(X)+ε$, where $X$ and $ε$ are independent, $μ(\cdot)$ belongs to a certain class of regression functions while $ε$ is a random error with log-concave density and mean zero.

math.ST↗

Bounding Standard Gaussian Tail Probabilities

We review various inequalities for Mills' ratio (1 - Φ)/ϕ, where ϕand Φdenote the standard Gaussian density and distribution function, respectively. Elementary considerations involving finite continued fractions lead to a general approximation scheme which implies and refines several known bounds.

math.ST↗

Adaptive Confidence Sets for the Optimal Approximating Model

In the setting of high-dimensional linear models with Gaussian noise, we investigate the possibility of confidence statements connected to model selection. Although there exist numerous procedures for adaptive point estimation, the construction of adaptive confidence regions is severely limited (cf. Li, 1989). The present paper sheds new light on this gap. We develop exact and adaptive confidence sets for the best approximating model in terms of risk. One of our constructions is based on a multiscale procedure and a particular coupling argument. Utilizing exponential inequalities for noncentral chi-squared distributions, we show that the risk and quadratic loss of all models within our confidence region are uniformly bounded by the minimal risk times a factor close to one.

math.ST↗